ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지
DOI QR코드

DOI QR Code

Decoding of LT-Like Codes in the Absence of Degree-One Code Symbols

  • Abdulkhaleq, Nadhir I. (Department of Electronics and Communication, Cankaya University) ;
  • Gazi, Orhan (Department of Electronics and Communication, Cankaya University)
  • Received : 2016.02.17
  • Accepted : 2016.05.16
  • Published : 2016.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

Luby transform (LT) codes were the first practical rateless erasure codes proposed in the literature. The performances of these codes, which are iteratively decoded using belief propagation algorithms, depend on the degree distribution used to generate the coded symbols. The existence of degree-one coded symbols is essential for the starting and continuation of the decoding process. The absence of a degree-one coded symbol at any instant of an iterative decoding operation results in decoding failure. To alleviate this problem, we proposed a method used in the absence of a degree-one code symbol to overcome a stuck decoding operation and its continuation. The simulation results show that the proposed approach provides a better performance than a conventional LT code and memory-based robust soliton distributed LT code, as well as that of a Gaussian elimination assisted LT code, particularly for short data lengths.

Keywords

References

  1. J.W. Byers et al., "A Digital Fountain Approach to Reliable Distribution of Bulk Data," Proc. ACM Conf. Appl., Technol., Archiectures Protocls comput. Commun., Vancouver, Canada, Aug. 1998, pp. 56-67.
  2. A. Shokrollahi, "Raptor Codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, June 2006, pp. 2551-2567. https://doi.org/10.1109/TIT.2006.874390
  3. J.H. Sorensen, P. Popovski, and J. Ostergaard, "Design and Analysis of LT Codes with Decreasing Ripple Size," IEEE Trans. Commun., vol. 60, no. 11, June 2012, pp. 3191-3197. https://doi.org/10.1109/TCOMM.2012.091112.110864
  4. D.J.C. MacKay, "Information Theory, Inference, and Learning Algorithm," in Computer Modern, 3rd ed., Cambridge, UK: Cambridge University Press, 2004, pp. 591-596.
  5. M. Luby, "LT Codes," Proc. Annu. IEEE Symp. Found. Comput. Sci., Vancouver, Canada, Nov. 16-19, 2002, pp. 271-280.
  6. Z. Zhiliang et al., "Performance Analysis of LT Codes with Different Degree Distribution," Int. Workshop Chaos-fractals Theories Appl., Liaoning, China, Oct. 18-21, 2012, pp. 142-146.
  7. G. Chunmei and B. Xueyao, "Performance Analysis and Parameter Optimizing Rules of LT Codes," J. China Commun., vol. 7, no. 4, 2010, pp. 103-107.
  8. K. Yen et al., "Modified Robust Soliton Distribution (MRSD) with Improved Ripple Size for LT Codes," IEEE Commun. Lett., vol. 17, no. 5, May 2013, pp. 976-979. https://doi.org/10.1109/LCOMM.2013.040913.130136
  9. L. Haifeng et al., "LT-W: Improving LT Decoding with Wiedemann Solver," IEEE Trans. Inf. Theory, vol. 59, no. 12, Dec. 2013, pp. 7887-7897. https://doi.org/10.1109/TIT.2013.2283500
  10. K.F. Hayajneh, S. Yousefi, and M. Valipour, "Improved Finite-Length Luby-Transform Codes in the Binary Erasure Channel," J. IET Commun., vol. 9, no. 8, 2015, pp. 1122-1130. https://doi.org/10.1049/iet-com.2014.0658
  11. D.J.C. MacKay, "Fountain Codes," IEE Proc. Commun., vol. 152, no. 6, Dec. 2005, pp. 1062-1068. https://doi.org/10.1049/ip-com:20050237
  12. V. Bioglio et al., "On the Fly Gaussian Elimination for LT Codes," IEEE Commun. Lett., vol. 13, no. 12, Dec. 2009, pp. 953-955. https://doi.org/10.1109/LCOMM.2009.12.091824
  13. H.Y. Cheong et al., "Belief Propagation Decoding Assisted onthe-Fly Gaussian Elimination for Short LT Codes," Cluster Comput., vol. 19, no. 1, Mar. 2016, pp. 309-314. https://doi.org/10.1007/s10586-015-0522-0
  14. S.J. Kim, K.R. Ko, and S.Y. Chung, "Incremental Gaussian Elimination Decoding of Raptor Codes over BEC," IEEE Commun. Lett., vol. 12, no. 4, Apr. 2008, pp. 307-309. https://doi.org/10.1109/LCOMM.2008.072141