An Improved BP Decoding of BATS Codes With Iterated Incremental Gaussian Elimination

In this letter, we propose an improved algorithm for decoding finite-length BATS codes using belief propagation (BP) decoding. Our proposed algorithm iteratively performs BP decoding and incremental Gaussian elimination for improving the decoding performance. Furthermore, instead of directly using Gaussian elimination after BP decoding, the incremental Gaussian elimination has been iteratively used to resume BP decoding, which can noticeably reduce the computational complexity of decoding. The simulation results demonstrate that the proposed decoding algorithm can achieve the same decoding performance as conventional Gaussian elimination while significantly reducing the number of finite field operations in decoding.

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

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

[3]  Matteo Sereno,et al.  On the fly gaussian elimination for LT codes , 2009, IEEE Communications Letters.

[4]  Shenghao Yang,et al.  Finite-length analysis of BATS codes , 2013, 2013 International Symposium on Network Coding (NetCod).

[5]  Li Haitao,et al.  Simplified BATS codes for deep space multihop networks , 2016, 2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference.

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

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

[8]  Jiang Yu,et al.  An algorithm with high decoding success probability based on LT codes , 2010, Proceedings of the 9th International Symposium on Antennas, Propagation and EM Theory.

[9]  Sae-Young Chung,et al.  Incremental Gaussian elimination decoding of raptor codes over BEC , 2008, IEEE Communications Letters.