Row-Merged Polar Codes: Analysis, Design and Decoder Implementation

Row-merged polar codes are a family of pre-transformed polar codes (PTPCs) with little precoding overhead. Providing an improved distance spectrum over plain polar codes, they are capable to perform close to the finite-length capacity bounds. However, there is still a lack of efficient design proced...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2024-07, p.1-1
Main Authors: Zunker, Andreas, Geiselhart, Marvin, Johannsen, Lucas, Kestel, Claus, Brink, Stephan ten, Vogt, Timo, Wehn, Norbert
Format: Article
Language:English
Subjects:
Codes
Hardware
Iron
Iterative decoding
Maximum likelihood decoding
PAC codes
Polar codes
Row-merged polar codes
SCL decoding
Transforms
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Row-merged polar codes are a family of pre-transformed polar codes (PTPCs) with little precoding overhead. Providing an improved distance spectrum over plain polar codes, they are capable to perform close to the finite-length capacity bounds. However, there is still a lack of efficient design procedures for row-merged polar codes. Using novel weight enumeration algorithms with low computational complexity, we propose a design methodology for row-merged polar codes that directly considers their minimum distance properties. The codes significantly outperform state-of-the-art cyclic redundancy check (CRC)-aided polar codes under successive cancellation list (SCL) decoding in error-correction performance. Furthermore, we present fast simplified successive cancellation list (Fast-SSCL) decoding of PTPCs, based on which we derive a high-throughput, unrolled architecture template for fully pipelined decoders. Implementation results of SCL decoders for row-merged polar codes in a 12nm technology additionally demonstrate the superiority of these codes with respect to the implementation costs, compared to state-of-the-art reference decoder implementations.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2024.3432688