An Efficient Construction of Polarization-Adjusted Convolutional Codes
2023 (English)In: 2023 IEEE Globecom Workshops, GC Wkshps 2023, Institute of Electrical and Electronics Engineers (IEEE) , 2023, p. 1243-1248Conference paper, Published paper (Refereed)
Abstract [en]
Polarization-adjusted convolutional (PAC) codes have been demonstrated as a significant breakthrough close to the dispersion bound approximation. However, the above superiority is achieved in the context of a configuration of specific code rate thus far, which limits the flexibility in real use. Against this backdrop, this paper introduces a new code construction under the union upper bound (UUB) in accordance with the Hamming weight spectrum. What's more, we combine such construction with Reed-Muller (RM) design rule by efficiently selecting bit-channels on the basis of Hamming distance. Finally, we demonstrate the performance improvement compared to its conventional PAC counterparts.
Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2023. p. 1243-1248
Keywords [en]
Hamming weight spectrum, list decoding, Polarization-adjusted convolutional codes, union upper bound
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-350257DOI: 10.1109/GCWkshps58843.2023.10464959Scopus ID: 2-s2.0-85190240924OAI: oai:DiVA.org:kth-350257DiVA, id: diva2:1883423
Conference
2023 IEEE Globecom Workshops, GC Wkshps 2023, Kuala Lumpur, Malaysia, Dec 4 2023 - Dec 8 2023
Note
Part of ISBN 9798350370218
QC 20240710
2024-07-102024-07-102024-07-10Bibliographically approved