ScholarLens Back to search
2013•Computer and Information TechnologyRequires access

A Compromise LDPC Code Decoding Algorithm between Performance and Complexity

Yinglu Wang

Open publisher page 0 citations

Abstract

This paper is according to the IEEE802.16e communication standard of LDPC codes,based on soft decision decoding algorithm of LDPC codes as LLR BP.Aslo combined with the minimum of LDPC codes and hard decision decoding,an improved BP decoding algorithm is proposed.Under the same condition of SNR,the new BP algorithm's decoding performance is very close to the LLR BP algorithm's,and its complexity is lower.And the new BP algorithm improves the realizability of project.

About this research paper

What this paper is about

This paper is according to the IEEE802.16e communication standard of LDPC codes,based on soft decision decoding algorithm of LDPC codes as LLR BP.Aslo combined with the minimum of LDPC codes and hard decision decoding,an improved BP decoding algorithm is proposed.Under the same condition of SNR,the new BP algorithm's decoding performance is very close to the LLR BP algorithm's,and its complexity is lower.And the new BP algorithm improves the realizability of project.

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

This paper is according to the IEEE802.16e communication standard of LDPC codes,based on soft decision decoding algorithm of LDPC codes as LLR BP.Aslo combined with the minimum of LDPC codes and hard decision decoding,an improved BP decoding algorithm is proposed.Under the same condition of SNR,the new BP algorithm's decoding performance is very close to the LLR BP algorithm's,and its complexity is lower.And the new BP algorithm improves the realizability of project.

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

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Compromise LDPC Code Decoding Algorithm between Performance and Complexity — Research Paper | ScholarLens