Related papers: Optimizing Bit-Labeling of Voronoi Constellations
In this paper, we propose a new class of bit flipping algorithms for low-density parity-check (LDPC) codes over the binary symmetric channel (BSC). Compared to the regular (parallel or serial) bit flipping algorithms, the proposed…
Recently published methods enable training of bitwise neural networks which allow reduced representation of down to a single bit per weight. We present a method that exploits ensemble decisions based on multiple stochastically sampled…
Multidimensional lattice constellations which present signal space diversity (SSD) have been extensively studied for single-antenna transmission over fading channels, with focus on their optimal design for achieving high diversity gain. In…
Iterative Direct Preference Optimization (DPO) has emerged as a widely used paradigm for aligning Large Language Models on reasoning tasks. Existing approaches typically rely on Best-of-N sampling ($N\geq8$) to mine positive trajectories…
Lattices have been conceived as a powerful tool for data hiding. While conventional studies and applications focus on achieving the optimal robustness versus distortion tradeoff, in some applications such as data hiding in…
Lattice vibration frequencies are related to many important materials properties such as thermal and electrical conductivity as well as superconductivity. However, computational calculation of vibration frequencies using density functional…
Recent studies on learning with noisy labels have shown remarkable performance by exploiting a small clean dataset. In particular, model agnostic meta-learning-based label correction methods further improve performance by correcting noisy…
In this paper, we analyze the convergence properties of the Lion optimizer. First, we establish that the Lion optimizer attains a convergence rate of $\mathcal{O}(d^{1/2}T^{-1/4})$ under standard assumptions, where $d$ denotes the problem…
Lattice sieving in two or more dimensions has proven to be an indispensable practical aid in integer factorization and discrete log computations involving the number field sieve. The main contribution of this article is to show that a…
In this paper we consider maximum-likelihood (ML) MIMO detection under one-bit quantized observations and binary symbol constellations. This problem is motivated by the recent interest in adopting coarse quantization in massive MIMO…
An efficient, low-complexity, soft-output detector for general lattices is presented, based on their Tanner graph (TG) representations. Closest-point searches in lattices can be performed as non-binary belief propagation on associated TGs;…
Probabilistic constellation shaping enables easy rate adaption and has been proven to reduce the gap to Shannon capacity. Constellation point probabilities are optimized to maximize either the mutual information or the bit-wise mutual…
Nanoscale strain mapping by four-dimensional scanning transmission electron microscopy (4D-STEM) relies on determining the precise locations of Bragg-scattered electrons in a sequence of diffraction patterns, a task which is complicated by…
We introduce a simplified method for calculating the loss function for use in geometric shaping, allowing for the optimisation of high dimensional constellations. We design constellations up to 12D with 4096 points, with gains up to 0.31 dB…
Signals with sparse frame representations comprise a much more realistic model of nature than that with orthonomal bases. Studies about the signal recovery associated with such sparsity models have been one of major focuses in compressed…
Lately, post-training quantization methods have gained considerable attention, as they are simple to use, and require only a small unlabeled calibration set. This small dataset cannot be used to fine-tune the model without significant…
We consider 4-block $n$-fold integer programs, whose constraint matrix consists of $n$ copies of small matrices $A$, $B$, and $D$, and one copy of $C$, in a specific block structure. All existing algorithms along this line of research…
Development in lattice strain mapping using four-dimensional scanning transmission electron microscopy (4D-STEM) method now offers improved precision and feasibility. However, automatic and accurate diffraction analysis is still challenging…
We improve the error terms of some estimates related to counting lattices from recent work of L. Fukshansky, P. Guerzhoy and F. Luca (2017). This improvement is based on some analytic techniques, in particular on bounds of exponential sums…
Inter-symbol interference (ISI) channels with data dependent Gauss Markov noise have been used to model read channels in magnetic recording and other data storage systems. The Viterbi algorithm can be adapted for performing maximum…