English
Related papers

Related papers: GRAND-assisted Optimal Modulation

200 papers

Channel estimation in quantized systems is challenging, particularly in low-resolution systems. In this work, we propose to leverage a Gaussian mixture model (GMM) as generative prior, capturing the channel distribution of the propagation…

Signal Processing · Electrical Eng. & Systems 2024-05-07 Benedikt Fesl , Aziz Banna , Wolfgang Utschick

Two decoder structures for coded modulation over the Gaussian and flat fading channels are studied: the maximum likelihood symbol-wise decoder, and the (suboptimal) bit-wise decoder based on the bit-interleaved coded modulation paradigm. We…

Information Theory · Computer Science 2014-04-23 Mikhail Ivanov , Alex Alvarado , Fredrik Brannstrom , Erik Agrell

In this paper, we focus on the demodulation/decoding of the complex modulations/codes that approach the Shannon capacity. Theoretically, the maximum likelihood (ML) algorithm can achieve the optimal error performance whereas it has…

Information Theory · Computer Science 2022-06-14 Boxiang He , Zitao Wu , Fanggang Wang

The optimal bit-wise demodulator for M-ary pulse amplitude modulation (PAM) over the additive white Gaussian noise channel is analyzed in terms of uncoded bit-error rate (BER). New closed-form BER expressions for 4-PAM with any labeling are…

Information Theory · Computer Science 2015-01-07 Mikhail Ivanov , Fredrik Brannstrom , Alex Alvarado , Erik Agrell

In the absence of prior knowledge, ordinal embedding methods obtain new representation for items in a low-dimensional Euclidean space via a set of quadruple-wise comparisons. These ordinal comparisons often come from human annotators, and…

Machine Learning · Computer Science 2018-12-06 Ke Ma , Qianqian Xu , Zhiyong Yang , Xiaochun Cao

In this paper, we distinguish two guessing algorithms for decoding binary linear codes. One is the guessing noise decoding (GND) algorithm, and the other is the guessing codeword decoding (GCD) algorithm. We prove that the GCD is a maximum…

Information Theory · Computer Science 2024-01-31 Xiao Ma

We study the information rates of unipolar orthogonal frequency division multiplexing (OFDM) in discrete-time optical intensity channels (OIC) with Gaussian noise under average optical power constraint. Several single-, double-, and…

Information Theory · Computer Science 2018-01-08 Jing Zhou , Wenyi Zhang

This paper discusses noisy index coding problem over Gaussian broadcast channel. We propose a technique for mapping the index coded bits to M-QAM symbols such that the receivers whose side information satisfies certain conditions get coding…

Information Theory · Computer Science 2015-10-30 Anjana Ambika Mahesh , B. Sundar Rajan

Within the Guessing Random Additive Noise Decoding (GRAND) family, ordered reliability bits GRAND (ORBGRAND) has received considerable attention for its hardware-friendly exploitation of soft information. Existing information-theoretic…

Information Theory · Computer Science 2026-03-12 Zhuang Li , Wenyi Zhang

Constellation shaping is a well-established method to improve upon a regular quadrature amplitude modulation (QAM). It is known that the gain achieved by any shaping method for an additive white Gaussian noise (AWGN) channel is…

Information Theory · Computer Science 2025-04-28 Kirill Ivanov , Wei Yang , Jing Jiang

Proposals have been made to reduce the guesswork of Guessing Random Additive Noise Decoding (GRAND) for binary linear codes by leveraging codebook structure at the expense of degraded block error rate (BLER). We establish one can preserve…

Information Theory · Computer Science 2025-12-18 Lukas Rapp , Muriel Médard , Ken R. Duffy

In this paper, we propose a practical adaptive coding modulation scheme to approach the capacity of free-space optical (FSO) channels with intensity modulation/direct detection based on probabilistic shaping. The encoder efficiently adapts…

Information Theory · Computer Science 2020-12-01 Ahmed Elzanaty , Mohamed-Slim Alouini

We revisit the source image estimation problem from blind source separation (BSS). We generalize the traditional minimum distortion principle to maximum likelihood estimation with a model for the residual spectrograms. Because residual…

Audio and Speech Processing · Electrical Eng. & Systems 2020-09-14 Robin Scheibler

The problem of designing bit-to-pattern mappings and power allocation schemes for orthogonal frequency-division multiplexing (OFDM) systems that employ subcarrier index modulation (IM) is considered. We assume the binary source conveys a…

Information Theory · Computer Science 2020-01-08 Justin P. Coon , Mihai-Alin Badiu , Ye Liu , Ferhat Yarkin , Shuping Dang

Input binarization has shown to be an effective way for network acceleration. However, previous binarization scheme could be regarded as simple pixel-wise thresholding operations (i.e., order-one approximation) and suffers a big accuracy…

Computer Vision and Pattern Recognition · Computer Science 2017-08-30 Zefan Li , Bingbing Ni , Wenjun Zhang , Xiaokang Yang , Wen Gao

The problem of transmitting a parameter value over an additive white Gaussian noise (AWGN) channel is considered, where, in addition to the transmitter and the receiver, there is a helper that observes the noise non-causally and provides a…

Information Theory · Computer Science 2024-10-28 Anatoly Khina , Neri Merhav

In this paper non-group permutation modulated sequences for the Gaussian channel are considered. Without the restriction to group codes rather than subsets of group codes, arbitrary rates are achievable. The code construction utilizes the…

Information Theory · Computer Science 2007-07-13 Oliver Henkel

Non-Orthogonal Multiple Access (NOMA) technology has emerged as a promising technology to enable massive connectivity and enhanced spectral efficiency in next-generation wireless networks. In this study, we propose a novel two-user downlink…

Information Theory · Computer Science 2025-12-19 Emirhan Zor , Bora Bozkurt , Ferkan Yilmaz

Guessing random additive noise decoding (GRAND) is a code-agnostic decoding method that iteratively guesses the noise pattern affecting the received codeword. The number of noise sequences to test depends on the noise realization. Thus,…

Signal Processing · Electrical Eng. & Systems 2025-02-10 Filippo Christen , Darja Nonaca , Christoph Studer

We propose a novel receiver for orthogonal frequency division multiplexing (OFDM) transmissions in impulsive noise environments. Impulsive noise arises in many modern wireless and wireline communication systems, such as Wi-Fi and powerline…

Information Theory · Computer Science 2015-06-16 Marcel Nassar , Philip Schniter , Brian L. Evans