Abstract
We introduce an implementation-friendly binary message-passing decoding method for low-density parity-check (LDPC) codes that does not require the degree information of variable nodes or degree dependent parameters. For hard decision decoding, given its low-complexity, the implementation cost for variable node degree information is an important consideration. We develop an estimation method for the extrinsic error probability (EEP) as well as its analysis. The proposed method offers similar performance as the existing methods for time-invariant decoding in most cases, while it facilitates efficient circuit implementations of the LDPC decoder.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
