.png){kind=icon}
.png){kind=icon}
Return
Fast Block Sequential Decoding of Polar Codes
.png){kind=icon}
OA
AI
DOI：10.1109/TVT.2020.3006369.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A reduced complexity sequential decoding algorithm for polar (sub) codes is described. The proposed approach relies on a decomposition of the polar (sub) code being decoded into a number of outer codes, and on-demand construction of codewords of these codes in the descending order of their probability. Construction of such codewords is implemented by fast decoding algorithms, which are available for many codes arising in the decomposition of polar codes. Further complexity reduction is achieved by taking hard decisions of the intermediate LLRs, and avoiding decoding of some outer codes. Data structures for sequential decoding of polar codes are described. The proposed algorithm can be also used for decoding of polar codes with CRC and short extended BCH codes. It has lower average decoding complexity compared with the existing decoding algorithms for the corresponding codes.
Keywords:
Polar codes
polar subcodes
sequential decoding
Plotkin construction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W
View more organizations