Abstract
This paper presents a layered two-phase message passing (L-TPMP) decoding algorithm for general quasi-cyclic low-density parity-check (QC-LDPC) codes, which not only achieves high hardware utilization efficiency (HUE), but also brings in great memory block reduction. The main idea is to split the check matrix into several layers row-wise, then to perform the message passing computations sequentially layer by layer and the two-phase computations of different layers can be overlapped performed. There is no constraint to layer the check matrix hence L-TPMP decoding can be used in both high and low throughput applications for any QC-LDPC codes. The overall architecture of L-TPMP decoder is also discussed and an efficient memory arrangement scheme is proposed to reduce the memory blocks. For the (3048, 7493) LDPC code selected form Chinese DTTB, L-TPMP decoding saves over 85% memory blocks comparing with the conventional TPMP decoding, and the HUE of the L-TPMP decoder is 0.97.
Sign-in/Register to access full text options 
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.
