2017 IEEE 3rd Information Technology and Mechatronics Engineering Conference (ITOEC) 2017
DOI: 10.1109/itoec.2017.8122551
|View full text |Cite
|
Sign up to set email alerts
|

A comparative study of polar code decoding algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(13 citation statements)
references
References 11 publications
0
13
0
Order By: Relevance
“…For decoding part, we utilize the Log-MAP decoding algorithm and the maximum number of iteration I max = 7. The SCL decoder [22] having a block length of N = 128 is adopted for comparison purpose. Figure 5 (a) and (b) shows the BLER simulation results of the proposed scheme for the block length N = 64, and N = 256 for 3.75 kHz SCS, respectively.…”
Section: A Bler Simulation Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…For decoding part, we utilize the Log-MAP decoding algorithm and the maximum number of iteration I max = 7. The SCL decoder [22] having a block length of N = 128 is adopted for comparison purpose. Figure 5 (a) and (b) shows the BLER simulation results of the proposed scheme for the block length N = 64, and N = 256 for 3.75 kHz SCS, respectively.…”
Section: A Bler Simulation Analysismentioning
confidence: 99%
“…Polar codes were initially proposed by Arikan [18] based on the concept known as the channel polarization that theoretically achieved the capacity limit of the discrete-input memoryless channels (DMCs) with explicit construction approach. The decoding of polar codes are based on the successive cancellation (SC) [19]- [22] decoding algorithm which exhibits low complexity implementation but has a poor performance against LDPC and turbo codes, but still improving with other decoding algorithms. Similarly, the Belief propagation (BP) is another useful algorithm that improve the polar decoding performance [17], [23], [24].…”
Section: Introductionmentioning
confidence: 99%
“…For SNR 26 until 28 dB, information bits located in index k = [2,3,4,5,6,7,8,9]. For SNR 29 until 50 dB, information bits located in index k = [1,2,3,4,5,6,7,8].…”
Section: Bhattacharyya Parameters Analysismentioning
confidence: 99%
“…For SNR 23 until 25 dB, information bits located in index k = [4,6,7,8,10,11,12,13,14,15,16,18,19,20,21,22]. For SNR 26 until 28 dB, information bits located in index k = [2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17]. For SNR 29 until 50 dB, information bits located in index k = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16].…”
Section: Bhattacharyya Parameters Analysismentioning
confidence: 99%
See 1 more Smart Citation