20222022 IEEE Globecom Workshops (GC Wkshps)Requires access

On the Message Passing Efficiency of Polar and Low-Density Parity-Check Decoders

Dawei Yin, Yuan Liy, Xianbin Wang, Jiajie Tong, Huazi Zhang, Jun Wang, Guanghui Wang, Guiying Yan, Zhi-Ming Ma

Open publisher page 6 citations

Abstract

This study focuses on the efficiency of message-passing-based decoding algorithms for polar and low-density parity-check (LDPC) codes. Both successive cancellation (SC) and belief propagation (BP) decoding algorithms are studied under the message-passing framework. Counter-intuitively, SC decoding demonstrates the highest decoding efficiency although it was considered a weak decoder regarding error-correction performance. We analyze the complexity-performance tradeoff to dynamically track the decoding efficiency, where the complexity is measured by the number of messages passed (NMP), and the performance is measured by the statistical distance to the maximum a posteriori (MAP) estimate. This study offers new insight into the contribution of each message passing in decoding, and compares various decoding algorithms on a message-by-message level.

About this research paper

What this paper is about

This study focuses on the efficiency of message-passing-based decoding algorithms for polar and low-density parity-check (LDPC) codes. Both successive cancellation (SC) and belief propagation (BP) decoding algorithms are studied under the message-passing framework. Counter-intuitively, SC decoding demonstrates the highest decoding efficiency although it was considered a weak decoder regarding error-correction performance. We analyze the complexity-performance tradeoff to dynamically track the decoding efficiency, where the complexity is measured by the number of messages passed (NMP), and the performance is measured by the statistical distance to the maximum a posteriori (MAP) estimate. This study offers new insight into the contribution of each message passing in decoding, and compares various decoding algorithms on a message-by-message level.

Why it matters

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

This study focuses on the efficiency of message-passing-based decoding algorithms for polar and low-density parity-check (LDPC) codes. Both successive cancellation (SC) and belief propagation (BP) decoding algorithms are studied under the message-passing framework. Counter-intuitively, SC decoding demonstrates the highest decoding efficiency although it was considered a weak decoder regarding error-correction performance. We analyze the complexity-performance tradeoff to dynamically track the decoding efficiency, where the complexity is measured by the number of messages passed (NMP), and the performance is measured by the statistical distance to the maximum a posteriori (MAP) estimate. This study offers new insight into the contribution of each message passing in decoding, and compares various decoding algorithms on a message-by-message level.

Key concepts: Decoding methods, Message passing, Belief propagation, Computer science, Low-density parity-check code, List decoding, Algorithm, Maximum a posteriori estimation

Related papers

Back to paper searchBrowse research topicsOriginal source
On the Message Passing Efficiency of Polar and Low-Density Parity-Check Decoders — Research Paper | ScholarLens