Search arXivSearch

arXiv · 2606.28842

Channel Capacity under the Subtractive Dithered Quantization Model

Abstract

We study the capacity of an additive white Gaussian noise (AWGN) channel followed by a subtractive dithered uniform quantizer. Under the Schuchman conditions and with negligible overload probability, the system admits an additive-noise representation in which the effective noise is the sum of Gaussian and uniform components. Capacity bounds are derived for this model where inputs are subject to an average-power constraint as well as a peak-amplitude constraint, where the latter accounts for the limited quantizer dynamic range. Specifically, a computable lower bound is obtained based on the entropy power inequality (EPI), using the maximum-entropy input under the above constraints. Tighter numerical lower bounds are derived using discrete input constellations with finite mass points. Finally, an upper bound is obtained by exploiting the maximum-entropy property of the Gaussian distribution for a given variance. Numerical results show that, for a K-level quantizer, discrete constellations with K mass points already achieve near-optimal rates among the tested families. Moreover, our upper bound is close to the lower bounds in the moderate signal-to-noise ratio (SNR) regime; thus it provides a simple capacity approximation in this regime.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hossein Atrsaei, Mireille Sarkiss, Michèle Wigger. 2026-08-17. Channel Capacity under the Subtractive Dithered Quantization Model. https://arxiv.org/abs/2606.28842

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT