|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'500'096
Articles rated: 2609
19 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Algorithm and Architecture for Path Metric Aided Bit-Flipping Decoding of Polar Codes | | Yu Wang
; Lirui Chen
; Qinglin Wang
; Yang Zhang
; Zuocheng Xing
; | | Date: |
8 Mar 2019 | | 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 when there are more
than one erroneous decisions in a codeword. In this paper, we propose a path
metric aided bit-flipping decoding algorithm to identify and correct more
errors efficiently. In this algorithm, the bit-flipping list is generated based
on both log likelihood ratio (LLR) based path metric and bit-flipping metric.
The path metric is used to verify the effectiveness of bit-flipping. In order
to reduce the decoding latency and computational complexity, its corresponding
pipeline architecture is designed. By applying these decoding algorithms and
pipeline architecture, an improvement on error-correction performance can be
got up to 0.25dB compared with SCF decoding at the frame error rate of
$10^{-4}$, with low average decoding latency. | | Source: | arXiv, 1903.3381 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER