2009
DOI: 10.1109/lcomm.2009.090428
|View full text |Cite
|
Sign up to set email alerts
|

Performance of Polar Codes with the Construction using Density Evolution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
221
0
3

Year Published

2012
2012
2023
2023

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 392 publications
(228 citation statements)
references
References 3 publications
1
221
0
3
Order By: Relevance
“…In [14], each step of SC is regarded as a BP decoding, where a decoding process of ith bit is regarded as a depthn tree. Furthermore, the decoding tree is characterized by the binary expansion b n · · · b 1 of (i − 1), such that nodes at depth-t of the decoding tree are check nodes and variable nodes if b t = 0 and b t = 1, respectively.…”
Section: Successive-cancellation (Sc) Decodingmentioning
confidence: 99%
See 1 more Smart Citation
“…In [14], each step of SC is regarded as a BP decoding, where a decoding process of ith bit is regarded as a depthn tree. Furthermore, the decoding tree is characterized by the binary expansion b n · · · b 1 of (i − 1), such that nodes at depth-t of the decoding tree are check nodes and variable nodes if b t = 0 and b t = 1, respectively.…”
Section: Successive-cancellation (Sc) Decodingmentioning
confidence: 99%
“…Density evolution (DE) is an important analytical tool for graph codes with message-passing decoding algorithms. The DE for polar codes based on the message passing in SC decoding graph is proposed in [14], which provides a preferable guidance to construct polar codes for obtaining better performance. In the process of the code construction, the selection of an information set is a key factor that impacts the performance of polar codes.…”
Section: Introductionmentioning
confidence: 99%
“…To prove (9), we focus on the second bit channel W ≤ I W (1) However, ambiguity remains about whether (9) and (10) are true based on this relation and (11), since there are no additional conditions on the qualities of transmit channels W (i) , i ∈ [1, N] that make them order with measures of the symmetric capacity I(·) or the Bhattacharyya parameter Z(·). Now, we can consider three necessary conditions for (9) and (10) to be true: (1) I W (1) …”
Section: Evolution Of Symmetric Capacitiesmentioning
confidence: 99%
“…To date, much of the work has addressed several theoretical aspects of polar codes and is aimed at improving the error correction performance of polar codes of moderate lengths [2][3][4][5][6][7]. However, few publications have reported implementation of polar decoders.…”
Section: Introductionmentioning
confidence: 99%