Low Complexity Implementation Of LDPC Decoder using MIN-Sum Algorithm
Geo Niju Shanth and Saru Priya. Article: Low Complexity Implementation Of LDPC Decoder using MIN-Sum Algorithm. IJCA Proceedings on International Conference on Innovations In Intelligent Instrumentation, Optimization and Electrical Sciences ICIIIOES(1):37-41, December 2013. Full text available. BibTeX
@article{key:article,
author = {Geo Niju Shanth and Saru Priya},
title = {Article: Low Complexity Implementation Of LDPC Decoder using MIN-Sum Algorithm},
journal = {IJCA Proceedings on International Conference on Innovations In Intelligent Instrumentation, Optimization and Electrical Sciences},
year = {2013},
volume = {ICIIIOES},
number = {1},
pages = {37-41},
month = {December},
note = {Full text available}
}
Abstract
This paper presents a resource efficient LDPC decoder architecture. The algorithm used for decoding LDPC is the min-sum algorithm. The decoder reduces the inter-connect complexity by restricting the extrinsic message length to 2 bits and also simplifies the check node operation. The algorithm is simulated and the results show that the performance is better than that of other algorithms. This algorithm can be incorporated into partially parallel hardware architecture to get significant savings in hardware resources when implemented in FPGA.
References
- R. Gallager, Low-density parity-check codes, IRE Transactions on Information Theory 8 (1) (1962) 21–28. .
- D. J. C. MacKay, Good error-correcting codes based on very sparse matrices, IEEE Transactions on Information Theory 45 (2) (1999) 399–431.
- Tetsuo Nozawa, LDPC Adopted for Use in Comms, Broadcasting, HDDs, Tech On, 2005. Tavel, P. 2007 Modeling and Simulation Design. AK Peters Ltd.
- G. L. L. Nicolas Fau, LDPC (Low Density Parity Check)— A Wireless PHY Layers EE Times Network, 2008
- A. Anastasopoulos, A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution, in: Proceedings of the IEEE Global Telecommunications Conference, San Antonio, TX, pp. 1021– 1025, 25–29 November 2001.
- R. Zarubica, R. Hinton, S. G. Wilson, E. K. Hall, Efficient quantization schemes for LDPC decoders, in: Proceedings of the 'IEEE Military Communications Conference, San Diego, CA, pp. 1–5, 16–19 November 2008.
- Vikram Arkalgud Chandrasetty, Syed Mahfuzul Aziz, An area efficient LDPC decoder using a reduced complexity min-sum algorithm. Integration, the VLSI journal, Volume 45, Issue 2, March 2012.
- X. Y. Hu, Software to Construct PEG LDPC code, [cited on May 2009]. Available from:
- J. G. Proakis, Digital Communications, Fifth ed, McGraw-Hill, New York, 2008.
- M. Fossorier. Quasi-cyclic low-density parity-check codes from circulant permutation matrices. IEEE Transaction Information Theory, 50(8):1788–1793, Aug. 2004.
- J. Zhao, F. Zarkeshvari, and A. H. BanihaShemi. On the implementation of Min-Sum Algorithm and its modifications for Decoding Low-Density Parity-Check Codes. IEEE Transactions on Communications, 53(4):549–554, April 2005.
- K. Shimizu, T. Ishikawa, N. Togawa, T. Ikenaga, S. Goto, Partially-parallel LDPC decoder based on high-efficiency message-passing algorithm, in: Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp. 503–510, 2–5 October 2005.