2008Unpublished venueRequires access

Min-zone selection decoding algorithm for LDPC codes

Zhu Jin-kang

Open publisher page 0 citations

Abstract

An iterative decoding algorithm for low-density parity-check(LDPC) codes,named min-zone selection(MZS) decoding algorithm,was proposed.The methods of min-zone selecting and approximation were combined in the proposed decoding algorithm in order to deal with the Q(x) function involved in the traditional belief propagation(BP) decoding algorithm.Simulation results show shat the computations in the decoding process of LDPC codes incurred only a little performance degradation.In fact,it is observed that,with proper selection of parameters,the MZS decoding algorithm can provide performance comparable to that of the BP decoding algorithm.

About this research paper

What this paper is about

An iterative decoding algorithm for low-density parity-check(LDPC) codes,named min-zone selection(MZS) decoding algorithm,was proposed.The methods of min-zone selecting and approximation were combined in the proposed decoding algorithm in order to deal with the Q(x) function involved in the traditional belief propagation(BP) decoding algorithm.Simulation results show shat the computations in the decoding process of LDPC codes incurred only a little performance degradation.In fact,it is observed that,with proper selection of parameters,the MZS decoding algorithm can provide performance comparable to that of the BP decoding algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

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

An iterative decoding algorithm for low-density parity-check(LDPC) codes,named min-zone selection(MZS) decoding algorithm,was proposed.The methods of min-zone selecting and approximation were combined in the proposed decoding algorithm in order to deal with the Q(x) function involved in the traditional belief propagation(BP) decoding algorithm.Simulation results show shat the computations in the decoding process of LDPC codes incurred only a little performance degradation.In fact,it is observed that,with proper selection of parameters,the MZS decoding algorithm can provide performance comparable to that of the BP decoding algorithm.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Min-zone selection decoding algorithm for LDPC codes — Research Paper | ScholarLens