中文
相关论文

相关论文: Zero-rate feedback can achieve the empirical capac…

200 篇论文

We consider data transmission across discrete memoryless channels (DMCs) using variable-length codes with feedback. We consider the family of such codes whose rates are $\rho_N$ below the channel capacity $C$, where $\rho_N$ is a positive…

信息论 · 计算机科学 2018-05-17 Lan V. Truong , Vincent Y. F. Tan

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…

信息论 · 计算机科学 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

The traditional information theoretic approach to studying feedback is to consider ideal instantaneous high-rate feedback of the channel outputs to the encoder. This was acceptable in classical work because the results were negative:…

信息论 · 计算机科学 2007-12-07 Anant Sahai

In this paper, we propose capacity-achieving communication schemes for Gaussian finite-state Markov channels (FSMCs) subject to an average channel input power constraint, under the assumption that the transmitters can have access to delayed…

信息论 · 计算机科学 2016-11-18 Jialing Liu , Nicola Elia , Sekhar Tatikonda

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…

信息论 · 计算机科学 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless…

信息论 · 计算机科学 2023-06-13 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

We firstly extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable…

信息论 · 计算机科学 2015-12-01 Chong Li , Nicola Elia

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…

信息论 · 计算机科学 2017-01-13 Lan V. Truong , Vincent Y. F. Tan

The theory of multiple-input multiple-output (MIMO) technology has been well-developed to increase fading channel capacity over single-input single-output (SISO) systems. This capacity gain can often be leveraged by utilizing channel state…

信息论 · 计算机科学 2008-02-25 Il Han Kim , David J. Love

The per-sample zero-dispersion channel model of the optical fiber is considered. It is shown that capacity is uniquely achieved by an input probability distribution that has continuous uniform phase and discrete amplitude that takes on…

信息论 · 计算机科学 2018-09-25 Jihad Fahs , Aslan Tchamkerten , Mansoor I. Yousefi

We characterize the capacity region of noiseless X-Channels with intermittent connectivity and delayed channel state information at the transmitters. We consider the general case in which each transmitter has a common message for both…

信息论 · 计算机科学 2025-02-05 Alireza Vahid

Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finite-state semi-Markov channels. We show that communication with…

信息论 · 计算机科学 2015-03-24 Lav R. Varshney , Sanjoy K. Mitter , Vivek K Goyal

For the model of communication through a discrete memoryless channel using i.i.d. random block codes, where the channel is changing slowly from block to block, we propose a stochastic algorithm for adaptation of the generating distribution…

信息论 · 计算机科学 2018-01-23 Sergey Tridenski , Ram Zamir

The main objective of this paper is to analyze a closed-loop feedback system where a transmitter probes a discrete memoryless channel (DMC) and can adapt its inputs based on the previous channel outputs. We prove that, regardless of the…

信息论 · 计算机科学 2025-07-23 Thomas Sturma , Michèle Wigger

This paper considers delay-limited communication over quasi-static fading channels under a long-term power constraint. A sequence of length-$n$ delay-limited codes for a quasi-static fading channel is said to be capacity-achieving if the…

信息论 · 计算机科学 2016-11-15 Silas L. Fong , Vincent Y. F. Tan

Most communication channels are subjected to noise. One of the goals of Information Theory is to add redundancy in the transmission of information so that the information is transmitted reliably and the amount of information transmitted…

信息论 · 计算机科学 2018-03-21 David Elkouss , David Pérez-García

This paper studies the performance of a feedback control loop closed via an error-free digital communication channel with transmission delay. The system comprises a discrete-time noisy linear time-invariant (LTI) plant whose single…

系统与控制 · 计算机科学 2018-09-05 M. Barforooshan , M. S. Derpich , P. A. Stavrou , J. Østergaard

Channel coding for discrete memoryless channels (DMCs) with mean and variance cost constraints has been recently introduced. We show that there is an improvement in coding performance due to cost variability, both with and without feedback.…

信息论 · 计算机科学 2025-07-10 Adeel Mahmood , Aaron B. Wagner

We propose a method to increase the capacity achieved by uniform prior in discrete memoryless channels (DMC) with high input cardinality. It consists in appropriately reducing the input set. Different design criteria of the input subset are…

信息论 · 计算机科学 2010-10-28 Amine Mezghani , Michel T. Ivrlac , Josef A. Nossek

In this work we find the capacity of a compound finite-state channel with time-invariant deterministic feedback. The model we consider involves the use of fixed length block codes. Our achievability result includes a proof of the existence…

信息论 · 计算机科学 2016-11-15 Brooke Shrader , Haim Permuter