Related papers: Optimizing Bit-Labeling of Voronoi Constellations
Lattices are a popular field of study in mathematical research, but also in more practical areas like cryptology or multiple-input/multiple-output (MIMO) transmission. In mathematical theory, most often lattices over real numbers are…
The objective of this paper is to design optimal signature matrices for binary inputs. For the determination of such optimal codes, we need certain measures as objective functions. The sum-channel capacity and Bit Error Rate (BER) measures…
In current wireless systems, the base-Station (eNodeB) tries to serve its user-equipment (UE) at the highest possible rate that the UE can reliably decode. The eNodeB obtains this rate information as a quantized feedback from the UE at time…
We study the problem of estimating a rank one signal matrix from an observed matrix generated by corrupting the signal with additive rotationally invariant noise. We develop a new class of approximate message-passing algorithms for this…
Neutral-meson mixing is loop suppressed in the Standard Model, leading to the possibility of enhanced sensitivity to new physics. The uncertainty in Standard Model predictions for $B$-meson oscillation frequencies is dominated by…
We describe a new method to map the requested error tolerance on an H-matrix approximation to the block error tolerances. Numerical experiments show that the method produces more efficient approximations than the standard method for kernels…
Random Search is one of the most widely-used method for Hyperparameter Optimization, and is critical to the success of deep learning models. Despite its astonishing performance, little non-heuristic theory has been developed to describe the…
The Viterbi algorithm, presented in 1967, allows a maximum likelihood decoding of partial response codes. This study focuses on the duobinary code which is the first member of this family and has been specified for the digital part of…
In certain complex optimization tasks, it becomes necessary to use multiple measures to characterize the performance of different algorithms. This paper presents a method that combines ordinal effect sizes with Pareto dominance to analyze…
This paper proposes a new evolutionary algorithm, called DSMGA-II, to efficiently solve optimization problems via exploiting problem substructures. The proposed algorithm adopts pairwise linkage detection and stores the information in the…
This paper presents an improved LLM based model for Grammatical Error Detection (GED), which is a very challenging and equally important problem for many applications. The traditional approach to GED involved hand-designed features, but…
Magnet errors in storage rings significantly degrade beam performance, impacting the brightness and stability of the light source. Therefore, beam-based correction is crucial for the safe operation of machines and the stability of radiated…
Efficient symbol detection algorithms carry critical importance for achieving the spatial multiplexing gains promised by multi-input multi-output (MIMO) systems. In this paper, we consider a maximum a posteriori probability (MAP) based…
Efficient decoding is crucial to high-throughput and power-sensitive wireless communication scenarios. A theoretical analysis of the performance-complexity tradeoff toward low-complexity decoding is required for a better understanding of…
Performance optimization of deep learning models is conducted either manually or through automatic architecture search, or a combination of both. On the other hand, their performance strongly depends on the target hardware and how…
In this paper we use a variation of simulated annealing algorithm for optimizing two-dimensional constellations with 32 signals. The main objective is to maximize the symmetric pragmatic capacity under the peak-power constraint. The method…
Let $\Sigma_d^{++}$ be the set of positive definite matrices with determinant 1 in dimension $d\ge 2$. Identifying any two $SL_d(\mathbb{Z})$-congruent elements in $\Sigma_d^{++}$ gives rise to the space of reduced quadratic forms of…
A general numerical method is presented to locate the partition function zeros in the complex beta plane for large lattice sizes. We apply this method to the 2D Ising model and results are reported for square lattice sizes up tp L=64. We…
The fundamental matrix can be estimated from point matches. The current gold standard is to bootstrap the eight-point algorithm and two-view projective bundle adjustment. The eight-point algorithm first computes a simple linear least…
Much energy has been devoted to developing a matroid's computational properties, yet parallel algorithm design for matroid optimization seems less understood. Specifically, the current state of the art is a folklore reduction from…