Referenced Items are not available for this document.
In this paper, a new method based on Sum Product algorithm (SPA) using stopping node to reduce computing complexity on Low Density Parity Check Codes (LDPC) decoding algorithms is presented. We show how to make early decisions to reduce calculation of the next iteration. Simulation results show that performance of iterative decoding for LDPC codes using stopping node algorithm can reduce up to 10 times computational complexity with maintaining quality level.
Published in:
Communication Technology (ICCT), 2011 IEEE 13th International Conference on
Date of Conference: 25-28 Sept. 2011
- Page(s):
- 118 - 121
- Print ISBN:
- 978-1-61284-306-3
- INSPEC Accession Number:
- 12575598
- Conference Location :
- Jinan
- Digital Object Identifier :
- 10.1109/ICCT.2011.6157845
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
