Bibliographic Details
| Title: |
Restart Mechanisms for the Successive-Cancellation List-Flip Decoding of Polar Codes. |
| Authors: |
Pillet, Charles1 (AUTHOR) ilshat.sagitov.1@ens.etsmtl.ca, Sagitov, Ilshat1,2 (AUTHOR), Balatsoukas-Stimming, Alexios1,2 (AUTHOR), Giard, Pascal1,2 (AUTHOR) pascal.giard@etsmtl.ca |
| Source: |
Entropy. Mar2025, Vol. 27 Issue 3, p309. 22p. |
| Subject Terms: |
*CYCLIC codes, *DECODING algorithms, *ENERGY consumption, *ALGORITHMS, *5G networks, *MEMORY |
| Abstract: |
Polar codes concatenated with a cyclic redundancy check (CRC) code have been selected in the 5G standard with the successive-cancellation list (SCL) of list size L = 8 as the baseline algorithm. Despite providing great error-correction performance, a large list size increases the hardware complexity of the SCL decoder. Alternatively, flip decoding algorithms were proposed to improve the error-correction performance with a low-complexity hardware implementation. The combination of list and flip algorithms, the successive-cancellation list flip (SCLF) and dynamic SCLF (DSCLF) algorithms, provides error-correction performance close to SCL-32 with a list size L = 2 and T max = 300 maximum additional trials. However, these decoders have a variable execution time, a characteristic that poses a challenge to some practical applications. In this work, we propose a restart mechanism for list–flip algorithms that allows us to skip parts of the decoding computations without affecting the error-correction performance. We show that the restart location cannot realistically be allowed to occur at any location in a codeword as it would lead to an unreasonable memory overhead under DSCLF. Hence, we propose a mechanism where the possible restart locations are limited to a set and propose various construction methods for that set. The construction methods are compared, and the tradeoffs are discussed. For a polar code of length N = 1024 and rate ¼, under DSCLF decoding with a list size L = 2 and a maximum number of trials T max = 300, our proposed approach is shown to reduce the average execution time by 41.7% with four restart locations at the cost of approximately 1.5% in memory overhead. [ABSTRACT FROM AUTHOR] |
|
Copyright of Entropy is the property of MDPI and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. 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: |
Academic Search Complete |
|
Full text is not displayed to guests. |
Login for full access.
|
