English
Related papers

Related papers: Approximate Characterizations for the Gaussian Sou…

200 papers

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

We consider the problem of transmission of several distributed sources over a multiple access channel (MAC) with side information at the sources and the decoder. Source-channel separation does not hold for this channel. Sufficient…

Information Theory · Computer Science 2008-03-11 R. Rajesh , Vinod Sharma

We consider a problem where a memoryless bi-variate Gaussian source is to be transmitted over an additive white Gaussian multiple-access channel with two transmitting terminals and one receiving terminal. The first transmitter only sees the…

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

We study the transmission of a set of correlated sources $(U_1,\cdots,U_K)$ over a Gaussian multiple access relay channel with time asynchronism between the encoders. We assume that the maximum possible offset ${\mathsf{d_{max}}}(n)$…

Information Theory · Computer Science 2014-08-11 Hamidreza Ebrahimzadeh Saffar , Masoud Badiei Khuzani , Patrick Mitran

In this work we investigate the behavior of the minimal rate needed in order to guarantee a given probability that the distortion exceeds a prescribed threshold, at some fixed finite quantization block length. We show that the excess coding…

Information Theory · Computer Science 2011-02-15 Amir Ingber , Yuval Kochman

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 present and analyze a joint source-channel coding strategy for the transmission of a Gaussian source across a Gaussian channel in n channel uses per source symbol. Among all such strategies, our scheme has the following properties: i)…

Information Theory · Computer Science 2016-11-18 Marius Kleiner , Bixio Rimoldi

We study the power-versus-distortion trade-off for the transmission of a memoryless bivariate Gaussian source over a two-to-one Gaussian multiple-access channel with perfect causal feedback. In this problem, each of two separate…

Information Theory · Computer Science 2009-03-23 Amos Lapidoth , Stephan Tinguely

This paper studies the achievable rates of Gaussian interference channels with additive white Gaussian noise (AWGN), when improper or circularly asymmetric complex Gaussian signaling is applied. For the Gaussian multiple-input…

Information Theory · Computer Science 2016-11-18 Yong Zeng , Cenk M. Yetis , Erry Gunawan , Yong Liang Guan , Rui Zhang

In this work, the problem of transmitting an i.i.d Gaussian source over an i.i.d Gaussian wiretap channel with an i.i.d Gaussian side information is considered. The intended receiver is assumed to have a certain minimum SNR and the…

Information Theory · Computer Science 2010-08-03 Ghadamali Bagherikaram , Konstantinos N. Plataniotis

In this work, lossy distributed compression of pairs of correlated sources is considered. Conventionally, Shannon's random coding arguments -- using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically…

Information Theory · Computer Science 2020-10-21 Farhad Shirani , S. Sandeep Pradhan

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

We consider a joint source channel coding (JSCC) problem in which we desire to transmit an arbitrary memoryless source over an arbitrary additive channel. We propose a mismatched coding architecture that consists of Gaussian codebooks for…

Information Theory · Computer Science 2018-09-03 Lin Zhou , Vincent Y. F. Tan , Mehul Motani

This paper shows new general nonasymptotic achievability and converse bounds and performs their dispersion analysis for the lossy compression problem in which the compressor observes the source through a noisy channel. While this problem is…

Information Theory · Computer Science 2016-09-19 Victoria Kostina , Sergio Verdú

The distortion-rate function of output-constrained lossy source coding with limited common randomness is analyzed for the special case of squared error distortion measure. An explicit expression is obtained when both source and…

Information Theory · Computer Science 2024-03-25 Li Xie , Liangyan Li , Jun Chen , Zhongshan Zhang

We study the two-user broadcast channel with degraded message sets and derive second-order achievability rate regions. Specifically, the channel noises are not necessarily Gaussian and we use spherical codebooks for both users. The weak…

Information Theory · Computer Science 2024-10-24 Zhuangfei Wu , Lin Bai , Jinpeng Xu , Lin Zhou , Mehul Motani

This paper proves the separation between source-network coding and channel coding in networks of noisy, discrete, memoryless channels. We show that the set of achievable distortion matrices in delivering a family of dependent sources across…

Information Theory · Computer Science 2016-11-17 Shirin Jalali , Michelle Effros

Channel simulation involves generating a sample $Y$ from the conditional distribution $P_{Y|X}$, where $X$ is a remote realization sampled from $P_X$. This paper introduces a novel approach to approximate Gaussian channel simulation using…

Information Theory · Computer Science 2024-07-19 Szymon Kobus , Lucas Theis , Deniz Gündüz

Outer bounds on the admissible source region for broadcast channels with dependent sources are developed and used to prove capacity results for several classes of sources and channels.

Information Theory · Computer Science 2009-02-16 Gerhard Kramer , Yingbin Liang , Shlomo Shamai

Analog (uncoded) transmission provides a simple and robust scheme for communicating a Gaussian source over a Gaussian channel under the mean squared error (MSE) distortion measure. Unfortunately, its performance is usually inferior to the…

Information Theory · Computer Science 2010-06-03 Yuval Kochman , Ram Zamir