List Viterbi Decoding of PAC Codes

Polarization-adjusted convolutional (PAC) codes are special concatenated codes in which we employ a one-to-one convolutional transform as a pre-coding step before the polar transform. In this scheme, the polar transform (as a mapper) and the successive cancellation process (as a demapper) present a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on vehicular technology Jg. 70; H. 3; S. 2428 - 2435
Hauptverfasser: Rowshan, Mohammad, Viterbo, Emanuele
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.03.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Complexity
Concatenated codes
Convolutional codes
Error correction
List decoding
Maximum likelihood decoding
path metric sorting
Picture archiving and communication systems
Polar codes
polarization-adjusted convolutional codes
Sorting
Transforms
Viterbi algorithm
Viterbi algorithm detectors
Viterbi decoding
ISSN:0018-9545, 1939-9359
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Polarization-adjusted convolutional (PAC) codes are special concatenated codes in which we employ a one-to-one convolutional transform as a pre-coding step before the polar transform. In this scheme, the polar transform (as a mapper) and the successive cancellation process (as a demapper) present a synthetic vector channel to the convolutional transformation. The numerical results show that this concatenation improves the Hamming distance properties of polar codes. Motivated by the fact that the parallel list Viterbi algorithm (LVA) sorts the candidate paths locally at each trellis node, in this work, we adapt the trellis, path metric, and the local sorter of LVA to PAC codes and show how the error correction performance moves from the poor performance of the Viterbi algorithm (VA) to the superior performance of list decoding by changing the constraint length, list size, and the sorting strategy (local sorting and global sorting) in the LVA. Also, we analyze the complexity of the local sorting of the paths in LVA relative to the global sorting in the list decoding and we show that LVA has a significantly lower sorting complexity compared with list decoding.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2021.3059370