Reduced Check Node Storage for Hardware-Efficient LDPC Decoder

Read full text
Authors: Bich Ngoc Tran-Thi, T. H. Le
Cited by: 0

Abstract

This paper proposes a hardware-and memoryefficient architecture for Low-Density Parity-Check (LDPC) decoding, targeting enhanced-performance applications with constrained resources.The design integrates two novel techniques: (i) the Variable Single minimum Min-Sum (VSMS) algorithm, which reduces hardware complexity by identifying the first minimum value and its position during check node processing, while improving error correction through a correction factor applied in variable node updates; and (ii) a memory splitting strategy that exploits the structural properties of LDPC codes to optimize memory usage.Implementation on a Xilinx Kintex UltraScale+ (xcku5p) FPGA demonstrates a reduction in storage requirements by over 46.2% compared to conventional decoders.Furthermore, the proposed decoder achieves a performance gain of up to 0.38 dB at a Bit Error Rate (BER) of 10⁻⁸, outperforming traditional Min-Sum-based approaches.

Fields of Study & Subjects

Error Correcting Code Techniques Coding theory and cryptography Quantum Computing Algorithms and Architecture

Publication details

Journal / source
Radioengineering
Volume
35
Issue
1
Pages
56–66
Publication date
28 January 2026
Language
EN