QSN: a simple circular-shift network for reconfigurable quasi-cyclic LDPC decoders

Authors:
Xiaoheng Chen;Shu Lin;Venkatesh Akella
Affiliations:
Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA
Venue:
IEEE Transactions on Circuits and Systems II: Express Briefs
Year:
2010

Citing 7
Cited 1

Reconfigurable Shuffle Network Design in LDPC Decoders

ASAP '06 Proceedings of the IEEE 17th International Conference on Application-specific Systems, Architectures and Processors
Configurable LDPC Decoder Architectures for Regular and Irregular Codes

Journal of Signal Processing Systems
Optimal overlapped message passing decoding of quasi-cyclic LDPC codes

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Efficient shuffle network architecture and application for WiMAX LDPC decoders

IEEE Transactions on Circuits and Systems II: Express Briefs
Design of a multimode QC-LDPC decoder based on shift-routing network

IEEE Transactions on Circuits and Systems II: Express Briefs
Low-complexity switch network for reconfigurable LDPC decoders

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach

IEEE Transactions on Information Theory

An area efficient LDPC decoder using a reduced complexity min-sum algorithm

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

There is an increasing need for configurable quasi-cyclic low-density parity-check (QC-LDPC) decoders that can support a family of structurally compatible codes instead of a single code. The key component in a configurable QC-LDPC decoder is a programmable circular-shift network that supports cyclic shifts of any size up to a predefined maximum submatrix size. This paper presents a QC-LDPC shift network (QSN), which has two key advantages over state-of-the-art solutions in recent literature. First, the QSN reduces the number of stages in the critical path, which improves the clock frequency and makes it scalable, particularly in a field-programmable gate array (FPGA)-based implementation where an interconnect delay is dominant. Second, the QSN's control logic is simple to generate and occupies a significantly smaller area. The QSNs for a variety of codes suitable for emerging applications are implemented, targeting both a 180-nm Taiwan Semiconductor Manufacturing Company Ltd. complimentary metal-oxide-semiconductor library and a Xilinx Virtex 4 FPGA. The proposed implementation is shown to be 2.1 times faster than the best known implementation in literature and requires almost eight times less control area. Furthermore, this paper presents analytical models of the critical-path and datapath complexity for arbitrary-sized submatrices and proves that the QSN indeed generates all the output combinations required for implementing reconfigurable QC-LDPC decoders.