Min-zone selection decoding algorithm for LDPC codes
Zhu Jin-kang
Abstract
Zhu Jin-kang
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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