ScholarLens Back to search
2010•Computer Engineering and Applications JournalRequires access

Concatenation decoding algorithm based on BP and WED

PI De-fu

Open publisher page 0 citations

Abstract

Weighted Erasure Decoding(WED) algorithm is investigated in this paper,based on which,a new BP-WED concatenation algorithm for LDPC codes is proposed.Belief Propagation(BP) algorithm is a kind of soft-in-soft-out algorithm.When BP algorithm fails,the soft LLR reliable information is quantized and sent to the WED algorithm.WED algorithm is a very attractive solution for practical implementations of low-complexity reliability-based algorithms owing to its simplicity,therefore the BP-WED concatenation algorithm is more easy in hardware implementation compared to other concatenation algorithms,such as BP-OSD,BP-BMA,etc.The simulation results show that the proposed concatenation algorithm is effective,and can achieve a good tradeoff between computational complexity and decoding performance.

About this research paper

What this paper is about

Weighted Erasure Decoding(WED) algorithm is investigated in this paper,based on which,a new BP-WED concatenation algorithm for LDPC codes is proposed.Belief Propagation(BP) algorithm is a kind of soft-in-soft-out algorithm.When BP algorithm fails,the soft LLR reliable information is quantized and sent to the WED algorithm.WED algorithm is a very attractive solution for practical implementations of low-complexity reliability-based algorithms owing to its simplicity,therefore the BP-WED concatenation algorithm is more easy in hardware implementation compared to other concatenation algorithms,such as BP-OSD,BP-BMA,etc.The simulation results show that the proposed concatenation algorithm is effective,and can achieve a good tradeoff between computational complexity and decoding performance.

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

Weighted Erasure Decoding(WED) algorithm is investigated in this paper,based on which,a new BP-WED concatenation algorithm for LDPC codes is proposed.Belief Propagation(BP) algorithm is a kind of soft-in-soft-out algorithm.When BP algorithm fails,the soft LLR reliable information is quantized and sent to the WED algorithm.WED algorithm is a very attractive solution for practical implementations of low-complexity reliability-based algorithms owing to its simplicity,therefore the BP-WED concatenation algorithm is more easy in hardware implementation compared to other concatenation algorithms,such as BP-OSD,BP-BMA,etc.The simulation results show that the proposed concatenation algorithm is effective,and can achieve a good tradeoff between computational complexity and decoding performance.

Key concepts: Concatenation (mathematics), Algorithm, Computer science, Decoding methods, Computational complexity theory, Reliability (semiconductor), Mathematics, Arithmetic

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Concatenation decoding algorithm based on BP and WED — Research Paper | ScholarLens