English
Related papers

Related papers: Joint source-channel coding with feedback

200 papers

We study the following semi-deterministic setting of the joint source-channel coding problem: a deterministic source sequence (a.k.a. individual sequence) is transmitted via a memoryless channel, using delay-limited encoder and decoder,…

Information Theory · Computer Science 2021-09-29 Neri Merhav

A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback. For all noise correlations other than -1, the gap between the sum-rate the scheme achieves and the full-cooperation bound…

Information Theory · Computer Science 2015-03-13 Michael Gastpar , Amos Lapidoth , Yossef Steinberg , Michele Wigger

Transmission of a Gaussian source over a time-varying Gaussian channel is studied in the presence of time-varying correlated side information at the receiver. A block fading model is considered for both the channel and the side information,…

Information Theory · Computer Science 2015-05-27 Iñaki Estella Aguerri , Deniz Gündüz

We study the problem of secure joint source-channel coding for multimodal semantic sources transmitted over noisy wiretap channels. The source model consists of $m$ modalities (e.g., image, audio, and sensor data), all represented as random…

Information Theory · Computer Science 2026-05-26 Denis Kozlov , Mahtab Mirmohseni , Rahim Tafazolli

We study the problem of generating an approximately i.i.d. string at the output of a discrete memoryless channel using a limited amount of randomness at its input in presence of causal noiseless feedback. Feedback does not decrease the…

Information Theory · Computer Science 2016-09-29 Mani Bastani Parizi , Emre Telatar

We characterize the fundamental limits of transmission of information over a Gaussian multiple access channel (MAC) with the use of variable-length feedback codes and under a non-vanishing error probability formalism. We develop new…

Information Theory · Computer Science 2018-01-10 Lan V. Truong , Vincent Y. F. Tan

We investigate the maximum coding rate for a given average blocklength and error probability over a K-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback…

Information Theory · Computer Science 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

A distortion-noise profile is a function indicating the maximum allowed source distortion value for each noise level in the channel. In this paper, the minimum energy required to achieve a distortion noise profile is studied for Gaussian…

Information Theory · Computer Science 2019-11-28 Mohammadamin Baniasadi , Ertem Tuncel

We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code…

Information Theory · Computer Science 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

This paper investigates the joint source-channel coding problem of sending a memoryless source over a memoryless broadcast channel. An inner bound and several outer bounds on the admissible distortion region are derived, which respectively…

Information Theory · Computer Science 2018-06-11 Lei Yu , Houqiang Li , Weiping Li

We consider transmission of a continuous amplitude source over an L-block Rayleigh fading $M_t \times M_r$ MIMO channel when the channel state information is only available at the receiver. Since the channel is not ergodic, Shannon's…

Information Theory · Computer Science 2007-11-09 Deniz Gunduz , Elza Erkip

A transmitter without channel state information (CSI) wishes to send a delay-limited Gaussian source over a slowly fading channel. The source is coded in superimposed layers, with each layer successively refining the description in the…

Information Theory · Computer Science 2009-10-22 Chris T. K. Ng , Deniz Gunduz , Andrea Goldsmith , Elza Erkip

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ú

We present an upper bound on the error probability achievable using variable-length stop feedback codes, for a fixed size of the information payload and a given constraint on the maximum latency and the average service time. Differently…

Information Theory · Computer Science 2020-02-20 Johan Östman , Rahul Devassy , Giuseppe Durisi , Erik G. Ström

In this work we investigate the behavior of the distortion threshold that can be guaranteed in joint source-channel coding, to within a prescribed excess-distortion probability. We show that the gap between this threshold and the optimal…

Information Theory · Computer Science 2011-12-08 Da Wang , Amir Ingber , Yuval Kochman

We derive upper and lower bounds on the reliability function for the common-message discrete memoryless broadcast channel with variable-length feedback. We show that the bounds are tight when the broadcast channel is stochastically…

Information Theory · Computer Science 2017-01-13 Lan V. Truong , Vincent Y. F. Tan

We study analogue source transmission over MIMO block-fading channels with receiver-only channel state information. Unlike previous work which considers the end-to-end expected distortion as a figure of merit, we study the distortion outage…

Information Theory · Computer Science 2016-11-15 Li Peng , Albert Guillen i Fabregas

The reliability function of memoryless channels with noiseless feedback and variable-length coding has been found to be a linear function of the average rate in the classic work of Burnashev. In this work we consider unifilar channels with…

Information Theory · Computer Science 2017-07-13 Achilleas Anastasopoulos , Jui Wu

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

This paper studies the fundamental limits of the minimum average length of lossless and lossy variable-length compression, allowing a nonzero error probability $\epsilon$, for lossless compression. We give non-asymptotic bounds on the…

Information Theory · Computer Science 2015-10-09 Victoria Kostina , Yury Polyanskiy , Sergio Verdú