2017
DOI: 10.1587/transfun.e100.a.2052
|View full text |Cite
|
Sign up to set email alerts
|

Reduced-Complexity Belief Propagation Decoding for Polar Codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…In the factor graph of the IC-LDPC Polar codes with length N = 2 n , the polar code part has n + 1 stages, and each stage has N nodes, and (i, j) represents the jth node in stage i. The basic computational blocks (BCBs) [36] of the polar code are shown in figure 4(a). When N, there are n × N/2 BCBs, and each BCB is connected to four nodes.…”
Section: Encoding and Decoding For Ic-ldpc Polar Codes In Reconciliat...mentioning
confidence: 99%
“…In the factor graph of the IC-LDPC Polar codes with length N = 2 n , the polar code part has n + 1 stages, and each stage has N nodes, and (i, j) represents the jth node in stage i. The basic computational blocks (BCBs) [36] of the polar code are shown in figure 4(a). When N, there are n × N/2 BCBs, and each BCB is connected to four nodes.…”
Section: Encoding and Decoding For Ic-ldpc Polar Codes In Reconciliat...mentioning
confidence: 99%