Efficient Network for Non-Binary QC-LDPC Decoder

2011/11/03 by Chuan Zhang, Zhang, Chuan, Keshab K. Parhi +1
Computer Science · #FOS: Computer and information sciences #Hardware Architecture (cs.AR) #cs.AR

paper · pdf · doi:10.48550/arxiv.1111.0703

arxiv created 2011/11/03 · arxiv updated 2011/11/04

Abstract

This paper presents approaches to develop efficient network for non-binary quasi-cyclic LDPC (QC-LDPC) decoders. By exploiting the intrinsic shifting and symmetry properties of the check matrices, significant reduction of memory size and routing complexity can be achieved. Two different efficient network architectures for Class-I and Class-II non-binary QC-LDPC decoders have been proposed, respectively. Comparison results have shown that for the code of the 64-ary (1260, 630) rate-0.5 Class-I code, the proposed scheme can save more than 70.6% hardware required by shuffle network than the state-of-the-art designs. The proposed decoder example for the 32-ary (992, 496) rate-0.5 Class-II code can achieve a 93.8% shuffle network reduction compared with the conventional ones. Meanwhile, based on the similarity of Class-I and Class-II codes, similar shuffle network is further developed to incorporate both classes of codes at a very low cost.

Related

• Memory Efficient Decoders using Spatially Coupled Quasi-Cyclic LDPC Codes
• Optimization of NB QC-LDPC Block Codes and Their Performance Analysis
• Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
• Strategies for High-Throughput FPGA-based QC-LDPC Decoder Architecture
• Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes