Title | ||
---|---|---|
Low Complexity Method For Channel-Dependent Construction Of Polar Codes Using Partial Order |
Abstract | ||
---|---|---|
In this paper, a novel low-complexity method for channel-dependent construction of polar codes is designed by exploiting the partial order (PO) relation to eliminate redundant computations. The proposed method selects the information set with a threshold, thus avoiding the reliability computation of unnecessary synthetic channels and the cost of sorting. We first introduce two key iterative strategies based on the PO relation of the synthetic channels. Then, we analyze the iteration process of the proposed method through a binary tree and a linear table structure and further derive the theoretical complexity of the proposed method. We validate the theoretical analysis through simulation results. Finally, considering the practical application, we propose a suboptimal simplified version of the proposed method to significantly reduce the complexity. Compared with the sorting method, the proposed simplified method needs only at most 10% of the comparison numbers in the process of the information set selection with negligible performance loss under the cyclic redundancy check-aided successive cancellation list decoding. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1109/ACCESS.2018.2879376 | IEEE ACCESS |
Keywords | Field | DocType |
Polar codes, code construction, partial order, low-complexity | Cyclic redundancy check,Computer science,Algorithm,Binary tree,Sorting,Decoding methods,Channel capacity,Reliability theory,Computational complexity theory,Computation,Distributed computing | Journal |
Volume | ISSN | Citations |
6 | 2169-3536 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Baoping Feng | 1 | 0 | 0.34 |
Rongke Liu | 2 | 127 | 35.79 |
Bin Dai | 3 | 4 | 4.48 |
Kuangda Tian | 4 | 7 | 2.81 |
He Sun | 5 | 79 | 14.18 |