Sorry, you need to enable JavaScript to visit this website.

Partitioned Successive-Cancellation List Decoding of Polar Codes

Citation Author(s):
Seyyed Ali Hashemi, Alexios Balatsoukas-Stimming, Pascal Giard, Claude Thibeault, Warren J. Gross
Submitted by:
Seyyed Ali Hashemi
Last updated:
23 March 2016 - 8:20pm
Document Type:
Research Manuscript
Document Year:
2016
Event:
Presenters:
Seyyed Ali Hashemi
Paper Code:
DISPS-L1.1
 

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.

up
0 users have voted: