English
Related papers

Related papers: Robust Gaussian Joint Source-Channel Coding Under …

200 papers

In this paper, we investigate the problem of transmitting an analog source to a destination over $N$ uses of an additive-white-Gaussian-noise (AWGN) channel, where $N$ is very small (in the order of 10 or even less). The proposed coding…

Information Theory · Computer Science 2024-02-01 Mohammad Ali Maddah-Ali , Soheil Mohajer

Motivated by the design of low-complexity low-power coding solutions for the Gaussian relay channel, this work presents an upper bound on the minimum energy-per-bit achievable on the Gaussian relay channel using rank-1 linear relaying. Our…

Information Theory · Computer Science 2024-01-30 Oliver Kosut , Michelle Effros , Michael Langberg

Consider a lossy compression system with $\ell$ distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under…

Information Theory · Computer Science 2018-07-19 Yizhong Wang , Li Xie , Xuan Zhang , Jun Chen

The amount of information lost in sub-Nyquist sampling of a continuous-time Gaussian stationary process is quantified. We consider a combined source coding and sub-Nyquist reconstruction problem in which the input to the encoder is a noisy…

Information Theory · Computer Science 2016-01-26 Alon Kipnis , Andrea J. Goldsmith , Yonina C. Eldar , Tsachy Weissman

We consider the problem of transmitting a bivariate Gaussian source over a two-user additive Gaussian multiple-access channel with feedback. Each of the transmitters observes one of the source components and tries to describe it to the…

Information Theory · Computer Science 2007-07-16 Amos Lapidoth , Stephan Tinguely

This paper studies the classification of high-dimensional Gaussian signals from low-dimensional noisy, linear measurements. In particular, it provides upper bounds (sufficient conditions) on the number of measurements required to drive the…

Information Theory · Computer Science 2016-11-03 Hugo Reboredo , Francesco Renna , Robert Calderbank , Miguel R. D. Rodrigues

In this paper, we revisit the design of Raptor codes for binary input additive white Gaussian noise (BIAWGN) channels, where we are interested in very low signal to noise ratios (SNRs). A linear programming degree distribution optimization…

Information Theory · Computer Science 2018-07-13 Mahyar Shirvanimoghaddam , Sarah J. Johnson

A crucial insight for practical quantum error correction is that different types of errors, such as single-qubit Pauli operators, typically occur with different probabilities. Finding an optimal quantum code under such biased noise is a…

Quantum Physics · Physics 2026-01-05 Junyu Fan , Matthew Steinberg , Alexander Jahn , Chunjun Cao , Sebastian Feld

We present a new technique to obtain outer-bounds on the capacity region of networks with ultra low-rate feedback. We establish a connection between the achievable rates in the forward channel and the minimum distortion that can be attained…

Information Theory · Computer Science 2021-05-11 Alireza Vahid

In many wireless communication systems, radios are subject to a duty cycle constraint, that is, a radio only actively transmits signals over a fraction of the time. For example, it is desirable to have a small duty cycle in some low power…

Information Theory · Computer Science 2012-09-24 Lei Zhang , Hui Li , Dongning Guo

The source-coding problem with side information at the decoder is studied subject to a constraint that the encoder---to whom the side information is unavailable---be able to compute the decoder's reconstruction sequence to within some…

Information Theory · Computer Science 2016-11-15 Amos Lapidoth , Andreas Malär , Michèle Wigger

I introduce rate-distortion theory for quantum coding, and derive a lower bound, involving the coherent information, on the rate at which qubits must be used to encode a quantum source with a given maximum level of distortion per source…

Quantum Physics · Physics 2007-05-23 Howard Barnum

This paper provides lower bounds on the reconstruction error for transmission of two continuous correlated random vectors sent over both sum and parallel channels using the help of two causal feedback links from the decoder to the encoders…

Information Theory · Computer Science 2013-08-16 Ayşe Ünsal , Raymond Knopp

New upper bounds on the sum capacity of the two-user Gaussian interference channel are derived. Using these bounds, it is shown that treating interference as noise achieves the sum capacity if the interference levels are below certain…

Information Theory · Computer Science 2008-01-04 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

Recent outer bounds on the capacity region of Gaussian interference channels are generalized to $m$-user channels with $m>2$ and asymmetric powers and crosstalk coefficients. The bounds are again shown to give the sum-rate capacity for…

Information Theory · Computer Science 2008-01-16 Xiaohu Shang , Gerhard Kramer , Biao Chen

We examine codes, over the additive Gaussian noise channel, designed for reliable communication at some specific signal-to-noise ratio (SNR) and constrained by the permitted minimum mean-square error (MMSE) at lower SNRs. The maximum…

Information Theory · Computer Science 2012-08-10 Ronit Bustin , Shlomo Shamai

In 2017, Polyanskiy [1] showed that the trade-off between power and bandwidth efficiency for massive Gaussian random access is governed by two fundamentally different regimes: low power and high power. For both regimes, tight performance…

Information Theory · Computer Science 2021-05-12 Ralf Müller

This paper concerns the transmission of two independent Gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous CSIs. The availability of the channel state…

Signal Processing · Electrical Eng. & Systems 2017-12-21 Mohammadreza Darabi

The capacity of peak-power limited, single-antenna, non-coherent, flat-fading channels with memory is considered. The emphasis is on the capacity pre-log, i.e., on the limiting ratio of channel capacity to the logarithm of the…

Information Theory · Computer Science 2008-04-14 Tobias Koch , Amos Lapidoth

This paper adds to the understanding of the capacity region of the Gaussian interference channel. To this end, the capacity region of the one-sided Gaussian interference channel is first fully characterized. This is accomplished by…

Information Theory · Computer Science 2015-09-22 Mojtaba Vaezi , H. Vincent Poor