Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)

An LDPC decoder architecture for multi-rate QC-LDPC codes

Sung–Woo Choi, Gyung-Pyo Kim, Jinkyeong Kim

Published Aug 1, 2011• 3 citations
Publisher

Abstract

This paper presents a partially parallel LDPC decoder architecture for QC-LDPC codes. In particular, we introduce a check node processing element which is 3-parallel, adjustable to irregular inputs and easily expandable. Furthermore, our decoder is applicable to multi-rate system by simply writing additional data to internal RAM. In another aspect of our work, we can reduce the check-bit message memory significantly by efficient method. Implementation results show that the proposed architecture can support the data rate of 360Mbps in FPGA.

DOI
10.1109/mwscas.2011.6026376

Related papers

Area-Efficient Parallel Decoder Architecture for High Rate QC-LDPC Codes

Zhiqiang Cui, Zhongfeng Wang

In this paper, an area efficient partially parallel decoder architecture suited for (modified) min-sum decoding algorithm for general high rate quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed. To reduce the hardware complexity for parallel processing, an efficient data scheduling unit is presented. The optimized partially parallel decoder architecture can linearly increase the decoding throughput with small hardware overhead. Typically, over 30% of memory can be saved with the architecture presented in this paper. Consequently, the proposed approach facilitates the applications of LDPC codes in area/power sensitive high speed communication systems.

IEEE International Symposium on Circuits and Systems proceedings•Sep 22, 2006•15 citations

A Memory Efficient Partially Parallel Decoder Architecture for QC-LDPC Codes

Zhongfeng Wang, Zhiqiang Cui

In this paper, a memory efficient partially parallel decoder architecture suited for high rate quasi-cyclic low-density parity-check codes using (modified) min-sum decoding algorithm is proposed. In general, more than thirty percent of memory can be saved over conventional partially parallel decoder architectures. To reduce the computation delay of check-node processing unit, an efficient architecture based on variants of rank order filter is presented. The optimized partially parallel decoder architecture can linearly increase the decoding throughput with small hardware overhead. Consequently, the proposed approach facilitates the applications of LDPC codes in area/power sensitive high speed communication systems

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Mar 22, 2006•23 citations

Low-Complexity High-Speed Decoder Design for Quasi-Cyclic LDPC Codes

Zhongfeng Wang, Zhiqiang Cui

This paper studies low-complexity high-speed decoder architectures for quasi-cyclic low density parity check (QC-LDPC) codes. Algorithmic transformation and architectural level optimization are incorporated to reduce the critical path. Enhanced partially parallel decoding architectures are proposed to linearly increase the throughput of conventional partially parallel decoders through introducing a small percentage of extra hardware. Based on the proposed architectures, a (8176, 7154) Euclidian geometry-based QC-LDPC code decoder is implemented on Xilinx field programmable gate array (FPGA) Virtex-II 6000, where an efficient nonuniform quantization scheme is employed to reduce the size of memories storing soft messages. FPGA implementation results show that the proposed decoder can achieve a maximum (source data) decoding throughput of 172 Mb/s at 15 iterations

IEEE Transactions on Very Large Scale Integration (VLSI) Systems•Jan 1, 2007•154 citations

Efficient Highly-Parallel Decoder Architecture for Quasi-Cyclic Low-Density Parity-Check Codes

Daesun Oh, Keshab K. Parhi

In this paper, the authors propose an efficient highly-parallel decoder architecture using partially overlapped decoding scheme for quasi-cyclic (QC) low-density parity-check (LDPC) codes, which leads to reduction in hardware complexity and power consumption. Generally, due to the regularly structured parity-check matrix H of QC LDPC codes, the message updating computations in the check node unit (CNU) and the variable node unit (VNU) can be efficiently overlapped, which increases the decoding throughput by maximizing the hardware utilization efficiency (HUE). However, the partially overlapped decoding scheme cannot be used to design a highly-parallel decoding architecture for high-throughput applications. For (3, 5)-regular QC LDPC codes, our proposed method could reduce the hardware complexity by approximately 33% for the CNU and 20% for the VNU in the highly-parallel decoder architecture without any performance degradation. In addition, the power consumption can be minimized by reducing the total number of memory accesses for updated messages.

IEEE International Symposium on Circuits and Systems proceedings•May 1, 2007•15 citations

Implementation of QC-LDPC Code Decoder with High Performance

Lin Zhi-guo

A multi-rate decoder of Quasi-Cyclic LDPC(QC-LDPC) decoder is presented based on the improvement of layered decoding algorithm.The implementation has larger bit throughput resulting from fast convergence speed by more than 50 percent in terms of decoding iterations.Only four memories are used to store the messages which significantly reduce the area and the power dissipation.Adjusted integer quantization of layered decoding algorithm for check-node updating reduces the complexity and the correction factor guarantees the error rate performance.The proposed decoding architecture is implemented in the standard recommended.The decoder consumes 0.6 million gates,and reaches a throughput of 134 Mb/s at a clock frequency of 110 MHz with rate of 1/2.

•Jan 1, 2011•0 citations

Optimization of memory utilization for partially parallel QC-LDPC decoder

Tsung-Che Wu, Yaowen Hu, Chang‐Ming Lee

