English
Related papers

Related papers: Optimizing Bit-Labeling of Voronoi Constellations

200 papers

Multidimensional Voronoi constellations (VCs) are shown to be more power-efficient than quadrature amplitude modulation (QAM) formats given the same uncoded bit error rate, and also have higher achievable information rates. However, a coded…

Information Theory · Computer Science 2023-08-02 S. Li , A. Mirani , M. Karlsson , E. Agrell

We consider the problem of noisy 1-bit matrix completion under an exact rank constraint on the true underlying matrix $M^*$. Instead of observing a subset of the noisy continuous-valued entries of a matrix $M^*$, we observe a subset of…

Machine Learning · Statistics 2015-02-25 Sonia Bhaskar , Adel Javanmard

The maximum likelihood detection rule for a four-dimensional direct-detection optical front-end is derived. The four dimensions are two intensities and two differential phases. Three different signal processing algorithms, composed of…

Information Theory · Computer Science 2021-05-31 Amir Tasbihi , Frank R. Kschischang

Lattice rules are among the most prominently studied quasi-Monte Carlo methods to approximate multivariate integrals. A rank-1 lattice rule to approximate an $s$-dimensional integral is fully specified by its generating vector $\mathbf{z}…

Numerical Analysis · Mathematics 2020-01-10 Adrian Ebert , Peter Kritzer , Dirk Nuyens , Onyekachi Osisiogu

In this paper will be presented methodology of encoding information in valuations of discrete lattice with some translational invariant constrains in asymptotically optimal way. The method is based on finding statistical description of such…

Information Theory · Computer Science 2008-11-02 Jarek Duda

Soft forward error correction with higher-order modulations is often implemented in practice via the pragmatic bit-interleaved coded modulation paradigm, where a single binary code is mapped to a nonbinary modulation. In this paper, we…

Information Theory · Computer Science 2014-06-13 Christian Häger , Alexandre Graell i Amat , Fredrik Brännström , Alex Alvarado , Erik Agrell

An end-to-end learning method for constellation shaping with a shaping-encoder assisted transceiver architecture is presented. The shaping encoder, which produces shaping bits with a higher probability of zeros, is used to produce an…

Information Theory · Computer Science 2025-10-28 Harindu Jayarathne , Dileepa Marasinghe , Nandana Rajatheva , Matti Latva-aho

Mixed-precision quantization, where a deep neural network's layers are quantized to different precisions, offers the opportunity to optimize the trade-offs between model size, latency, and statistical accuracy beyond what can be achieved…

Machine Learning · Computer Science 2023-07-07 Georg Rutishauser , Francesco Conti , Luca Benini

Many different metrics exist for evaluating parsing results, including Viterbi, Crossing Brackets Rate, Zero Crossing Brackets Rate, and several others. However, most parsing algorithms, including the Viterbi algorithm, attempt to optimize…

cmp-lg · Computer Science 2008-02-03 Joshua Goodman

Coded modulation (CM) is the combination of forward error correction (FEC) and multilevel constellations. Coherent optical communication systems result in a four-dimensional (4D) signal space, which naturally leads to 4D-CM transceivers. A…

Information Theory · Computer Science 2024-01-25 Alex Alvarado , Erik Agrell

We optimize modulation formats for the additive white Gaussian noise channel with a nonnegative input constraint, also known as the intensity-modulated direct detection channel, with and without confining them to a lattice structure. Our…

Information Theory · Computer Science 2015-03-19 Johnny Karout , Erik Agrell , Krzysztof Szczerba , Magnus Karlsson

Existing error correction mechanisms in lattice-based public key encryption (PKE) rely on either naive modulation or its concatenation with error correction codes (ECC). This paper shows that lattice coding, as a joint ECC and modulation…

Information Theory · Computer Science 2023-05-23 Shanxiang Lyu , Ling Liu , Cong Ling , Junzuo Lai , Hao Chen

Multiple-input multiple-output (MIMO) systems have been widely acclaimed in order to provide high data rates. Recently Lattice Reduction (LR) aided detectors have been proposed to achieve near Maximum Likelihood (ML) performance with low…

Information Theory · Computer Science 2016-02-22 Mehnaz Rahman , Gwan S. Choi

Self-synchronization under the presence of additive noise can be achieved by allocating a certain number of bits of each codeword as markers for synchronization. Difference systems of sets are combinatorial designs which specify the…

Information Theory · Computer Science 2013-03-19 Yuichiro Fujiwara , Vladimir D. Tonchev

Designs and methods for nested lattice codes using Construction D' lattices for coding and convolutional code lattices for shaping are described. Two encoding methods and a decoding algorithm for Construction D' coding lattices that can be…

Information Theory · Computer Science 2022-01-03 Fan Zhou , Brian M. Kurkoski

We approximate $d$-variate periodic functions in weighted Korobov spaces with general weight parameters using $n$ function values at lattice points. We do not limit $n$ to be a prime number, as in currently available literature, but allow…

Numerical Analysis · Mathematics 2022-09-05 Frances Y. Kuo , Weiwen Mo , Dirk Nuyens

Next-generation intensity-modulation (IM) and direct-detection (DD) systems used in data centers are expected to operate at 400 Gb/s/lane and beyond. Such rates can be achieved by increasing the system bandwidth or the modulation format,…

Signal Processing · Electrical Eng. & Systems 2025-06-25 Felipe Villenas , Kaiquan Wu , Yunus Can Gültekin , Jamal Riani , Alex Alvarado

Dual mode orthogonal frequency division multiplexing with index modulation (DM-OFDM-IM) is recently proposed, which modulates all subcarriers to eliminate the limits of spectrum efficiency in OFDM with index modulation (OFDM-IM). In…

Information Theory · Computer Science 2019-02-05 Kee-Hoon Kim

We consider the problem of distributed computation of the nearest lattice point for a two dimensional lattice. An interactive model of communication is considered. We address the problem of reconfiguring a specific rectangular partition, a…

Information Theory · Computer Science 2017-01-31 V. A. Vaishampayan , M. F. Bollauf

We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of Schnorr's "Factoring integers and computing discrete logarithms via diophantine…

Data Structures and Algorithms · Computer Science 2010-03-30 Antonio Ignacio Vera