A cyclic redundancy check aided encoding construction method for list sphere polar decoder

Polar codes are the only error-correcting codes that have been mathematically proven to achieve the Shannon limit to date, playing a crucial role in the control channels of 5G mobile communication systems. For control channels, although the sphere decoding (SD) algorithm boasts excellent performance...

Full description

Saved in:
Bibliographic Details
Published in:Scientific reports Vol. 15; no. 1; pp. 30848 - 15
Main Authors: Hu, Wenbin, Chen, Haiqiang, Wang, Rui, Guo, Qinhua, Dang, Shuping, Sun, Youming, Li, Xiangcheng
Format: Journal Article
Language:English
Published: London Nature Publishing Group UK 22.08.2025
Nature Publishing Group
Nature Portfolio
Subjects:
639/166/987
639/766/259
Algorithms
Channel coding
Codes
Coding theory
Communications systems
Construction
Data transmission
Delayed decoding
Humanities and Social Sciences
Latency
LSD algorithm
Mathematical analysis
multidisciplinary
Polar codes
Science
Science (multidisciplinary)
SD algorithm
LSD algorithm
Delayed decoding
Polar codes
Channel coding
SD algorithm
ISSN:2045-2322, 2045-2322
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Polar codes are the only error-correcting codes that have been mathematically proven to achieve the Shannon limit to date, playing a crucial role in the control channels of 5G mobile communication systems. For control channels, although the sphere decoding (SD) algorithm boasts excellent performance, its high computational complexity and significant latency present clear limitations in practical applications. In contrast, the list sphere decoding (LSD) algorithm strikes a balance between performance and complexity. This paper proposes a construction method that delays the decoding of specific information bits with the minimum row weight to mitigate the impact of error propagation. For scenarios where the total number of delay-decodable bits is limited, we introduce a segmented construction strategy. Through mathematical analysis, this strategy effectively increases the number of delay-decodable bits, thereby significantly reducing the impact of error propagation without changing the number of transmitted bits. Simulation results show that the decoding performance of the proposed algorithm is comparable to that of the SD algorithm at medium and low code rates (with a difference of less than 0.2 dB), but it abandons the concept of search radius in the SD algorithm and does not require a backtracking process. Furthermore, under high code rate conditions, such as P (32, 20), the proposed algorithm also maintains excellent performance.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2045-2322
2045-2322
DOI:10.1038/s41598-025-15936-3