2019 IEEE Wireless Communications and Networking Conference (WCNC) 2019
DOI: 10.1109/wcnc.2019.8885419
|View full text |Cite
|
Sign up to set email alerts
|

Algorithm and Architecture for Path Metric Aided Bit-Flipping Decoding of Polar Codes

Abstract: Polar codes attract more and more attention of researchers in recent years, since its capacity achieving property. However, their error-correction performance under successive cancellation (SC) decoding is inferior to other modern channel codes at short or moderate blocklengths. SC-Flip (SCF) decoding algorithm shows higher performance than SC decoding by identifying possibly erroneous decisions made in initial SC decoding and flipping them in the sequential decoding attempts. However, it performs not well whe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 16 publications
(26 reference statements)
0
2
0
Order By: Relevance
“…Similar problems that occur in linear modulation have been addressed using LLR clipping [43]- [52], LLR scaling [53]- [56], bit flipping [57], [58], and LLR generation through machine learning [59]. Currently, the best method of solving this problem is to use machine learning to generate LLRs.…”
Section: Introductionmentioning
confidence: 99%
“…Similar problems that occur in linear modulation have been addressed using LLR clipping [43]- [52], LLR scaling [53]- [56], bit flipping [57], [58], and LLR generation through machine learning [59]. Currently, the best method of solving this problem is to use machine learning to generate LLRs.…”
Section: Introductionmentioning
confidence: 99%
“…In this work, we focus on improving the area efficiency of hybrid polar decoding by adopting a pipelined architecture, which is similar to our previous work [30]. Here, the main contributions of this work are summarized as follows:…”
Section: Introductionmentioning
confidence: 95%