Two-Step Metric Sorting for Parallel Successive Cancellation List Decoding of Polar Codes

被引:11
作者
Bioglio, Valerio [1 ]
Gabry, Frederic [1 ]
Godard, Loig [1 ]
Land, Ingmar [1 ]
机构
[1] Huawei Technol Co Ltd, France Res Ctr, Math & Algorithm Sci Lab, Boulogne, France
关键词
Polar codes; hardware decoding; list decoding; successive cancellation; sorting;
D O I
10.1109/LCOMM.2016.2632727
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In terms of overall latency, one of the main bottlenecks of successive cancellation list (SCL) decoding of polar codes is the path pruning unit (PPU), whose goal is to prune 2L paths to L paths. To remedy this shortcoming, we propose atwo- step metric sorter adapted to a parallel implementation of SCL decoding. We describe our sorter architecture and we show that our proposed solution outperforms the state-of-the-art PPUs in terms of area and latency reduction.
引用
收藏
页码:456 / 459
页数:4
相关论文
共 9 条
[1]  
Akl SG., 2014, PARALLEL SORTING ALG
[2]   Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels [J].
Arikan, Erdal .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3051-3073
[3]  
Balatsoukas-Stimming A., 2014, P IEEE INT C AC SPEE, P5165
[4]  
Balatsoukas-Stimming A, 2015, IEEE INT SYMP CIRC S, P1993, DOI 10.1109/ISCAS.2015.7169066
[5]  
Batcher K.E., 1968, P AFIPS SPRING JOINT, P307, DOI DOI 10.1145/1468075.1468121
[6]   PERT AS AN AID TO LOGIC DESIGN [J].
KIRKPATRICK, TI ;
CLARK, NR .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1966, 10 (02) :135-+
[7]   Efficient Sorting Architecture for Successive-Cancellation-List Decoding of Polar Codes [J].
Kong, Byeong Yong ;
Yoo, Hoyoung ;
Park, In-Cheol .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2016, 63 (07) :673-677
[8]   An Efficient List Decoder Architecture for Polar Codes [J].
Lin, Jun ;
Yan, Zhiyuan .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2015, 23 (11) :2508-2518
[9]   List Decoding of Polar Codes [J].
Tal, Ido ;
Vardy, Alexander .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (05) :2213-2226