Why do block length and delay behave differently if feedback is present?

IEEE Transactions on Information Theory

Volumn 54, Issue 5, 2008, Pages 1860-1886

  Sahai, Anant ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Anytime reliability; Delay; Feedback; Hybrid ARQ; List decoding; Queuing; Random coding; Reliability functions; Sphere packing bounds

Indexed keywords

BOUNDARY CONDITIONS; COMMUNICATION SYSTEMS; CONVOLUTIONAL CODES; FEEDBACK; PROBABILITY; QUEUEING THEORY; VITERBI ALGORITHM;

DISCRETE MEMORYLESS CHANNELS (DMCS); END-TO-END DELAY; FIXED-DELAY COMMUNICATION SYSTEM; UNCERTAINTY-FOCUSING BOUND; ZERO-ERROR CAPACITY;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 43749112962     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.920339     Document Type: Article

References (46)

1. M. S. Pinsker, "Bounds on the probability and of the number of correctable errors for nonblock codes," Problemy Peredachi Informatsii, vol. 3, no. 4, pp. 44-55, Oct./Dec. 1967.
2. H. T. Simsek, "Anytime channel coding with feedback," Ph.D. dissertation, Dept. Elec. Eng. Comp. Sci., Univ. California, Berkeley, CA, 2004.
3. T. Simsek, R. Jain, and P. Varaiya, "Scalar estimation and control with noisy binary observations," IEEE Trans. Autom. Control, vol. 49, no. 9, pp. 1598-1603, Sep. 2004.
4. A. Sahai and S. K. Mitter, "The necessity and sufficiency of anytime capacity for stabilization of a linear system over a noisy communication link. Part I: Scalar systems," IEEE Trans. Inf. Theory, vol. 52, no. 8, pp. 3369-3395, Aug. 2006.
5. M. Luby, "LT-codes," in Proc. 43rd Annu. IEEE Symp. Found. Comput. Sci., 2002, pp. 271-280.
6. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, Jul./Oct. 1948.
7. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
8. E. A. Haroutunian, "Lower bound for error probability in channels with feedback," Problemy Peredachi Informatsii, vol. 13, no. 2, pp. 36-44, 1977.
9. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
10. R. L. Dobrushin, "An asymptotic bound for the probability error of information transmission through a channel without memory using the feedback," Problemy Kibernetiki, vol. 8, pp. 161-168, 1962.
11. J. P. M. Schalkwijk and T. Kailath, "A coding scheme for additive noise channels with feedback - I: No bandwidth constraint," IEEE Trans. Inf. Theory, vol. IT-12, no. 2, pp. 172-182, Apr. 1966.
12. J. P. M. Schalkwijk, "A coding scheme for additive noise channels with feedback - II: Band-limited signals," IEEE Trans. Inf. Theory, vol. IT-12, no. 2, pp. 183-189, Apr. 1966.
13. A. D. Wyner, "On the Schalkwijk-Kailath coding scheme with a peak energy constraint," IEEE Trans. Inf. Theory, vol. IT-14, no. 1, pp. 129-134, Jan. 1968.
14. C. E. Shannon, "The zero error capacity of a noisy channel," IEEE Trans. Inf. Theory, vol. IT-2, no. 3, pp. 8-19, Sep. 1956.
15. A. Orlitsky and J. Körner, "Zero error information theory," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2207-2229, Oct. 1998.
16. C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, "Lower bounds: Part I," Inf. Control, vol. 25, no. 3, pp. 222-266, Jul. 1974.
17. S. Draper and A. Sahai, "Variable-length coding with noisy feedback," Eur. Trans. Telecommun., 2008, to be published.
18. A. Sahai and T. Simsek, "On the variable-delay reliability function of discrete memoryless channels with access to noisy feedback," in Proc. IEEE Workshop Information Theory, San Antonio, TX, Nov. 2004, pp. 336-341.
19. M. V. Burnashev, "Data transmission over a discrete channel with feedback, random transmission time," Problemy Perdachi Informatsii vol. 12, no. 4, pp. 10-30, Oct./Dec. 1976.
20. H. Yamamoto and K. Itoh, "Asymptotic performance of a modified Schalkwijk-Barron scheme for channels with noiseless feedback," IEEE Trans. Inf. Theory, vol. IT-25, no. 6, pp. 729-733, Nov. 1979.
21. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
22. G. D. Forney, "Convolutional codes III. Sequential decoding," Inf. Control, vol. 25, no. 3, pp. 267-297, Jul. 1974.
23. A. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inf. Theory, vol. IT-13, no. 2, pp. 260-269, Apr. 1967.
24. C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, "Lower bounds: Part II," Inf. Control, vol. 25, no. 3, pp. 222-266, Jul. 1974.
25. G. D. Forney, "Convolutional codes II. Maximum-likelihood decoding," Inf. Control, vol. 25, no. 3, pp. 222-266, Jul. 1974.
26. F. Jelinek, "Upper bounds on sequential decoding performance parameters," IEEE Trans. Inf. Theory, vol. IT-20, no. 2, pp. 227-239, Mar. 1974.
27. M. Horstein, "Sequential transmission using noiseless feedback," IEEE Trans. Inf. Theory, vol. IT-9, no. 3, pp. 136-143, Jul. 1963.
28. R. J. F. Fang, "Lower bounds on reliability functions of variable-length nonsystematic convolutional codes for channels with noiseless feedback," IEEE Trans. Inf. Theory, vol. IT-17, no. 2, pp. 161-171, Mar. 1971.
29. T. Hashimoto, "On the error exponent of convolutionally coded ARQ," IEEE Trans. Inf. Theory, vol. 40, no. 2, pp. 567-575, Mar. 1994.
30. T. Veugen, "A simple class of capacity-achieving strategies for discrete memoryless channels with feedback," IEEE Trans. Inf. Theory vol. 42, no. 6, pp. 2221-2228, Nov. 1996.
31. J. P. M. Schalkwijk and K. A. Post, "On the error probability for a class of binary recursive feedback strategies," IEEE Trans. Inf. Theory, vol. IT-19, no. 4, pp. 498-511, Jul. 1973.
32. B. D. Kudryashov, "Message transmission over a discrete channel with noiseless feedback," Problemy Peredachi Informatsii, vol. 15, no. 1, pp. 1-9, Jan. 1979.
33. B. D. Kudryashov, "Error probability for repeat request systems with convolutional codes," IEEE Trans. Inf. Theory, vol. 39, no. 5, pp. 1680-1684, Sep. 1993.
34. J. M. Ooi and G. W.Wornell, "Fast iterative coding techniques for feedback channels," IEEE Trans. Inf. Theory, vol. 44, no. 7, pp. 2960-2976, Nov. 1998.
35. J. M. Ooi, Coding for Channels with Feedback. Boston, MA: Kluwer, 1998.
36. A. Sahai and P. Grover, "The price of certainty: Waterslide curves and the gap to capacity," IEEE Trans. Inf. Theory [Online].Available: http://arxiv.org/abs/0801.0352, submitted for publication
37. A. Sahai, "Balancing forward and feedback error correction for erasure channels with unreliable feedback," IEEE Trans. Inf. Theory [Online]. Available: http://arxiv.org/abs/0712.0871, submitted for publication
38. A. Sahai, "Evaluating channels for control: Capacity reconsidered," in Proc. Amer. Control Conf., Chicago, IL, Jun. 2000, pp. 2358-2362.
39. A. Sahai, "Any-time information theory," Ph.D. dissertation, Dept. Elec. Eng. Comp. Sci., MIT, Cambridge, MA, 2001.
40. A. Sahai and S. K. Mitter, "The necessity and sufficiency of anytime capacity for stabilization of a linear system over a noisy communication link. Part II: Vector systems," IEEE Trans. Inf. Theory [Online]. Available: http://arxiv.org/abs/cs/0610146, submitted for publication
41. C. E. Shannon, "Coding theorems for a discrete source with a fidelity criterion," IRE Nat. Convention Record, vol. 7, no. 4, pp. 142-163, 1959.
42. C. Chang and A. Sahai, "The price of ignorance: The impact of side-information on delay for lossless source-coding," IEEE Trans. Inf. Theory [Online]. Available: http://arxiv.org/abs/0712.0873, submitted for publication
43. I. M. Jacobs and E. R. Berlekamp, "A lower bound to the distribution of computation for sequential decoding," IEEE Trans. Inf. Theory, vol. IT-13, no. 2, pp. 167-174, Apr. 1967.
44. M. S. Pinsker, "On the complexity of decoding," Problemy Peredachi Informatsii, vol. 1, no. 1, pp. 84-86, Jan. 1965.
45. E. Arikan, "Channel combining and splitting for cutoff rate improvement," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 628-639, Feb. 2006.
46. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.