.png){kind=icon}
.png){kind=icon}
Return
Stochastic Belief Propagation Polar Decoding With Efficient Re-Randomization
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2020.2979610.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Polar codes, the first class of codes achieving the capacity of symmetric binary-input discrete memoryless channels (B-DMCs), have drawn intensive attentions. For speed-insensitive applications, such as implantable devices, there is a good need on complexity and robustness. In this article, stochastic computing is introduced to allieviate the contradiction between complexity and performance for polar decoders. We proposed a stochastic belief propagation (BP) polar decoder and corresponding novel approaches to improve its decoding performance. Based on the understanding of stochastic computing correlation (SCC) in polar coding, the efficient stage-wise re-randomization scheme and its implementation are proposed and carefully analyzed. Hardware architectural optimizations and corresponding ASIC implementation are also given and demonstrate advantages over the state-of-the-art.
Keywords:
Decoding
Iterative decoding
Complexity theory
Hardware
Correlation
Belief propagation
Computer architecture
Polar codes
belief propagation
stochastic computing
stage-wise re-randomization
hardware implementation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W