PROJECT TITLE :

Basic-Set Trellis Min–Max Decoder Architecture for Non binary LDPC Codes With High-Order Galois Fields - 2018

ABSTRACT:

Nonbinary low-density parity-check (NB-LDPC) codes outperform their binary counterparts in terms of error-correction performance. However, the drawback of NB-LDPC decoders is high complexity, particularly for the check node unit (CNU), and the complexity will increase considerably when increasing the Galois-field (GF) order. During this paper, a novel basic-set trellis min-max algorithm is proposed to greatly reduce not solely the CNU complexity however additionally the number of messages exchanged between the check node and therefore the variable node compared with previous studies, that is very economical for higher order GFs. Further, the proposed CNU is meant to compute the messages in a parallel way. Layered decoder architectures primarily based on the proposed algorithm were implemented for the (837, 726) NB-LDPC code over GF(thirty two) and also the (1512, 1323) code over GF(64) using 90-nm CMOS technology, and obtained a discount within the complexity by thirtyp.c and 37percent for the CNU, and 40percent and thirty seven.fourpercent for the whole decoder, respectively. Moreover, the proposed decoder achieves a higher throughput at 1.67 Gbit/s and one.4 Gbit/s compared with the other state-of-the-art high-rate NB-LDPC decoders with high-order GFs.