20222022 IEEE 33rd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)Requires access

An Improved Stage-Combined Belief Propagation Decoding of Polar Codes

Alireza Hasani, Łukasz Łopaciński, Miloš Krstić, Eckhard Grass

Open publisher page 3 citations

Abstract

Belief Propagation (BP) algorithm is an alternative decoding method to Successive Cancellation (SC) decoding of polar codes with an advantage of higher throughput and lesser latency. BP algorithm is performed over the factor graph of a polar code, and its throughput is oppositely proportional to the number of stages of the factor graph. The stage-combining idea can be applied to the factor graph of a polar code to halve the number of stages, and thus to double the decoding throughput. By this idea, every two adjacent stages of a factor graph are combined and processed in a single step. In this paper, we propose a modified stage-combined BP decoding method that is able to improve the Bit-Error Rate (BER) performance of the decoding algorithm. This improvement is almost 0.5 dB at low to intermediate SNRs, and much more considerable at high SNRs, since the undesired phenomenon of error floor is mitigated as a result of the proposed stage-combining mechanism.

About this research paper

What this paper is about

Belief Propagation (BP) algorithm is an alternative decoding method to Successive Cancellation (SC) decoding of polar codes with an advantage of higher throughput and lesser latency. BP algorithm is performed over the factor graph of a polar code, and its throughput is oppositely proportional to the number of stages of the factor graph. The stage-combining idea can be applied to the factor graph of a polar code to halve the number of stages, and thus to double the decoding throughput. By this idea, every two adjacent stages of a factor graph are combined and processed in a single step. In this paper, we propose a modified stage-combined BP decoding method that is able to improve the Bit-Error Rate (BER) performance of the decoding algorithm. This improvement is almost 0.5 dB at low to intermediate SNRs, and much more considerable at high SNRs, since the undesired phenomenon of error floor is mitigated as a result of the proposed stage-combining mechanism.

Why it matters

OpenAlex reports 3 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

Belief Propagation (BP) algorithm is an alternative decoding method to Successive Cancellation (SC) decoding of polar codes with an advantage of higher throughput and lesser latency. BP algorithm is performed over the factor graph of a polar code, and its throughput is oppositely proportional to the number of stages of the factor graph. The stage-combining idea can be applied to the factor graph of a polar code to halve the number of stages, and thus to double the decoding throughput. By this idea, every two adjacent stages of a factor graph are combined and processed in a single step. In this paper, we propose a modified stage-combined BP decoding method that is able to improve the Bit-Error Rate (BER) performance of the decoding algorithm. This improvement is almost 0.5 dB at low to intermediate SNRs, and much more considerable at high SNRs, since the undesired phenomenon of error floor is mitigated as a result of the proposed stage-combining mechanism.

Key concepts: Factor graph, Decoding methods, Belief propagation, Polar, Computer science, Algorithm, Sequential decoding, Throughput

Related papers

Back to paper searchBrowse research topicsOriginal source