Low-Complexity Construction of Polar Codes Based on Genetic Algorithm

How to efficiently rank the reliability order of the channels is critical for polar code construction. A new polar code construction framework tailored to a given decoding algorithm based on the genetic algorithm has been proposed to achieve an error correction performance gain. However, the time co...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2021-10, Vol.25 (10), p.3175-3179
Main Authors: Zhou, Huayi, Gross, Warren J., Zhang, Zaichen, You, Xiaohu, Zhang, Chuan
Format: Article
Language:English
Subjects:
code construction
Complexity
Decoding
Error correction
Error correction & detection
genetic algorithm
Genetic algorithms
Indexes
Polar codes
Sociology
Statistics
Time complexity
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:How to efficiently rank the reliability order of the channels is critical for polar code construction. A new polar code construction framework tailored to a given decoding algorithm based on the genetic algorithm has been proposed to achieve an error correction performance gain. However, the time complexity of this scheme is extremely high. In this letter, a scheme based on a hash table is proposed to generally reduce the computational complexity of the repeated candidates in the genetic algorithm-based system. A two-step method is proposed to improve the crossover process when the system has prior knowledge. It is shown from the numeric results that the proposed scheme achieves computational complexity reduction of the repeated candidates. An error correction performance gain is achieved over the original scheme under successive cancellation list decoding.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2021.3104092