2019
DOI: 10.1109/tcsii.2018.2877140
|View full text |Cite
|
Sign up to set email alerts
|

High-Speed and Hardware-Efficient Successive Cancellation Polar-Decoder

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(11 citation statements)
references
References 11 publications
0
11
0
Order By: Relevance
“…As for the decoder with 20 cores, it is implemented with D input = 12 and D list = 1 to improve the throughput for the applications that only need to work at a high SNR regime. They both have 512 PEs and adopt the design proposed in [39] to improve the hardware efficiency. Compared with the decoder N core = 18, the critical path delay of the decoder with N core = 20 is longer, since its issue management needs more operations to prepare the unprocessed LLRs.…”
Section: Implementation Results Of the Proposed Architecturementioning
confidence: 99%
“…As for the decoder with 20 cores, it is implemented with D input = 12 and D list = 1 to improve the throughput for the applications that only need to work at a high SNR regime. They both have 512 PEs and adopt the design proposed in [39] to improve the hardware efficiency. Compared with the decoder N core = 18, the critical path delay of the decoder with N core = 20 is longer, since its issue management needs more operations to prepare the unprocessed LLRs.…”
Section: Implementation Results Of the Proposed Architecturementioning
confidence: 99%
“…Cross-layer calculation for LLRs requires multilevel serial (PEs) structure and memory rearrangement. The PE units use the low-latency architecture proposed in [25]. Fig.…”
Section: Cross-layer Strategy Based On Memory Rearrangementmentioning
confidence: 99%
“…Polar codes have drew signification attention due to the fact that they have low complexity successive-cancellation (SC) decoding algorithm and achieve the capacity of binary input memory-less symmetric-channels (BMC) [1]. However, the serial nature of SC lends to high latency and low throughput when implemented on hardware [2,3,5,25]. In order to address this issue, simplified SC (SSC), Fast-SSC, SSC with maximum-likelihood decoding (ML-SSC) and belief propagation (BP) algorithm were proposed in [7,8,9,10,11,12,13,14,15].…”
Section: Introductionmentioning
confidence: 99%
“…Shao et al, [2] Channel coding may be viewed as the bestinformed and most potent component of cellular communication systems, which is used for correcting the transmission errors inflicted by noise, interference and fading. R. Shrestha et al, [4] This brief presents an algorithm for the processing element (PE) of polar decoder based on 2's complement representation of logarithmic likelihood ratios. It simplifies computation and alleviates critical path delay of PE.…”
Section: Literature Surveymentioning
confidence: 99%