Skip to main content
SpringerLink
Log in

Reduced-Complexity Decoding of LT Codes

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In this paper, the belief propagation (BP) based approximation methods for low-density parity-check codes are adapted to the Luby transform soft decoder structure in order to reduce its computational complexity. Moreover, the log-likelihood ratio based adaptive demodulation algorithm is combined with the BP and BP-based algorithms to further reduce the computational complexities and optimum key parameters are determined for normalized min-sum and offset min-sum algorithms. The bit error rate performances of the algorithms over the binary input additive white Gaussian noise channel are obtained by both theoretically and simulations. For theoretical analysis, the Monte-Carlo based density evolution method is used. In addition, computational complexity analyzes of methods are presented. Results show that the computational complexity can be reduced significantly by using combined methods which cost limited signal to noise ratio loss.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Cheng, Z., Castura, J., & Mao, Y. (2009). On the design of raptor codes for binary-input Gaussian channels. IEEE Transactions on Communications, 57(11), 3269–3277.

    Article  Google Scholar 

  2. Etesami, O., & Shokrollahi, A. (2006). Raptor codes on binary memoryless symmetric channels. IEEE Transactions on Information Theory, 52(5), 2033–2051.

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen, J., Dholakia, A., Eleftheriou, E., Fossorier, M. P. C., & Hu, X.-Y. (2005). Reduced-complexity decoding of LDPC codes. IEEE Transactions on Communications, 53(8), 1288–1299.

    Article  Google Scholar 

  4. Turk, K., & Fan, P. (2012). Adaptive demodulation using rateless codes based on maximum a posteriori probability. IEEE Communications Letters, 16(8), 1284–1287.

    Article  Google Scholar 

  5. Hussain, I., Xiao, M., & Rasmussen, L. K. (2013). Reduced-complexity decoding of LT codes over noisy channels. In IEEE wireless communications and networking conference (WCNC) (pp. 3856–3860).

  6. Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L. (2001). Design of capacity-approaching irregular low-density parity-check codes. IEEE Transactions on Information Theory, 47(2), 619–637.

    Article  MathSciNet  MATH  Google Scholar 

  7. Brink, S. T., Kramer, G., & Ashikhmin, A. (2004). Design of low-density parity-check codes for modulation and detection. IEEE Transactions on Communications, 52(4), 670–678.

    Article  Google Scholar 

  8. Gorgoglione, M., Savin, V., & Declercq, D. (2010). Optimized puncturing distributions for irregular non-binary LDPC codes, In IEEE international symposium on information theory and its applications (pp 400–405).

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Electronics Engineering, Karadeniz Technical University, 61080, Trabzon, Turkey

    Cenk Albayrak & Kadir Turk

Authors
  1. Cenk Albayrak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kadir Turk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cenk Albayrak.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Albayrak, C., Turk, K. Reduced-Complexity Decoding of LT Codes. Wireless Pers Commun 94, 969–975 (2017). https://doi.org/10.1007/s11277-016-3660-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-016-3660-7

Keywords

Search

Navigation