Efficient Pruning for Successive-Cancellation Decoding of Polar Codes

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 293
  • Download : 0
This letter presents an efficient pruning method for the successive-cancellation (SC) decoding of polar codes. In the proposed method, unnecessary sub-trees are pruned if the syndrome check of a constituent code is satisfied. Without sacrificing the error-rate performance, the recursive operation associated with such a constituent code is replaced with simple computations. Compared with the traditional SC decoding, the proposed pruning decreases the decoding latency by 85% on the average for the polar (1024, 512) code.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2016-12
Language
English
Article Type
Article
Keywords

DECODERS

Citation

IEEE COMMUNICATIONS LETTERS, v.20, no.12, pp.2362 - 2365

ISSN
1089-7798
DOI
10.1109/LCOMM.2016.2607167
URI
http://hdl.handle.net/10203/218242
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 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0