.png){kind=icon}
.png){kind=icon}
Return
A Fast Polar Code List Decoder Architecture Based on Sphere Decoding
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSI.2016.2619324.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Polar codes are a recently discovered family of capacity-achieving error-correcting codes. Among the proposed decoding algorithms, successive-cancellation list decoding guarantees the best error-correction performance with codes of moderate lengths, but it yields low throughput. Speed-up techniques have been proposed in the past: most of them rely on approximations that degrade the error-correction capability of the algorithm. We propose a speed-up technique for successive-cancellation list decoding of polar codes that is exact for list size of 2, while its approximations bring negligible error-correction performance degradation (<0.05 dB) for other list sizes. A decoder architecture is designed: the proposed technique increases the throughput of a factor of 3.16x, at the cost of 14.2% in area occupation.
Keywords:
Hardware implementation
list decoding
polar codes
sphere decoding
successive-cancellation decoding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.2
Papers:
9.7K
Citations:
2.2W