Title :

Achieving PAC Code Performance with SCL Decoding without Extra Computational Complexity

Author(s) :

Gelincik, Samet [Auteur]
Institut d'Électronique et des Technologies du numéRique [IETR]
Mary, Philippe [Auteur]
Institut d'Électronique et des Technologies du numéRique [IETR]
Baudais, Jean-Yves [Auteur]
Institut d'Électronique et des Technologies du numéRique [IETR]
Savard, Anne [Auteur]
Circuits Systèmes Applications des Micro-ondes - IEMN [CSAM - IEMN ]
Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 [IEMN]
Centre for Digital Systems [CERI SN - IMT Nord Europe]

Conference title :

IEEE International Conference on Communications Workshops, ICC Workshops 2022

City :

Seoul

Country :

Corée du Sud

Start date of the conference :

2022-05-16

Journal title :

IEEE International Conference on Communications

English keyword(s) :

Polar Codes
dynamic frozen function
Reed-Muller codes
successive cancellation list decoding

HAL domain(s) :

Mathématiques [math]/Théorie de l'information et codage [math.IT]
Informatique [cs]/Théorie de l'information [cs.IT]

English abstract : [en]

For finite blocklength polar codes, the minimum distance and the number of low weight codewords are essential to obtain good performance under successive cancellation list decoding with moderate and high list sizes. In ...
Show more >For finite blocklength polar codes, the minimum distance and the number of low weight codewords are essential to obtain good performance under successive cancellation list decoding with moderate and high list sizes. In this paper, we propose a code design method to decrease the number of low weight codewords for some information lengths with a very low computational complexity. In the proposed method, some information bits are encoded by several rows of the polar encoding matrix, i.e., each of the dynamic frozen bits is chosen the same as one of the preceding information bits. The dynamic frozen bit index set is determined by using the connection between the binary representation of the row indices and the number of common 1-bit positions of any given rows. The resulting design is shown to perform as well as polarization-adjusted-convolutional codes [9] under successive cancellation list decoding but with significant computational complexity savings. These findings pave the way for the use of polar codes in applications with stringent complexity and with low energy consumption constraints.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

ANR Project :

Régions atteignables des communications sans fil multi-utilisateurs intermittentes

Collections :

• Institut d'Électronique, de Microélectronique et de Nanotechnologie (IEMN) - UMR 8520

Source :

Harvested from HAL