Layered constructions for low-delay streaming codes

IEEE Transactions on Information Theory

Volumn 63, Issue 1, 2017, Pages 111-141

  Badr, Ahmed ^a   Patil, Pratik ^a   Khisti, Ashish ^a   Tan, Wai Tian ^b,c   Apostolopoulos, John ^b,c  

^a UNIVERSITY OF TORONTO   (Canada)

^b HEWLETT PACKARD LABORATORIES   (United States)

^c CISCO SYSTEMS   (United States)

Author keywords

application layer error correction; Delay constrained capacity; deterministic channel models; packet erasure channels; real time streaming communication

Indexed keywords

CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); CONVOLUTIONAL CODES; DECODING; ERROR CORRECTION; VIDEO STREAMING;

APPLICATION LAYERS; DELAY CONSTRAINED CAPACITY; DETERMINISTIC CHANNEL MODEL; PACKET ERASURE CHANNELS; REAL TIME STREAMING;

CHANNEL CODING;

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

References (40)

1. T. Huang, P. Huang, K. Chen, and P. Wang, Could Skype be more satisfying? A QoE-centric study of the FEC mechanism in an Internetscale VoIP system, IEEE Netw, vol. 24, no. 2, pp. 42-48, Mar. 2010.
2. A. Badr, A. Khisti, W. Tan, and J. Apostolopoulos, Robust streaming erasure codes using MDS constituent codes, in Proc. 13th Can. Workshop Inf. Theory (CWIT), Jun. 2013, pp. 158-163.
3. A. Badr, A. Khisti, W. T. Tan, and J. Apostolopoulos, Robust streaming erasure codes based on deterministic channel approximations, in Proc. Int. Symp. Inf. Theory (ISIT), Jul. 2013, pp. 1002-1006.
4. P. Patil, A. Badr, and A. Khisti, Delay-optimal streaming codes under source-channel rate mismatch, in Proc. Asilomar Conf. Signals Syst. Comput., Nov. 2013, pp. 2094-2099.
5. E. Martinian, and C. E. W. Sundberg, Burst erasure correction codes with low decoding delay, IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2494-2502, Oct. 2004.
6. E. Martinian, and M. Trott, Delay-optimal burst erasure code construction, in Proc. Int. Symp. Inf. Theory (ISIT), Jul. 2007, pp. 1006-1010.
7. E. M. Gabidulin, Convolutional codes over large alphabets, in Proc. Int. Workshop Algebraic Combinat. Coding Theory, 1988, pp. 80-84.
8. H. G. Luerssen, J. Rosenthal, and R. Smarandache, Strongly-MDS convolutional codes, IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 584-598, Feb. 2006.
9. A. Khisti, and J. Singh, On multicasting with streaming burst-erasure codes, in Proc. Int. Symp. Inf. Theory (ISIT), Jun. 2009, pp. 2887-2891.
10. A. Badr, A. Khisti, and E. Martinian, Diversity embedded streaming erasure codes (DE-SCo): Constructions and optimality, IEEE J. Sel. Areas Commun. (JSAC), vol. 29, no. 5, pp. 1042-1054, May 2011.
11. A. Badr, A. Khisti, and E. Martinian, Diversity embedded streaming erasure codes (DE-SCo): Constructions and optimality, in Proc. Global Commun. Conf. (GLOBECOM), 2010, pp. 1-5.
12. A. Badr, D. Lui, and A. Khisti, Streaming codes for multicast over burst erasure channels, IEEE Trans. Inf. Theory, vol. 16, no. 8, pp. 4181-4208, Aug. 2014.
13. A. Badr, D. Lui, and A. Khisti, Multicast streaming codes (Mu-SCo) for burst erasure channels, in Proc. 48th Annu. Allerton Conf. Commun., Control, Comput. (Allerton), Oct. 2010, pp. 383-390.
14. E. Martinian, Dynamic information and constraints in source and channel coding, Ph.D. dissertation, Massachusetts Inst. of Technol., Cambridge, MA, USA, 2004.
15. D. Lui, A. Badr, and A. Khisti, Streaming codes for a double-link burst erasure channel, in Proc. Can. Workshop Inf. Theory (CWIT), May 2011, pp. 147-150.
16. D. Lui, Coding theorems for delay sensitive communication over bursterasure channels, M.S. thesis, Dept. Elect. Comput. Eng., Univ. of Toronto, Toronto, ON, Canada, Aug. 2011.
17. Z. Li, A. Khisti, and B. Girod, Correcting erasure bursts with minimum decoding delay, in Proc. Asilomar Conf. Signals, Syst. Comput., Nov. 2011, pp. 33-39.
18. O. Tekin, T. Ho, H. Yao, and S. Jaggi, On erasure correction coding for streaming, in Proc. Inf. Theory Appl. Workshop (ITA), 2012, pp. 221-226.
19. D. Leong, and T. Ho, Erasure coding for real-Time streaming, in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2012, pp. 289-293.
20. D. Leong, A. Qureshi, and T. Ho, On coding for real-Time streaming under packet erasures, in Proc. Int. Symp. Inf. Theory (ISIT), Jul. 2013, pp. 1012-1016.
21. H. S. Witsenhausen, On the structure of real-Time source coders, Bell System Tech. J, vol. 58, no. 6, pp. 1437-1451, Jul. 1979.
22. D. Teneketzis, On the structure of optimal real-Time encoders and decoders in noisy communication, IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 4017-4035, Sep. 2006.
23. T. Javidi, and A. Goldsmith, Dynamic joint source-channel coding with feedback, in Proc. Int. Symp. Inf. Theory (ISIT), Jul. 2013, pp. 16-20.
24. L. J. Schulman, Coding for interactive communication, IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1745-1756, Nov. 1996.
25. A. Sahai, Anytime information theory, Ph.D. dissertation, Massachusetts Inst. of Technol., Cambridge, MA, USA, 2001.
26. R. Sukhavasi, and B. Hassibi, Linear error correcting codes with anytime reliability, in Proc. Int. Symp. Inf. Theory (ISIT), 2011, pp. 1748-1752.
27. G. Joshi, Y. Kochman, and G. W. Wornell, On playback delay in streaming communication, in Proc. Int. Symp. Inf. Theory (ISIT), 2012, pp. 2856-2860.
28. Y. Li, and E. Soljanin, Rateless codes for single-server streaming to diverse users, in Proc. 47th Annu. Allerton Conf. Commun., Control, Comput., 2009, pp. 1419-1426.
29. H. Yao, Y. Kochman, and G. W. Wornell, A multi-burst transmission strategy for streaming over blockage channels with long feedback delay, IEEE J. Sel. Areas Commun, vol. 29, no. 10, pp. 2033-2043, Dec. 2011.
30. S. Mehrotra, J. Li, and Y.-Z. Huang, Optimizing FEC transmission strategy for minimizing delay in lossless sequential streaming, IEEE Trans. Multimedia, vol. 13, no. 5, pp. 1066-1076, Oct. 2011.
31. S. Kokalj-Filipovic, P. Spasojevic, and E. Soljanin, Doped fountain coding for minimum delay data collection in circular networks, IEEE J. Sel. Areas Commun, vol. 27, no. 5, pp. 673-684, Jun. 2009.
32. R. Johannesson, and K. Zigangirov, Fundamentals of Convolutional Coding. Hoboken, NJ, USA: Wiley, 1999.
33. A. Badr, Error-correcting codes for low-delay streaming communications, Ph.D. dissertation, Univ. of Toronto, Toronto, ON, Canada, 2014.
34. T. Ho, et al., A random linear network coding approach to multicast, IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006.
35. Y. Li, P. Vingelmann, M. V. Pedersen, and E. Soljanin, Round-robin streaming with generations, in Proc. Int. Symp. Netw. Coding (NetCod), Jun. 2012, pp. 143-148.
36. A. Badr, A. Khisti, W. Tan, and J. Apostolopoulos, Streaming codes for channels with burst and isolated erasures, in Proc. Int. Conf. Comput. Commun. (INFOCOM), Apr. 2013, pp. 501-516.
37. E. N. Gilbert, Capacity of a burst-noise channel, Bell Syst. Tech. J, vol. 39, no. 5, pp. 1253-1265, 1960.
38. B. Fritchman, A binary channel characterization using partitioned Markov chains, IEEE Trans. Inf. Theory, vol. 13, no. 2, pp. 221-227, Apr. 1967.
39. A. Badr, A. Khisti, W. Tan, and J. Apostolopoulos, Streaming codes with partial recovery over channels with burst and isolated erasures, IEEE J. Sel. Topics Signal Process. (JSTSP), vol. 9, no. 3, pp. 501-516, Apr. 2015.
40. G. Forney, Convolutional codes I: Algebraic structure, IEEE Trans. Inf. Theory, vol. 16, no. 6, pp. 720-738, Nov. 1970.