Fast list decoders for polar codes

Sarkis, Gabi, Giard, Pascal, Vardy, Alexander, Thibeault, Claude et Gross, Warren J.. 2016. « Fast list decoders for polar codes ». IEEE Journal on Selected Areas in Communications, vol. 34, nº 2. pp. 318-328.
Compte des citations dans Scopus : 130.

Prévisualisation

PDF Fast-List-Decoders-for-Polar-Codes.pdf Télécharger (1MB) | Prévisualisation

Résumé

Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern codes such as low-density parity-check (LDPC) codes. Of the many methods to improve the error-correction performance of polar codes, list decoding yields the best results, especially when the polar code is concatenated with a cyclic redundancy check (CRC). List decoding involves exploring several decoding paths with SC decoding, and therefore tends to be slower than SC decoding itself, by an order of magnitude in practical implementations. In this paper, we present a new algorithm based on unrolling the decoding tree of the code that improves the speed of list decoding by an order of magnitude when implemented in software. Furthermore, we show that for software-defined radio applications, our proposed algorithm is faster than the fastest software implementations of LDPC decoders in the literature while offering comparable error-correction performance at similar or shorter code lengths.

Type de document:	Article publié dans une revue, révisé par les pairs
Professeur:	Professeur Giard, Pascal Thibeault, Claude
Affiliation:	Autres, Génie électrique
Date de dépôt:	03 févr. 2016 17:23
Dernière modification:	30 nov. 2018 16:33
URI:	https://espace2.etsmtl.ca/id/eprint/12221

Actions (Authentification requise)

Dernière vérification avant le dépôt