Achieving PAC Code Performance with SCL ...
Type de document :
Communication dans un congrès avec actes
Titre :
Achieving PAC Code Performance with SCL Decoding without Extra Computational Complexity
Auteur(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]
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]
Titre de la manifestation scientifique :
IEEE International Conference on Communications Workshops, ICC Workshops 2022
Ville :
Seoul
Pays :
Corée du Sud
Date de début de la manifestation scientifique :
2022-05-16
Titre de la revue :
IEEE International Conference on Communications
Mot(s)-clé(s) en anglais :
Polar Codes
dynamic frozen function
Reed-Muller codes
successive cancellation list decoding
dynamic frozen function
Reed-Muller codes
successive cancellation list decoding
Discipline(s) HAL :
Mathématiques [math]/Théorie de l'information et codage [math.IT]
Informatique [cs]/Théorie de l'information [cs.IT]
Informatique [cs]/Théorie de l'information [cs.IT]
Résumé en anglais : [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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Source :
Fichiers
- https://hal.archives-ouvertes.fr/hal-03555629/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-03555629/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-03555629/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- GELI22.pdf
- Accès libre
- Accéder au document