Feedback in the Non-Asymptotic Regime

被引:184
作者
Polyanskiy, Yury [1 ]
Poor, H. Vincent [1 ]
Verdu, Sergio [1 ]
机构
[1] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
Achievability bounds; channel capacity; converse bounds; feedback; memoryless channels; non-asymptotic analysis; Shannon theory; stop-feedback; CHANNEL; LENGTH;
D O I
10.1109/TIT.2011.2158476
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:4903 / 4925
页数:23
相关论文
共 25 条
[1]  
[Anonymous], 1981, Information Theory: Coding Theorems for Discrete Memoryless Systems
[2]   A Simple Converse of Burnashev's Reliability Function [J].
Berlin, Peter ;
Nakiboglu, Baris ;
Rimoldi, Bixio ;
Telatar, Emre .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3074-3080
[3]   SEQUENTIAL DISCRIMINATION OF HYPOTHESES WITH CONTROL OF OBSERVATIONS [J].
BURNASEV, MV .
MATHEMATICS OF THE USSR-IZVESTIYA, 1980, 15 (03) :419-440
[4]  
Dobrushin R.L., 1962, THEOR PROBABILITY AP, V7, P283
[5]  
Draper SC, 2004, 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, P377
[6]   Rateless Coding for Arbitrary Channel Mixtures With Decoder Channel State Information [J].
Draper, Stark C. ;
Kschischang, Frank R. ;
Frey, Brendan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (09) :4119-4133
[7]  
Gallager R. G., 1968, Information Theory and Reliable Communication, V2
[8]   Lautum information [J].
Palomar, Daniel P. ;
Verdu, Sergio .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (03) :964-975
[9]  
Polyanskiy Y., 2010, Channel coding: Non-asymptotic fundamental limits
[10]   Dispersion of the Gilbert-Elliott Channel [J].
Polyanskiy, Yury ;
Poor, H. Vincent ;
Verdu, Sergio .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) :1829-1848