Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

A New Iterative LT Decoding Algorithm for Binary and Nonbinary Galois Fields

  • Mao, Yuexin (Department of Computer Science and Engineering, University of Connecticut) ;
  • Huang, Jie (Marvell Semiconductor) ;
  • Wang, Bing (Department of Computer Science and Engineering, University of Connecticut) ;
  • Huang, Jianzhong (LSI Corporation) ;
  • Zhou, Wei (Marvell Semiconductor) ;
  • Zhou, Shengli (Department of Electrical and Computer Engineering, University of Connecticut)
  • Received : 2012.08.14
  • Accepted : 2013.05.02
  • Published : 2013.08.31
Download PDF
⟨ Previous Next ⟩

Abstract

Digital fountain codes are record-breaking codes for erasure channels. They have many potential applications in both wired and wireless communications. Most existing digital fountain codes operate over binary fields using an iterative belief-propagation (BP) decoding algorithm. In this paper, we propose a new iterative decoding algorithm for both binary and nonbinary fields. The basic form of our proposed algorithm considers both degree-1 and degree-2 check nodes (instead of only degree-1 check nodes as in the original BP decoding scheme), and has linear complexity. Extensive simulation demonstrates that it outperforms the original BP decoding scheme, especially for a small number of source packets. The enhanced form of the proposed algorithm combines the basic form of the algorithm and a guess-based algorithm to further improve the decoding performance. Simulation results demonstrate that it can provide better decoding performance than the guess-based algorithm with fewer guesses, and can achieve decoding performance close to that of the maximum likelihood decoder at a much lower decoding complexity. Last, we show that our nonbinary scheme has the potential to outperform the binary scheme when choosing suitable degree distributions, and furthermore it is insensitive to the size of the Galois field.

Keywords

References

  1. J. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data," in Proc. ACM SIGCOMM, Vancouver, BC, Canada, 1998.
  2. J. Byers, M. Luby, and M. Mitzenmacher, "A digital fountain approach to asynchronous reliable multicast," IEEE J. Sel. Areas Commun., vol. 20, no. 8, pp. 1528-1540, Oct. 2002. https://doi.org/10.1109/JSAC.2002.803996
  3. J. W. Byers, M. Luby, and M. Mitzenmacher, "Accessing multiple mirror sites in parallel: Using tornado codes to speed up downloads," in Proc. IEEE INFOCOM, 1999.
  4. M. Mitzenmacher, "Digital fountains: A survey and look forward," in Proc. ITW, San Antonio, TX, 2004.
  5. P. Elias, "Coding for two noisy channels," in Proc. Symp. Inf. Theory, London, UK, 1956.
  6. D. MacKay, Information Theory, Inference, and Learning Algorithms. Cambridge University Press, 2003.
  7. M. Luby, "LT codes," in Proc. Annu. IEEE Symp. FOCS, Vancouver, BC, Canada, Nov. 2002.
  8. M. Luby, "Information additive code generator and decoder for communication systems," in U.S. Patent No. 6307487, 2001.
  9. M. Luby, "Information additive code generator and decoder for communication systems," in U.S. Patent No. 6373406, 2002.
  10. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
  11. M. Luby, M. Mitzenmacher, M. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001. https://doi.org/10.1109/18.910575
  12. P. Oswald and M. A. Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3017-3028, Dec. 2002. https://doi.org/10.1109/TIT.2002.805067
  13. M. A. Shokrollahi, "New sequences of linear time erasure codes approaching the channel capacity," in Proc. AAECC, 1999, pp. 65-76.
  14. M. A. Shokrollahi, "Capacity-achieving sequences," IMA Volumes in Mathematics and its Applications, vol. 123, pp. 153-166, 2000.
  15. A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, June, 2006. https://doi.org/10.1109/TIT.2006.874390
  16. "Technical specification group services and system aspects; multimedia broadcast/multicast services (MBMS); protocols and codecs (Release 6)," 3rd generation partnership project (3GPP), Tech. Rep. 3GPP TS 26.346 V6.3.0, 3GPP, 2005.
  17. H. Pishro-Nik and F. Fekri, "On decoding of low-density parity-check codes over the binary erasure channel," IEEE Trans. Inf. Theory, vol. 50, no. 3, pp. 439-454, Mar. 2004. https://doi.org/10.1109/TIT.2004.824918
  18. A. Shokrollahi, S. Lassen, and R. Karp, "Systems and processes for decoding chain reaction codes through tnactivation," U.S. Patent 6,856,263, 2005.
  19. P. M. Olmos, J. J. Murillo-Fuentes, and F. Perez-Cruz, "Tree-structured expectation propagation for decoding finite-length LDPC codes," IEEE Commun. Lett., vol. 15, no. 2, pp. 235-237, Feb. 2011. https://doi.org/10.1109/LCOMM.2011.010311.102015
  20. M. C. Davey and D. Mackay, "Low-density parity-check codes over GF(q)," IEEE Commun. Lett., vol. 2, no. 6, pp. 165-167, June, 1998. https://doi.org/10.1109/4234.681360
  21. J. Huang and J.-K. Zhu, "Linear time encoding of cycle GF(2p) codes through graph analysis," IEEE Commun. Lett., vol. 10, no. 5, pp. 369-371, May, 2006. https://doi.org/10.1109/LCOMM.2006.1633326
  22. V. Rathi, "Conditional entropy of non-binary LDPC codes over BEC," in Proc. Int. Symp. Inf. Theory, Toronto, Canada, July 2008.
  23. V. Rathi and I. Andriyanova, "Some results on MAP decoding of nNonbinary LDPC codes over the BEC," IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 2225-2242, Apr. 2011. https://doi.org/10.1109/TIT.2011.2110930
  24. J. Huang, S. Zhou, and P. Willett, "Nonbinary LDPC coding for multicarrier underwater acoustic communication," IEEE J. Sel. Areas Commun., vol. 26, no. 9, pp. 1684-1696, Dec. 2008. https://doi.org/10.1109/JSAC.2008.081208