An efficient VLSI architecture for nonbinary LDPC decoders
IEEE Transactions on Circuits and Systems II: Express Briefs
Efficient decoder design for nonbinary quasicyclic LDPC codes
IEEE Transactions on Circuits and Systems Part I: Regular Papers - Special issue on ISCAS 2009
A low-complexity rate-compatible LDPC decoder
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
A low complexity decoding algorithm for majority-logic decodable nonbinary LDPC codes
IEEE Communications Letters
Two low-complexity reliability-based message-passing algorithms for decoding non-binary LDPC codes
IEEE Transactions on Communications
Reduced-Complexity Decoder Architecture for Non-Binary LDPC Codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
Non-binary low-density parity-check (NB-LDPC) codes can achieve better error-correcting performance than their binary counterparts at the cost of higher decoding complexity when the codeword length is moderate. The recently developed iterative reliability-based majority-logic NB-LDPC decoding has better performance-complexity tradeoffs than previous algorithms. This paper first proposes enhancement schemes to the iterative hard reliability-based majority-logic decoding (IHRB-MLGD). Compared to the IHRB algorithm, our enhanced (E-)IHRB algorithm can achieve significant coding gain with small hardware overhead. Then low-complexity partial-parallel NB-LDPC decoder architectures are developed based on these two algorithms. Many existing NB-LDPC code construction methods lead to quasi-cyclic or cyclic codes. Both types of codes are considered in our design. Moreover, novel schemes are developed to keep a small proportion of messages in order to reduce the memory requirement without causing noticeable performance loss. In addition, a shift-message structure is proposed by using memories concatenated with variable node units to enable efficient partial-parallel decoding for cyclic NB-LDPC codes. Compared to previous designs based on the Min-max decoding algorithm, our proposed decoders have at least tens of times lower complexity with moderate coding gain loss.