International Conference Mixed Design of Integrated Circuits and Systems

Analysis and implementation of on-the-fly stopping criteria for layered QC LDPC decoders

Andrei Hera, Oana Boncalo, Constantina‐Elena Gavriliu, Alexandru Amaricăi, Valentin Savin, David Declercq, Fakhreddine Ghaffari

Published Jun 1, 2015• 4 citations

Publisher

Abstract

This paper presents an analysis of existing stopping criteria for layered architecture used for quasi-cyclic (QC) LDPC decoders. Furthermore, it proposes a novel imprecise method for early termination in layered decoders. The analysis is performed under the same framework in order to provide a fair and accurate comparison between existing methods, and our new solution. The developed hardware modules have been designed independently from the decoder architecture, with the only constraint that the decoder scheduling is layered. Synthesis estimates for Xilinx Virtex-7 devices and the decoding performance analysis indicate that the new stopping criterion presents the best cost/performance trade-off for most of the considered LDPC codes.

DOI: 10.1109/mixdes.2015.7208528

Related papers

An Imprecise Stopping Criterion Based on In-Between Layers Partial Syndromes

David Declercq, Valentin Savin, Oana Boncalo +1 more

In this letter, we address the issue of early stopping criterion for layered LDPC decoders, aiming at more safeness with low hardware cost and minimum latency. We introduce a new on-the-fly measure in the decoder, called in-between layers partial syndrome, and define a family of stopping criteria, with different tradeoffs among complexity, latency, and performance. Numerical results show that our stopping criteria surpass existing solutions, and can be as safe as the full-syndrome detection, down to frame error rates (FERs) as low as FER = 10-8.

IEEE Communications LettersJun 22, 20176 citations

Decoding of Quasi-cyclic LDPC Codes Using an On-the-Fly Computation

Kiran Gunnam, Gwan Choi, Weihuang Wang +2 more

The implementation complexity of the decoder for low-density parity-check codes (LDPC) is dictated by memory and interconnect requirements. We propose new LDPC decoder architectures that reduce the need of message passing memory by 80% (for standard message passing)-55%(for layered decoding) and the router requirements by more than 50%. These novel architectures are based on scheduling of computation that results in "on the fly computation" of variable node and check node reliability messages. These architectures are targeted for quasi- cyclic LDPC codes such as array LDPC codes (regular QC-LDPC) and block LDPC codes (irregular QC-LDPC). FPGA and ASIC implementation results show substantial gains when compared to the existing work in the literature.

Asilomar Conference on Signals, Systems and Computers (ACSSC)Jan 1, 200626 citations

Modified layered message passing decoding with dynamic scheduling and early termination for QC-LDPC codes

Yeong-Luh Ueng, Yu-Lun Wang, Chi-Yu Lin +2 more

The convergence speed of layered message-passing decoding (LMPD) is faster than that of standard two phase message passing (TPMP) decoding. We propose to use dynamic scheduling and early termination to reduce computational complexity for a modified LMPD algorithm which was proposed for quasi-cyclic low-density parity-check (QC-LDPC) codes. We dynamically skip or redo the decoding operations for some layers based on appropriate criteria. An early termination strategy which is efficient in hardware implementation is also proposed in this paper. The modified MPD using these two techniques simultaneously can reduce the computational complexity with similar error performance as compared to the case of not using these two techniques.

IEEE International Symposium on Circuits and Systems proceedingsMay 1, 20099 citations

A New Early Termination Strategy for QC-LDPC Codes Based on the Layered Message Passing Decoding

Zhejun Zhang, Guanghui He, Jun Ma

Low-density parity-check (LDPC) codes are one of the most popular linear block codes have ever been used in the communication system.The standard two-phase message passing decoding (TPMPD) algorithm and the layered message-passing decoding (LMPD) algorithm are widely used in LDPC decoder.However, the convergence speed of LMPD algorithm is much faster than that of TPMPD algorithm, particularly in the condition of high signal noise ratio (SNR).In this paper, we propose an early termination criterion for quasi-cyclic low-density parity-check (QC-LDPC) codes based on LMPD algorithm with fast convergence speed.The strategy is to dynamically reprocesses the uncorrected related layers while skipping the corrected ones.Simulations show that 3% reduction in terms of iteration numbers can be achieved with no performance loss compared to the traditional termination strategies, such as hard decision aided (HDA) strategy and parity check equations (PCE) strategy.Furthermore, the optimized early termination strategy achieves low complexity in hardware implementation.

Advances in intelligent systems research/Advances in Intelligent Systems ResearchJan 1, 20131 citation

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) SystemsJan 1, 2007155 citations

Safe Early Stopping for Layered LDPC Decoding

Marco Ferrari, S. Bellini, Alessandro Tomasoni

In this letter, we address the problem of early stopping of iterative decoding of LDPC codes, driven by criteria ensuring that no errors occur from premature termination. A safe termination strategy developed for Turbo codes is generalized to layered LDPC decoding. Then, a more efficient version and also two less efficient, but less complex, criteria are proposed.

IEEE Communications LettersDec 30, 201415 citations