2015 IEEE Global Communications Conference (GLOBECOM) 2014
DOI: 10.1109/glocom.2014.7417316
|View full text |Cite
|
Sign up to set email alerts
|

XJ-BP: Express Journey Belief Propagation Decoding for Polar Codes

Abstract: This paper presents a novel belief propagation (BP) based decoding algorithm for polar codes. The proposed algorithm facilitates belief propagation by utilizing the specific constituent codes that exist in the factor graph, which results in an express journey (XJ) for belief information to propagate in each decoding iteration. In addition, this XJ-BP decoder employs a novel round-trip message passing scheduling method for the increased efficiency. The proposed method simplifies min-sum (MS) BP decoder by 40.6%… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 19 publications
(26 citation statements)
references
References 12 publications
0
26
0
Order By: Relevance
“…x 3 2) Right-to-left propagation: The L-messages are updated starting from the rightmost stage (i.e., the stage of channel information) until reaching the leftmost stage. The output from two nodes becomes the input to a specific neighboring processing element (PE) (for more details we refer to [15]). One PE updates the Land R-messages as follows [15]:…”
Section: Polar Codesmentioning
confidence: 99%
“…x 3 2) Right-to-left propagation: The L-messages are updated starting from the rightmost stage (i.e., the stage of channel information) until reaching the leftmost stage. The output from two nodes becomes the input to a specific neighboring processing element (PE) (for more details we refer to [15]). One PE updates the Land R-messages as follows [15]:…”
Section: Polar Codesmentioning
confidence: 99%
“…For the proposed concatenated LDPC-Polar code, round-trip scheduling [11] is employed. For the extended factor graph shown in Fig.…”
Section: Scheduling Scheme For Concatenated Ldpc-polar Codementioning
confidence: 99%
“…where L (û i ) and L (x i ) are the LLRs of the estimated message and the estimated transmitted codeword, respectively [14], [15], [16].…”
Section: Belief Propagation Decoder Of Polar Codesmentioning
confidence: 99%