2018
DOI: 10.5194/ars-16-43-2018
|View full text |Cite
|
Sign up to set email alerts
|

Polar Code decoder exploration framework

Abstract: Abstract. The increasing demand for fast wireless communications requires sophisticated baseband signal processing. One of the computational intense tasks here is advanced Forward Error Correction (FEC), especially the decoding. Finding efficient hardware implementations for sophisticated FEC decoding algorithms that fulfill throughput demands under strict implementation constraints is an active research topic due to increasing throughput, low latency, and high energy efficiency requirements. This paper focuse… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…A modular framework for generating and evaluating highthroughput Polar code decoders is presented in [243], where soft cancellation algorithms are explored. Achieving a Tbpsthroughput with Polar codes is also addressed in [244], where low-latency majority logic and low-complexity successive cancellation are combined for decoding, alongside an adaptive quantization scheme for log-likelihood-ratios (LLRs).…”
Section: B Channel Codingmentioning
confidence: 99%
“…A modular framework for generating and evaluating highthroughput Polar code decoders is presented in [243], where soft cancellation algorithms are explored. Achieving a Tbpsthroughput with Polar codes is also addressed in [244], where low-latency majority logic and low-complexity successive cancellation are combined for decoding, alongside an adaptive quantization scheme for log-likelihood-ratios (LLRs).…”
Section: B Channel Codingmentioning
confidence: 99%
“…This scheme involves transforming a set of independent and identically distributed (iid) bit channels into channels with varying error rates, leveraging their polarizing properties. Due to their highperformance capabilities, these codes are increasingly recognized as promising candidates for data transmission in emerging 6G networks [24], [25].…”
Section: Polar Codesmentioning
confidence: 99%
“…However, the modified-SCAN decoder can process the SCL decoder's output, which allows them to work together to deliver the best of both worlds, as mentioned in Section I. Similar to other polar decoders [23], the proposed G-SCAN polar decoder core can be operated on the basis of the same factor graph that is used in the polar encoder core, which is exemplified in Figure 3a for the case of N = 8. In general, a factor graph comprises N n 2 unit factor graphs and N n nodes where N = 2 n , with each unit factor graph being connected to four nodes.…”
Section: A Proposed G-scan Polar Decoder Algorithmmentioning
confidence: 99%
“…Similarly, the modified-SCAN decoder used in the second step of the G-SCAN algorithm adopts the same schedule as the conventional SCAN algorithm, which is also based on the SC algorithm. More specifically, the SC algorithm can be represented as detailed in [23], where a binary tree having n layers and N = 2 n leaf nodes, there are 2(2N − 2) node-visits. This schedule of visiting the nodes is exemplified on a factor graph in Figure 3b, where the steps of the modified-SCAN algorithm are indicated by the step indices in brackets for the case of N = 8.…”
Section: A Proposed G-scan Polar Decoder Algorithmmentioning
confidence: 99%