Quasi-cyclic (QC) low-density parity-check (LDPC) codes have advantages over other types of LDPC codes due to their cyclic shifting property. In this paper, a partially parallel QC-LDPC decoder with efficient memory design is proposed. To improve the memory utilization, the structures of efficient chunk and predictor are realized. The efficient chunk can store parts of check-to-variable messages. This design can effectively reduce the memory requirement. Furthermore, the predictor verifies variable-to-check messages and updates efficient chunks instantly. With less check-to-variable messages and variable-to-check messages stored in the memory, this decoding architecture only deposits few messages in several efficient chunks, such that the cost of memory is less. Eventually, the proposed approach dramatically reduces memory requirement about 65% compared to the traditional method while maintaining the same low-cost.

International Symposium on Information Theory and its Applications•Oct 1, 2010•3 citations
This paper presents a partially parallel LDPC decoder architecture for QC-LDPC codes. In particular, we introduce a check node processing element which is 3-parallel, adjustable to irregular inputs and easily expandable. Furthermore, our decoder is applicable to multi-rate system by simply writing additional data to internal RAM. In another aspect of our work, we can reduce the check-bit message memory significantly by efficient method. Implementation results show that the proposed architecture can support the data rate of 360Mbps in FPGA.
In this paper, an area efficient partially parallel decoder architecture suited for (modified) min-sum decoding algorithm for general high rate quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed. To reduce the hardware complexity for parallel processing, an efficient data scheduling unit is presented. The optimized partially parallel decoder architecture can linearly increase the decoding throughput with small hardware overhead. Typically, over 30% of memory can be saved with the architecture presented in this paper. Consequently, the proposed approach facilitates the applications of LDPC codes in area/power sensitive high speed communication systems.
In this paper, a memory efficient partially parallel decoder architecture suited for high rate quasi-cyclic low-density parity-check codes using (modified) min-sum decoding algorithm is proposed. In general, more than thirty percent of memory can be saved over conventional partially parallel decoder architectures. To reduce the computation delay of check-node processing unit, an efficient architecture based on variants of rank order filter is presented. The optimized partially parallel decoder architecture can linearly increase the decoding throughput with small hardware overhead. Consequently, the proposed approach facilitates the applications of LDPC codes in area/power sensitive high speed communication systems
This paper studies low-complexity high-speed decoder architectures for quasi-cyclic low density parity check (QC-LDPC) codes. Algorithmic transformation and architectural level optimization are incorporated to reduce the critical path. Enhanced partially parallel decoding architectures are proposed to linearly increase the throughput of conventional partially parallel decoders through introducing a small percentage of extra hardware. Based on the proposed architectures, a (8176, 7154) Euclidian geometry-based QC-LDPC code decoder is implemented on Xilinx field programmable gate array (FPGA) Virtex-II 6000, where an efficient nonuniform quantization scheme is employed to reduce the size of memories storing soft messages. FPGA implementation results show that the proposed decoder can achieve a maximum (source data) decoding throughput of 172 Mb/s at 15 iterations
In this paper, the authors propose an efficient highly-parallel decoder architecture using partially overlapped decoding scheme for quasi-cyclic (QC) low-density parity-check (LDPC) codes, which leads to reduction in hardware complexity and power consumption. Generally, due to the regularly structured parity-check matrix H of QC LDPC codes, the message updating computations in the check node unit (CNU) and the variable node unit (VNU) can be efficiently overlapped, which increases the decoding throughput by maximizing the hardware utilization efficiency (HUE). However, the partially overlapped decoding scheme cannot be used to design a highly-parallel decoding architecture for high-throughput applications. For (3, 5)-regular QC LDPC codes, our proposed method could reduce the hardware complexity by approximately 33% for the CNU and 20% for the VNU in the highly-parallel decoder architecture without any performance degradation. In addition, the power consumption can be minimized by reducing the total number of memory accesses for updated messages.
A multi-rate decoder of Quasi-Cyclic LDPC(QC-LDPC) decoder is presented based on the improvement of layered decoding algorithm.The implementation has larger bit throughput resulting from fast convergence speed by more than 50 percent in terms of decoding iterations.Only four memories are used to store the messages which significantly reduce the area and the power dissipation.Adjusted integer quantization of layered decoding algorithm for check-node updating reduces the complexity and the correction factor guarantees the error rate performance.The proposed decoding architecture is implemented in the standard recommended.The decoder consumes 0.6 million gates,and reaches a throughput of 134 Mb/s at a clock frequency of 110 MHz with rate of 1/2.
Quasi-cyclic (QC) low-density parity-check (LDPC) codes have advantages over other types of LDPC codes due to their cyclic shifting property. In this paper, a partially parallel QC-LDPC decoder with efficient memory design is proposed. To improve the memory utilization, the structures of efficient chunk and predictor are realized. The efficient chunk can store parts of check-to-variable messages. This design can effectively reduce the memory requirement. Furthermore, the predictor verifies variable-to-check messages and updates efficient chunks instantly. With less check-to-variable messages and variable-to-check messages stored in the memory, this decoding architecture only deposits few messages in several efficient chunks, such that the cost of memory is less. Eventually, the proposed approach dramatically reduces memory requirement about 65% compared to the traditional method while maintaining the same low-cost.