.png){kind=icon}
.png){kind=icon}
Return
Efficient Sphere Polar Decoding via Synchronous Determination
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2020.2986915.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sphere polar decoding can achieve the maximum likelihood (ML) bound. Existing sphere polar decoding ignores that the Euclidean distance of the frozen bits can be determined at earlier decoding levels. In this article, efficient sphere polar decoding is proposed to reduce the complexity. The set-by-set decoding process via synchronous determination is applied to the sphere polar decoding with fixed lower bounds and its multiple-searches version. Numeric results show the proposed decoding reducesmuch complexity on the low-rate codes compared with the existing sphere decoding while maintaining the same performance. At high signal-to-noise ratios, the latency of the proposed decoding is comparable with the successive cancellation list decoding.
Keywords:
Maximum likelihood decoding
Complexity theory
Signal to noise ratio
Silicon
Euclidean distance
Mobile communication
Polar codes
sphere decoding
synchronous determination
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