Paper Info
Title
Efficient Pruning for Successive-Cancellation Decoding of Polar Codes.
Abstract
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 tradit...
Year
DOI
Venue
2016
10.1109/LCOMM.2016.2607167
IEEE Communications Letters
Keywords
Field
DocType
Maximum likelihood decoding,Parity check codes,Noise measurement,Indexes
Sequential decoding,Berlekamp–Welch algorithm,Computer science,Algorithm,Real-time computing,Polar,Decoding methods,List decoding,Recursion,Pruning,Computation
Journal
Volume
Issue
ISSN
20
12
1089-7798
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Hoyoung Yoo1759.99
In-Cheol Park2888124.36