DocumentCode :
1140341
Title :
Why Do Block Length and Delay Behave Differently if Feedback Is Present?
Author :
Sahai, Anant
Author_Institution :
Univ. of California at Berkeley, Berkeley
Volume :
54
Issue :
5
fYear :
2008
fDate :
5/1/2008 12:00:00 AM
Firstpage :
1860
Lastpage :
1886
Abstract :
For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems show no improvements in their error exponents with feedback. This paper studies systems with fixed end-to-end delay and shows that feedback generally provides dramatic gains in the error exponents. A new upper bound (the uncertainty-focusing bound) is given on the probability of symbol error in a fixed-delay communication system with feedback. This bound turns out to have a form similar to Viterbi´s bound used for the block error probability of convolutional codes as a function of the fixed constraint length. The uncertainty-focusing bound is shown to be asymptotically achievable with noiseless feedback for erasure channels as well as for any output-symmetric DMC that has strictly positive zero-error capacity. Furthermore, it can be achieved in a delay-universal (anytime) fashion even if the feedback itself is delayed by a small amount. Finally, it is shown that for end-to-end delay, it is generally possible at high rates to beat the sphere-packing bound for general DMCs - thereby providing a counterexample to a conjecture of Pinsker.
Keywords :
block codes; channel coding; delays; error statistics; feedback; block length; discrete memoryless channels; erasure channels; feedback; fixed-delay communication system; output-symmetric DMC; symbol error probability; uncertainty-focusing bound; Automatic repeat request; Communication systems; Convolutional codes; Delay; Error probability; Memoryless systems; Monte Carlo methods; Output feedback; Power system reliability; Upper bound; Anytime reliability; delay; feedback; hybrid ARQ; list decoding; queuing; random coding; reliability functions; sphere- packing bounds;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2008.920339
Filename :
4494700
Link To Document :
بازگشت