English
Related papers

Related papers: A Tight Bound on the Performance of a Minimal-Dela…

200 papers

We consider the problem of joint source and channel coding of structured data such as natural language over a noisy channel. The typical approach to this problem in both theory and practice involves performing source coding to first…

Information Theory · Computer Science 2018-02-21 Nariman Farsad , Milind Rao , Andrea Goldsmith

An encoder, subject to a rate constraint, wishes to describe a Gaussian source under squared error distortion. The decoder, besides receiving the encoder's description, also observes side information consisting of uncompressed source symbol…

Information Theory · Computer Science 2013-05-10 Chris T. K. Ng , Chao Tian , Andrea J. Goldsmith , Shlomo Shamai

A joint source-channel coding (JSCC) scheme based on hybrid digital/analog coding is proposed for the transmission of correlated sources over discrete-memoryless two-way channels (DM-TWCs). The scheme utilizes the correlation between the…

Information Theory · Computer Science 2020-08-13 Jian-Jia Weng , Fady Alajaji , Tamás Linder

The common approach of designing a communication device is to maximize a well-defined objective function, e.g., the channel capacity and the cut-off rate. We propose easy-to-implement solutions for Gaussian channels that approximate the…

Information Theory · Computer Science 2016-03-24 Qian Yu

Future wireless communications systems are expected to operate at bands above 100GHz. The high energy consumption of analog-to-digital converters, due to their high resolution represents a bottleneck for future wireless communications…

Information Theory · Computer Science 2025-02-25 D. Melo , L. Landau , R. de Lamare

The quantum capacity of a memoryless channel is often used as a single figure of merit to characterize its ability to transmit quantum information coherently. The capacity determines the maximal rate at which we can code reliably over…

Quantum Physics · Physics 2016-05-10 Marco Tomamichel , Mario Berta , Joseph M. Renes

Recently, Tian et al. [1] considered joint source-channel coding of transmitting a Gaussian source over $K$-user Gaussian broadcast channel, and derived an outer bound on the admissible distortion region. In [1], they stated "due to its…

Information Theory · Computer Science 2016-11-17 Lei Yu , Houqiang Li , Weiping Li

In this paper, we investigate the sum-capacity of the two-user Gaussian interference channel with Gaussian superposition coding and successive decoding. We first examine an approximate deterministic formulation of the problem, and introduce…

Information Theory · Computer Science 2011-03-30 Yue Zhao , Chee Wei Tan , A. Salman Avestimehr , Suhas N. Diggavi , Gregory J. Pottie

The capacity of a discrete-time multi-input multi-output (MIMO) Gaussian channel with output quantization is investigated for different receiver architectures. A general formulation of this problem is proposed in which the antenna outputs…

Information Theory · Computer Science 2017-07-10 Stefano Rini , Luca Barletta , Yonina C. Eldar , Elza Erkip

When transmitting information over a noisy channel, two approaches, dating back to Shannon's work, are common: assuming the channel errors are independent of the transmitted content and devising an error-correcting code, or assuming the…

Information Theory · Computer Science 2015-01-22 Ohad Elishco , Tom Meyerovitch , Moshe Schwartz

We consider a line network of nodes, connected by additive white Gaussian noise channels, equipped with local feedback. We study the velocity at which information spreads over this network. For transmission of a data packet, we give an…

Information Theory · Computer Science 2024-10-28 Elad Domanovitz , Anatoly Khina , Tal Philosof , Yuval Kochman

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 propose a joint source-channel-network coding scheme, based on compressive sensing principles, for wireless networks with AWGN channels (that may include multiple access and broadcast), with sources exhibiting temporal and spatial…

Information Theory · Computer Science 2011-10-04 Soheil Feizi , Muriel Medard

An alternative to extrinsic information transfer (EXIT) charts called mean squared error (MSE) charts that use a measure related to the MSE instead of mutual information is proposed. Using the relationship between mutual information and…

Information Theory · Computer Science 2007-07-13 Kapil Bhattad , Krishna Narayanan

We derive an achievability bound to quantify the performance of a type-based unsourced multiple access system -- an information-theoretic model for grant-free multiple access with correlated messages. The bound extends available…

Information Theory · Computer Science 2025-04-29 Deekshith Pathayappilly Krishnan , Kaan Okumus , Khac-Hoang Ngo , Giuseppe Durisi

In this paper, tight upper and lower bounds are derived on the weighted sum of minimum mean-squared errors for additive Gaussian noise channels. The bounds are obtained by constraining the input distribution to be close to a Gaussian…

Information Theory · Computer Science 2020-01-23 Michael Fauß , Abdelhak M. Zoubir , Alex Dytso , H. Vincent Poor , K. G. Nagananda

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

This paper considers the source coding problem with broadcast side information. The side information is sent to two receivers through a noisy broadcast channel. We provide an outer bound of the rate--distortion--bandwidth (RDB) quadruples…

Information Theory · Computer Science 2026-02-19 Yiqi Chen , Holger Boche , Marc Geitz

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 controlling an unstable plant over an additive white Gaussian noise (AWGN) channel with a transmit power constraint, where the signaling rate of communication is larger than the sampling rate (for generating…

Systems and Control · Computer Science 2016-10-31 Anatoly Khina , Gustav M. Pettersson , Victoria Kostina , Babak Hassibi
‹ Prev 1 4 5 6 7 8 10 Next ›