Feedback in the Non-Asymptotic Regime

Without feedback, the backoff from capacity due to non-asymptotic blocklength can be quite substantial for blocklengths and error probabilities of interest in many practical applications. In this paper, novel achievability bounds are used to demonstrate that in the non-asymptotic regime, the maximal achievable rate improves dramatically thanks to variable-length coding and feedback. For example, for the binary symmetric channel with capacity 1/2 the blocklength required to achieve 90% of the capacity is smaller than 200, compared to at least 3100 for the best fixed-blocklength code (even with noiseless feedback). Virtually all the advantages of noiseless feedback are shown to be achievable, even if the feedback link is used only to send a single signal informing the encoder to terminate the transmission (stop-feedback). It is demonstrated that the non-asymptotic behavior of the fundamental limit depends crucially on the particular model chosen for the “end-of-packet” control signal. Fixed-blocklength codes and related questions concerning communicating with a guaranteed delay are discussed, in which situation feedback is demonstrated to be almost useless even non-asymptotically.

[1]  H. Vincent Poor,et al.  Dispersion of the Gilbert-Elliott Channel , 2011, IEEE Trans. Inf. Theory.

[2]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[3]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[4]  Emre Telatar,et al.  Variable length coding over an unknown channel , 2006, IEEE Transactions on Information Theory.

[5]  Emre Telatar,et al.  A Simple Converse of Burnashev's Reliability Function , 2006, IEEE Transactions on Information Theory.

[6]  H. Vincent Poor,et al.  Channel coding: non-asymptotic fundamental limits , 2010 .

[7]  M. V. Burnašev SEQUENTIAL DISCRIMINATION OF HYPOTHESES WITH CONTROL OF OBSERVATIONS , 1980 .

[8]  R. L. Dobrushin,et al.  Asymptotic Estimates of the Probability of Error for Transmission of Messages over a Discrete Memoryless Communication Channel with a Symmetric Transition Probability Matrix , 1962 .

[9]  Nadav Shulman,et al.  Communication over an unknown channel via common broadcasting , 2003 .

[10]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[11]  Anant Sahai Why Do Block Length and Delay Behave Differently if Feedback Is Present? , 2008, IEEE Transactions on Information Theory.

[12]  Emre Telatar,et al.  A feedback strategy for binary symmetric channels , 2002, Proceedings IEEE International Symposium on Information Theory,.

[13]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[14]  Emre Telatar,et al.  Optimal feedback schemes over unknown channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[15]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[16]  Kohji Itoh,et al.  Asymptotic performance of a modified Schalkwijk-Barron scheme for channels with noiseless feedback (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[17]  J. Pieter M. Schalkwijk,et al.  Sequential signalling under a peak power constraint , 1971, IEEE Trans. Inf. Theory.

[18]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

[19]  Daniel Pérez Palomar,et al.  Lautum Information , 2008, IEEE Transactions on Information Theory.

[20]  Brendan J. Frey,et al.  Efficient variable length channel coding for unknown DMCs , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[21]  Shlomo Shamai,et al.  Variable-Rate Channel Capacity , 2010, IEEE Transactions on Information Theory.

[22]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[23]  Brendan J. Frey,et al.  Rateless Coding for Arbitrary Channel Mixtures With Decoder Channel State Information , 2009, IEEE Transactions on Information Theory.