Cargando…

Improved Adaptive Successive Cancellation List Decoding of Polar Codes

Although the adaptive successive cancellation list (AD-SCL) algorithm and the segmented-CRC adaptive successive cancellation list (SCAD-SCL) algorithm based on the cyclic redundancy check (CRC) can greatly reduce the computational complexity of the successive cancellation list (SCL) algorithm, these...

Descripción completa

Detalles Bibliográficos
Autores principales: Wang, Xiumin, He, Jinlong, Li, Jun, Wu, Zhuoting, Shan, Liang, Hong, Bo
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2019
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7515421/
http://dx.doi.org/10.3390/e21090899
_version_ 1783586814028677120
author Wang, Xiumin
He, Jinlong
Li, Jun
Wu, Zhuoting
Shan, Liang
Hong, Bo
author_facet Wang, Xiumin
He, Jinlong
Li, Jun
Wu, Zhuoting
Shan, Liang
Hong, Bo
author_sort Wang, Xiumin
collection PubMed
description Although the adaptive successive cancellation list (AD-SCL) algorithm and the segmented-CRC adaptive successive cancellation list (SCAD-SCL) algorithm based on the cyclic redundancy check (CRC) can greatly reduce the computational complexity of the successive cancellation list (SCL) algorithm, these two algorithms discard the previous decoding result and re-decode by increasing L, where L is the size of list. When CRC fails, these two algorithms waste useful information from the previous decoding. In this paper, a simplified adaptive successive cancellation list (SAD-SCL) is proposed. Before the re-decoding of updating value L each time, SAD-SCL uses the existing log likelihood ratio (LLR) information to locate the range of burst error bits, and then re-decoding starts at the incorrect bit with the smallest index in this range. Moreover, when the segmented information sequence cannot get the correct result of decoding, the SAD-SCL algorithm uses SC decoding to complete the decoding of the subsequent segmentation information sequence. Furthermore, its decoding performance is almost the same as that of the subsequent segmentation information sequence using the AD-SCL algorithm. The simulation results show that the SAD-SCL algorithm has lower computational complexity than AD-SCL and SCAD-SCL with negligible loss of performance.
format Online
Article
Text
id pubmed-7515421
institution National Center for Biotechnology Information
language English
publishDate 2019
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-75154212020-11-09 Improved Adaptive Successive Cancellation List Decoding of Polar Codes Wang, Xiumin He, Jinlong Li, Jun Wu, Zhuoting Shan, Liang Hong, Bo Entropy (Basel) Article Although the adaptive successive cancellation list (AD-SCL) algorithm and the segmented-CRC adaptive successive cancellation list (SCAD-SCL) algorithm based on the cyclic redundancy check (CRC) can greatly reduce the computational complexity of the successive cancellation list (SCL) algorithm, these two algorithms discard the previous decoding result and re-decode by increasing L, where L is the size of list. When CRC fails, these two algorithms waste useful information from the previous decoding. In this paper, a simplified adaptive successive cancellation list (SAD-SCL) is proposed. Before the re-decoding of updating value L each time, SAD-SCL uses the existing log likelihood ratio (LLR) information to locate the range of burst error bits, and then re-decoding starts at the incorrect bit with the smallest index in this range. Moreover, when the segmented information sequence cannot get the correct result of decoding, the SAD-SCL algorithm uses SC decoding to complete the decoding of the subsequent segmentation information sequence. Furthermore, its decoding performance is almost the same as that of the subsequent segmentation information sequence using the AD-SCL algorithm. The simulation results show that the SAD-SCL algorithm has lower computational complexity than AD-SCL and SCAD-SCL with negligible loss of performance. MDPI 2019-09-17 /pmc/articles/PMC7515421/ http://dx.doi.org/10.3390/e21090899 Text en © 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Wang, Xiumin
He, Jinlong
Li, Jun
Wu, Zhuoting
Shan, Liang
Hong, Bo
Improved Adaptive Successive Cancellation List Decoding of Polar Codes
title Improved Adaptive Successive Cancellation List Decoding of Polar Codes
title_full Improved Adaptive Successive Cancellation List Decoding of Polar Codes
title_fullStr Improved Adaptive Successive Cancellation List Decoding of Polar Codes
title_full_unstemmed Improved Adaptive Successive Cancellation List Decoding of Polar Codes
title_short Improved Adaptive Successive Cancellation List Decoding of Polar Codes
title_sort improved adaptive successive cancellation list decoding of polar codes
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7515421/
http://dx.doi.org/10.3390/e21090899
work_keys_str_mv AT wangxiumin improvedadaptivesuccessivecancellationlistdecodingofpolarcodes
AT hejinlong improvedadaptivesuccessivecancellationlistdecodingofpolarcodes
AT lijun improvedadaptivesuccessivecancellationlistdecodingofpolarcodes
AT wuzhuoting improvedadaptivesuccessivecancellationlistdecodingofpolarcodes
AT shanliang improvedadaptivesuccessivecancellationlistdecodingofpolarcodes
AT hongbo improvedadaptivesuccessivecancellationlistdecodingofpolarcodes