Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
International Conference on Electronics, Information and Communication Engineering (EICE 2012)Available to Purchase
By
Garry Lee
Garry Lee
Information Engineering Research Institute
Search for other works by this author on:
ISBN:
9780791859971
No. of Pages:
1008
Publisher:
ASME Press
Publication date:
2012

The joint row-column decoding algorithm for Low Density Parity Check (LDPC) codes is widely used in high-speed communications. However, the pipeline operation of the decoder may introduce memory access conflicts, which heavily deteriorates the decoding throughput. To essentially deal with the issue of memory access conflicts, we present a construction method of LDPC codes for joint row-column decoding algorithm. It can avoid routing congestion and reduce decoder pipeline delay. The LDPC codes constructed by the proposed method can greatly reduce the decoding iterations. Meanwhile, the performance of them is the same as the codes constructed by conventional Block Progressive Edge-Growth (Block-PEG) algorithm.

Abstract
Keywords
Introduction
Joint Row-Column Decoding Algorithm
LDPC Construction Algorithm
Performance Analysis
Conclusion
References
This content is only available via PDF.
You do not currently have access to this chapter.

or Create an Account

Close Modal
Close Modal