A Fast Successive Cancellation List Decoder for Polar Codes With an Early Stopping Criterion

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 73
  • Download : 0
The successive cancellation list (SCL) decoding is the most powerful decoding algorithm for polar codes. However, the long latency makes it unsuitable for practical applications, and thus many algorithms have been presented to resolve the problem. While most of the previous algorithms have reduced the latency by pruning unnecessary operations in the middle of the process, this paper proposes an early stopping criterion. The proposed method can determine the minimum metric path without having to traverse the tree to the end if a special condition is satisfied at a certain point. The remaining bits located after the stopped bit position are decoded directly from the soft information. The simulation results show that the criterion reduces the decoding latency effectively for various code rates and list sizes without any performance loss. We also propose a hardware architecture that is efficient in realizing the proposed method. Compared to previous SCL decoding algorithms, the proposed decoder achieves 16% higher throughput and 12% improved area efficiency at an SNR of 5.0 dB when the list size is 4.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2018-09
Language
English
Article Type
Article
Keywords

ARCHITECTURE

Citation

IEEE TRANSACTIONS ON SIGNAL PROCESSING, v.66, no.18, pp.4971 - 4979

ISSN
1053-587X
DOI
10.1109/TSP.2018.2864580
URI
http://hdl.handle.net/10203/245650
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0