Abstract
In this chapter, a new technique to improve the min-sum decoding algorithm for the low density parity check (LDPC) code has been proposed. This technique is based on the magnitude overestimation correction of the variable message by using two normalized factors in all iterations. The variable message is modified with a normalized factor when there is a sign change and with another normalized factor when there is no sign change during any two consecutive iterations. In this way, the algorithm gives a more optimum approximation to the min-sum decoding algorithm. This new technique outperforms for medium and short length codes and for small number of iterations, which make it suitable for practical applications and hardware implementation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gallager RG (1963) Low-density parity-check code. MIT Press, Cambridge
Mackay D, Neal R (1996) Near Shannon limit performance of low density parity check codes. Electron Lett 32(18):1645–1646
Chung S, Forney GD, Richardson JJ, Urbanke R (2001) On the design of low-density parity-check codes within 0.0045 db of the Shannon limit. IEEE Commun Lett 5:58–60
Richardson T, Shokrollahi MA, Urbanke RL (2001) Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans Inf Theory 47:619–637
Richardson T, Urbanke R (2000) The capacity of low-density parity check codes under message-passing decoding. IEEE Trans Inf Theory 47:599–618
Mackay D (1999) Good error correcting codes on very sparse matrices. IEEE Trans Inf Theory 45(2):399–431
Fossorier MPC, Mihaljevic M, Imai H (1999) Reduced complexity iterative decoding of low density parity check codes based on belief propagation. IEEE Trans Commun 47(5):673–680
Chen J, Dholakia A, Eleftheriou E et al (2005) Reduced-complexity decoding of LDPC codes. IEEE Trans Commun 53(8):1288–1299
Chen J, Fossorier MPC (2002) Density evolution for two improved BP-based decoding algorithms of LDPC codes. IEEE Commun Lett 6(5):208–210
Heo J (2003) Analysis of scaling soft information on low density parity check code. Electron Lett 55:219–221
Chen J, Fossorier MPC (2002) Near optimum universal belief propagation based decoding of low-density parity check codes. IEEE Trans Commun 50(3):406–414
Zhao J, Zarkeshvari F, Banihashemi AH (2005) On implementation of min-sum algorithm and its modifications for decoding low-density parity-check (LDPC) codes. IEEE Trans Commun 53:549
Chandrasetty VA, Aziz SM (2010) FPGA implementation of high performance LDPC decoder using modified 2-bit min-sum algorithm. Proceedings of the 2nd international conference on computer research and development, Kuala Lumpur, 7–10 May 2010, pp 881–885
Aziz SM, Pham MD (2010) Implementation of low density parity check decoders using a new high level design methodology. J Comput 5(1):0234–0237
Hai-yang L, Wen-ze QU, Bin L, Jiang-peng L, Shi-dong L, Jie C (2010) Novel modified min-sum decoding algorithm for low-density parity-check codes, www.sciencedirect.com. J China Univ Posts Telecommun 17:1–5
Acknowledgments
Supported by Science and Technology on Avionics Integration Laboratory and National Foundation of Aeronautical Science and Research under contract No. 20105552031.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media B.V.
About this paper
Cite this paper
Ullah, W., Jiangtao, ., FengFan, Y. (2012). Improved Min-Sum Decoding Algorithm for Moderate Length Low Density Parity Check Codes. In: He, X., Hua, E., Lin, Y., Liu, X. (eds) Computer, Informatics, Cybernetics and Applications. Lecture Notes in Electrical Engineering, vol 107. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-1839-5_101
Download citation
DOI: https://doi.org/10.1007/978-94-007-1839-5_101
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-1838-8
Online ISBN: 978-94-007-1839-5
eBook Packages: EngineeringEngineering (R0)