Partitioned Successive-Cancellation List Decoding Of Polar Codes
Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results. In this paper, a partitioned SCL algorithm is proposed to reduce the large memory requirements of the conventional SCL algorithm. The decoder tree is broken into partitions that are decoded separately. We show that with careful selection of list sizes and number of partitions, the proposed algorithm can outperform conventional SCL while requiring less memory.
WOS:000388373401019
2016
978-1-4799-9988-0
New York
4
International Conference on Acoustics Speech and Signal Processing ICASSP
957
960
REVIEWED
Event name | Event place | Event date |
Shanghai, PEOPLES R CHINA | MAR 20-25, 2016 | |