Bidirectional stack decoding of polar codes

Introduction/purpose: The paper introduces a reduced latency stack decoding algorithm of polar codes, inspired by the bidirectional stack decoding of convolutional codes and based on the folding technique. Methods: The stack decoding algorithm (also known as stack search) that is useful for deco...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Aleksandar Đ. Minja, Dušan P. Dobromirov, Vojin I. Šenk
Formato:	article
Lenguaje:	EN
Publicado:	University of Defence in Belgrade 2021
Materias:	polar codes successive cancellation stack and list decoding folding Military Science U Engineering (General). Civil engineering (General) TA1-2040
Acceso en línea:	https://doaj.org/article/01509a1872b34d24a2a46d68cf935121
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:01509a1872b34d24a2a46d68cf935121
record_format	dspace
spelling	oai:doaj.org-article:01509a1872b34d24a2a46d68cf9351212021-12-02T15:57:33ZBidirectional stack decoding of polar codes10.5937/vojtehg69-298580042-84692217-4753https://doaj.org/article/01509a1872b34d24a2a46d68cf9351212021-04-01T00:00:00Zhttps://scindeks-clanci.ceon.rs/data/pdf/0042-8469/2021/0042-84692102405M.pdfhttps://doaj.org/toc/0042-8469https://doaj.org/toc/2217-4753Introduction/purpose: The paper introduces a reduced latency stack decoding algorithm of polar codes, inspired by the bidirectional stack decoding of convolutional codes and based on the folding technique. Methods: The stack decoding algorithm (also known as stack search) that is useful for decoding tree codes, the list decoding technique introduced by Peter Elias and the folding technique for polar codes which is used to reduce the latency of the decoding algorithm. The simulation was done using the Monte Carlo procedure. Results: A new polar code decoding algorithm, suitable for parallel implementation, is developed and the simulation results are presented. Conclusions: Polar codes are a class of capacity achieving codes that have been adopted as the main coding scheme for control channels in 5G New Radio. The main decoding algorithm for polar codes is the successive cancellation decoder. This algorithm performs well at large blocklengths with a low complexity, but has very low reliability at short and medium blocklengths. Several decoding algorithms have been proposed in order to improve the error correcting performance of polar codes. The successive cancellation list decoder, in conjunction with a cyclic redundancy check, provides very good error-correction performance, but at the cost of a high implementation complexity. The successive cancellation stack decoder provides similar error-correction performance at a lower complexity. Future machine-type and ultra reliable low latency communication applications require high-speed low latency decoding algorithms with good error correcting performance. In this paper, we propose a novel decoding algorithm, inspired by the bidirectional stack decoding of classical convolutional codes, with reduced latency that achieves similar performance as the classical successive cancellation list and successive cancellation stack decoding algorithms. The results are presented analytically and verified by simulation.Aleksandar Đ. MinjaDušan P. DobromirovVojin I. ŠenkUniversity of Defence in Belgradearticlepolar codessuccessive cancellationstack and list decodingfoldingMilitary ScienceUEngineering (General). Civil engineering (General)TA1-2040ENVojnotehnički Glasnik, Vol 69, Iss 2, Pp 405-425 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	polar codes successive cancellation stack and list decoding folding Military Science U Engineering (General). Civil engineering (General) TA1-2040
spellingShingle	polar codes successive cancellation stack and list decoding folding Military Science U Engineering (General). Civil engineering (General) TA1-2040 Aleksandar Đ. Minja Dušan P. Dobromirov Vojin I. Šenk Bidirectional stack decoding of polar codes
description	Introduction/purpose: The paper introduces a reduced latency stack decoding algorithm of polar codes, inspired by the bidirectional stack decoding of convolutional codes and based on the folding technique. Methods: The stack decoding algorithm (also known as stack search) that is useful for decoding tree codes, the list decoding technique introduced by Peter Elias and the folding technique for polar codes which is used to reduce the latency of the decoding algorithm. The simulation was done using the Monte Carlo procedure. Results: A new polar code decoding algorithm, suitable for parallel implementation, is developed and the simulation results are presented. Conclusions: Polar codes are a class of capacity achieving codes that have been adopted as the main coding scheme for control channels in 5G New Radio. The main decoding algorithm for polar codes is the successive cancellation decoder. This algorithm performs well at large blocklengths with a low complexity, but has very low reliability at short and medium blocklengths. Several decoding algorithms have been proposed in order to improve the error correcting performance of polar codes. The successive cancellation list decoder, in conjunction with a cyclic redundancy check, provides very good error-correction performance, but at the cost of a high implementation complexity. The successive cancellation stack decoder provides similar error-correction performance at a lower complexity. Future machine-type and ultra reliable low latency communication applications require high-speed low latency decoding algorithms with good error correcting performance. In this paper, we propose a novel decoding algorithm, inspired by the bidirectional stack decoding of classical convolutional codes, with reduced latency that achieves similar performance as the classical successive cancellation list and successive cancellation stack decoding algorithms. The results are presented analytically and verified by simulation.
format	article
author	Aleksandar Đ. Minja Dušan P. Dobromirov Vojin I. Šenk
author_facet	Aleksandar Đ. Minja Dušan P. Dobromirov Vojin I. Šenk
author_sort	Aleksandar Đ. Minja
title	Bidirectional stack decoding of polar codes
title_short	Bidirectional stack decoding of polar codes
title_full	Bidirectional stack decoding of polar codes
title_fullStr	Bidirectional stack decoding of polar codes
title_full_unstemmed	Bidirectional stack decoding of polar codes
title_sort	bidirectional stack decoding of polar codes
publisher	University of Defence in Belgrade
publishDate	2021
url	https://doaj.org/article/01509a1872b34d24a2a46d68cf935121
work_keys_str_mv	AT aleksandarđminja bidirectionalstackdecodingofpolarcodes AT dusanpdobromirov bidirectionalstackdecodingofpolarcodes AT vojinisenk bidirectionalstackdecodingofpolarcodes
_version_	1718385309597564928

Bidirectional stack decoding of polar codes

Ejemplares similares