Burst-Erasure Correcting Codes With Optimal Average Delay

The objective of low-delay codes is to protect communication streams from erasure bursts by minimizing the time between the packet erasure and its reconstruction. Previous work has concentrated on the constant-delay scenario, where all erased packets need to exhibit the same decoding delay. We consider the case of heterogeneous delay, where the objective is to minimize the average delay across the erased packets in a burst. We derive delay lower bounds for the average case, and show that they match the constant-delay bounds only at a single rate point <inline-formula> <tex-math notation="LaTeX">$R=0.5$ </tex-math></inline-formula>. We then construct codes with optimal average delays for the entire range of code rates. The construction for rates <inline-formula> <tex-math notation="LaTeX">$R\leq 0.5$ </tex-math></inline-formula> achieves optimality for every erasure instance, while the construction for rates <inline-formula> <tex-math notation="LaTeX">$R>0.5$ </tex-math></inline-formula> is optimal for a <inline-formula> <tex-math notation="LaTeX">$(1-R)/R$ </tex-math></inline-formula> fraction of all burst instances and close to optimal for the remaining fraction. The paper also studies the benefits of delay heterogeneity within the application of sensor communications. It is shown that a carefully designed code can significantly improve the temporal precision at the receiving node following erasure-burst events.

[1]  Tracey Ho,et al.  On coding for real-time streaming under packet erasures , 2013, 2013 IEEE International Symposium on Information Theory.

[2]  Jr. G. Forney,et al.  Burst-Correcting Codes for the Classic Bursty Channel , 1971 .

[3]  Carl-Erik W. Sundberg,et al.  Burst erasure correction codes with low decoding delay , 2004, IEEE Transactions on Information Theory.

[4]  Ali C. Begen,et al.  Delay-Optimal Burst Erasure Codes for Parallel Links , 2011, 2011 International Symposium on Networking Coding.

[5]  Tracey Ho,et al.  On prioritized coding for real-time streaming under packet erasures , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[6]  E. Gilbert.  Capacity of a burst-noise channel , 1960 .

[7]  Bernd Girod,et al.  Forward Error Protection for low-delay packet video , 2010, 2010 18th International Packet Video Workshop.

[8]  Tracey Ho,et al.  Erasure coding for real-time streaming , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[9]  Wai-tian Tan,et al.  Robust streaming erasure codes using MDS constituent codes , 2013, 2013 13th Canadian Workshop on Information Theory.

[10]  Bernd Girod,et al.  Robust Internet video transmission based on scalable coding and unequal error protection , 1999, Signal Process. Image Commun..

[11]  Wai-tian Tan,et al.  Streaming Codes With Partial Recovery Over Channels With Burst and Isolated Erasures , 2015, IEEE Journal of Selected Topics in Signal Processing.

[12]  Ashish Khisti,et al.  On multicasting with streaming burst-erasure codes , 2009, 2009 IEEE International Symposium on Information Theory.

[13]  Richard E. Ladner,et al.  Unequal loss protection: graceful degradation of image quality over packet erasure channels through forward error correction , 2000, IEEE Journal on Selected Areas in Communications.

[14]  Ahmed Badr,et al.  Streaming Codes for Multicast Over Burst Erasure Channels , 2015, IEEE Transactions on Information Theory.

[15]  Ahmed Badr,et al.  Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and Optimality , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[16]  Bernd Girod,et al.  Correcting erasure bursts with minimum decoding delay , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[17]  Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers, ACSCC 2011, Pacific Grove, CA, USA, November 6-9, 2011 , 2011, ACSCC.

[18]  Ahmed Badr,et al.  Multicast streaming codes (Mu-SCo) for burst erasure channels , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[19]  Emin Martinian,et al.  Delay-Optimal Burst Erasure Code Construction , 2007, 2007 IEEE International Symposium on Information Theory.

[20]  Madhu Sudan,et al.  Priority encoding transmission , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[21]  Yücel Altunbasak,et al.  Error-resilient image and video transmission over the Internet using unequal error protection , 2003, IEEE Trans. Image Process..