Low-cost layer-based early termination scheme for LDPC decoding

Miroslav Marinkovic, Eckhard Grass, Milos D. Krstic

Huiming Dai, Qiangze Chi, Hao Yan +2 more

Ho-Il Kim

Yuan‐Syun Wu, Cheng-Hung Dixson Lin, Shu-Yen Lin

Energy consumption is a major issue for LDPC decoding. To save LDPC iterative process energy, early terminations are commonly used. Traditional parity check equation is used but has a growing complexity as the block size increases. This requires a large overhead in term of area. This paper proposes an ultra-low complexity early termination (ET) scheme with a small loss of bit error rate performance based on the layer stopping (LS) criterion. The proposed ET scheme is performed by checking the number of convergent layers stopped by the LS criterion with a preset threshold. Compared with other ET schemes, the proposed ET scheme has a negligible hardware overhead and an acceptable bit error rate performance.

Hao Wu, Fang Wang, Yuqing Yuan

In order to avoid unnecessary computation and increase system throughput, various early termination schemes are adopted in quasi-cyclic low-density parity-check (QC-LDPC) decoders. Cyclic redundancy check (CRC) based early termination scheme can be used when the information bits are concatenated with the CRC. The CRC is usually checked at the end of an iteration to verify the integrity of information bits. The latency of the CRC calculation results in an unnecessary decoding process. In this paper, we propose a distributed CRC early termination scheme for high throughput QC-LDPC codes. The proposed scheme distributes the CRC calculation in each layer of the iteration to minimize unnecessary computation and increase system throughput.

Francesco Beatrice