Improved Successive-Cancellation Decoding of Polar Codes Based on Recursive Syndrome Decomposition

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 148
  • Download : 0
In this letter an improved method for the successive-cancellation decoding of polar codes is proposed. To avoid computations associated with redundant tree-traversals and syndrome calculations, recursive properties of polar codes are newly exploited in the proposed algorithm. Instead of computing a syndrome vector at every node, some syndrome vectors are directly obtained by recursively decomposing the syndrome vector computed previously. Furthermore, a modified syndrome check rule is proposed to prune unnecessary sub-trees efficiently. Compared with the latest pruning method, the proposed method reduces the latency by 23% for a (2048, 1024) polar code without sacrificing the error-correcting performance.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2017-11
Language
English
Article Type
Article
Keywords

DECODERS

Citation

IEEE COMMUNICATIONS LETTERS, v.21, no.11, pp.2344 - 2347

ISSN
1089-7798
DOI
10.1109/LCOMM.2017.2730860
URI
http://hdl.handle.net/10203/228524
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0