Fast Simplified Multi-Bit Successive-Cancellation List Decoding of Polar Codes and Implementation

2019 ◽  
Author(s):  
Xinjie Dong ◽  
Rongke Liu ◽  
Zijian Huang
Keyword(s):  
Polar Codes ◽  
List Decoding ◽  
Successive Cancellation

Hybrid Bucket Sorting Method for Successive Cancellation List Decoding of Polar Codes

2019 ◽  
Vol 23 (10) ◽  
pp. 1757-1760
Author(s):  
Jiahao Wang ◽  
Zhenyu Hu ◽  
Ning An ◽  
Dunfan Ye
Keyword(s):  
Polar Codes ◽  
List Decoding ◽  
Sorting Method ◽  
Successive Cancellation

Improved Metric Sorting for Successive Cancellation List Decoding of Polar Codes

2019 ◽  
pp. 1-1 ◽  
Author(s):  
Xiumin Wang ◽  
Ting Wang ◽  
Jun Li ◽  
Liang Shan ◽  
Haiyan Cao ◽  
...  
Keyword(s):  
Polar Codes ◽  
List Decoding ◽  
Successive Cancellation

Efficient metric sorting schemes for successive cancellation list decoding of polar codes

2017 ◽  
Author(s):  
Haochuan Song ◽  
Shunqing Zhang ◽  
Xiaohu You ◽  
Chuan Zhang
Keyword(s):  
Polar Codes ◽  
List Decoding ◽  
Successive Cancellation

scholarly journals Large-Small Sorting for Successive Cancellation List Decoding of Polar Codes

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 96955-96962
Author(s):  
Kyungpil Lee ◽  
In-Cheol Park
Keyword(s):  
Polar Codes ◽  
List Decoding ◽  
Successive Cancellation

scholarly journals Improved Adaptive Successive Cancellation List Decoding of Polar Codes

Entropy ◽  
2019 ◽  
Vol 21 (9) ◽  
pp. 899
Author(s):  
Xiumin Wang ◽  
Jinlong He ◽  
Jun Li ◽  
Zhuoting Wu ◽  
Liang Shan ◽  
...  
Keyword(s):  
Computational Complexity ◽  
Likelihood Ratio ◽  
Polar Codes ◽  
Correct Result ◽  
List Decoding ◽  
Successive Cancellation ◽  
Burst Error ◽  
Log Likelihood ◽  
Information Sequence ◽  
Simulation Results

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.

scholarly journals Optimized sorting network for successive cancellation list decoding of polar codes

2017 ◽  
Vol 14 (18) ◽  
pp. 20170735-20170735 ◽  
Author(s):  
Kun Wang ◽  
Li Li ◽  
Feng Han ◽  
Fan Feng ◽  
Jun Lin ◽  
...  
Keyword(s):  
Polar Codes ◽  
List Decoding ◽  
Sorting Network ◽  
Successive Cancellation

A Reused-Public-Path Successive Cancellation List Decoding for Polar Codes With CRC

2017 ◽  
Vol 21 (12) ◽  
pp. 2566-2569 ◽  
Author(s):  
Shibao Li ◽  
Lijin Lu ◽  
Yunqiang Deng ◽  
Jianhang Liu ◽  
Tingpei Huang
Keyword(s):  
Polar Codes ◽  
List Decoding ◽  
Successive Cancellation
Sign in / Sign up

Export Citation Format

Share Document