A high-throughput trellis-based layered decoding architecture for non-binary LDPC codes using Max-Log-QSPA

40Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a high-throughput decoder architecture for non-binary low-density parity-check (LDPC) codes, where the q-ary sum-product algorithm (QSPA) in the log domain is considered. We reformulate the check-node processing such that an efficient trellis-based implementation can be used, where forward and backward recursions are involved. In order to increase the decoding throughput, bidirectional forward-backward recursion is used. In addition, layered decoding is adopted to reduce the number of iterations based on a given performance. Finally, a message compression technique is used to reduce the storage requirements and hence the area. Using a 90-nm CMOS process, a 32-ary (837,726) LDPC decoder was implemented to demonstrate the proposed techniques and architecture. This decoder can achieve a throughput of 233.53 Mb/s at a clock frequency of 250 MHz based on the post-layout results. Compared to the decoders presented in previous literature, the proposed decoder can achieve the highest throughput based on a similar/better error-rate performance. © 1991-2012 IEEE.

Cite

CITATION STYLE

APA

Ueng, Y. L., Liao, K. H., Chou, H. C., & Yang, C. J. (2013). A high-throughput trellis-based layered decoding architecture for non-binary LDPC codes using Max-Log-QSPA. IEEE Transactions on Signal Processing, 61(11), 2940–2951. https://doi.org/10.1109/TSP.2013.2256905

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free