An Optimized Belief Propagation List Decoding for Polar Codes with Dynamic Flipping.

Saved in:

Bibliographic Details
Title:	An Optimized Belief Propagation List Decoding for Polar Codes with Dynamic Flipping.
Authors:	MAO, Yinyou¹, TAN, Wenxue¹, LI, Jianying², NI, Lin³ nilin@sina.com
Source:	Technical Gazette / Tehnički Vjesnik. 2026, Vol. 33 Issue 2, p817-827. 11p.
Subjects:	Decoding algorithms, Computational complexity, Fault diagnosis, Error-correcting codes
Abstract:	In the context of polar codes, belief propagation list (BPL) decoding has demonstrated a substantial enhancement in parallel decoding performance, achieving high throughput. Nevertheless, a performance gap still exists between the advanced BPL decoding and successive cancellation list (SCL) decoding methods. Moreover, existing bit-flipping strategies are inefficient in accurately identifying erroneous bit positions, leading to elevated computational complexity and limiting their practical applicability. This study introduces an optimized BPL decoding algorithm with dynamic flipping (OBPL-DF) aimed at bridging this performance gap while reducing computational demands. Initially, an efficient decoding scheme is proposed to further decrease computational complexity in practical scenarios. Subsequently, to improve the precision of error position detection, a partial cyclic redundancy check (CRC) code is employed on erroneous codewords. Finally, a dynamic flipping metric is developed within the bit-flipping strategy, allowing the selection of flipped positions to be guided by this novel metric rather than being confined to a predetermined set. Simulation results demonstrate that the OBPL-DF algorithm surpasses the performance of existing BPL flip (BPLF) decoding techniques and approaches that of enhanced SCL decoding, all while achieving significantly lower latency. [ABSTRACT FROM AUTHOR]
	Copyright of Technical Gazette / Tehnički Vjesnik is the property of Tehnicki Vjesnik and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	In the context of polar codes, belief propagation list (BPL) decoding has demonstrated a substantial enhancement in parallel decoding performance, achieving high throughput. Nevertheless, a performance gap still exists between the advanced BPL decoding and successive cancellation list (SCL) decoding methods. Moreover, existing bit-flipping strategies are inefficient in accurately identifying erroneous bit positions, leading to elevated computational complexity and limiting their practical applicability. This study introduces an optimized BPL decoding algorithm with dynamic flipping (OBPL-DF) aimed at bridging this performance gap while reducing computational demands. Initially, an efficient decoding scheme is proposed to further decrease computational complexity in practical scenarios. Subsequently, to improve the precision of error position detection, a partial cyclic redundancy check (CRC) code is employed on erroneous codewords. Finally, a dynamic flipping metric is developed within the bit-flipping strategy, allowing the selection of flipped positions to be guided by this novel metric rather than being confined to a predetermined set. Simulation results demonstrate that the OBPL-DF algorithm surpasses the performance of existing BPL flip (BPLF) decoding techniques and approaches that of enhanced SCL decoding, all while achieving significantly lower latency. [ABSTRACT FROM AUTHOR]
ISSN:	13303651
DOI:	10.17559/TV-20250903002940