ScholarLens Back to search
2009•Unpublished venueRequires access

Improved layered min-sum decoding algorithm for low density parity check codes

Jin Xie, Liuguo Yin, Ning Ge, Jianhua Lü

Open publisher page 1 citations

Abstract

In this paper, an improved layered min-sum (ILMS) algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. The proposed method speeds up the decoding by slightly amplifying the message update from check node to variable node. Simulations and analytical results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce the number of iterations by 8.4%-62.6%, with hardware increase less than 2%.

About this research paper

What this paper is about

In this paper, an improved layered min-sum (ILMS) algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. The proposed method speeds up the decoding by slightly amplifying the message update from check node to variable node. Simulations and analytical results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce the number of iterations by 8.4%-62.6%, with hardware increase less than 2%.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, an improved layered min-sum (ILMS) algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. The proposed method speeds up the decoding by slightly amplifying the message update from check node to variable node. Simulations and analytical results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce the number of iterations by 8.4%-62.6%, with hardware increase less than 2%.

Key concepts: Decoding methods, Low-density parity-check code, Algorithm, Sequential decoding, Berlekamp–Welch algorithm, Computer science, Node (physics), List decoding

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Improved layered min-sum decoding algorithm for low density parity check codes — Research Paper | ScholarLens