Design of Optimized Sliding-Window BATS Codes

Batched sparse (BATS) codes are a low-complexity random linear network coding scheme that can achieve asymptotic bandwidth optimality. The destination node of BATS codes starts to decode the information packets only after receiving a sufficient number of coded packets which induces delay. Furthermore, the larger the size of source block is, the longer the delay is. In this letter, we propose a scheme by using sliding windows applied over BATS codes, named sliding-window BATS codes, which divides the information data into smaller blocks so as to reduce delay. Moreover, for improving the performance, we optimize the degree distributions with linear programming, and its performance is verified by computer simulations.

[1]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[2]  Joong Bum Rhim,et al.  Fountain Codes , 2010 .

[3]  Enrico Magli,et al.  Sliding-Window Raptor Codes for Efficient Scalable Wireless Video Broadcasting With Unequal Loss Protection , 2010, IEEE Transactions on Image Processing.

[4]  Lei Yuan,et al.  BATS code with unequal error protection , 2016, 2016 IEEE International Conference on Communication Systems (ICCS).

[5]  Enrico Magli,et al.  Sliding-Window Digital Fountain Codes for Streaming of Multimedia Contents , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[6]  Shenghao Yang,et al.  Tree Analysis of BATS Codes , 2016, IEEE Communications Letters.

[7]  Michael Mitzenmacher,et al.  Analysis of random processes via And-Or tree evaluation , 1998, SODA '98.

[8]  Xiaoli Xu,et al.  Expanding-Window BATS Code for Scalable Video Multicasting Over Erasure Networks , 2017, IEEE Transactions on Multimedia.

[9]  Shenghao Yang,et al.  Batched Sparse Codes , 2012, IEEE Transactions on Information Theory.

[10]  Shenghao Yang,et al.  Finite-length analysis of BATS codes , 2013, NetCod.