.png){kind=icon}
.png){kind=icon}
Return
A Multi-Kernel Multi-Code Polar Decoder Architecture
.png){kind=icon}
OA
AI
DOI：10.1109/TCSI.2018.2855679.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Polar codes have received increasing attention in the past decade, and have been selected for the next generation of the wireless communication standard. Most research on polar codes has focused on codes constructed from a 2 x 2 polarization matrix, called binary kernel: codes constructed from binary kernels have code lengths that are bound to powers of 2. A few recent works have proposed construction methods based on multiple kernels of different dimensions, not only binary ones, allowing code lengths different from powers of 2. In this paper, we design and implement the first multi-kernel successive cancellation polar code decoder in literature. It can decode any code constructed with binary and ternary kernels: the architecture, sized for a maximum code length N-max, is fully flexible in terms of code length, code rate, and kernel sequence. The decoder can achieve a frequency of over 1 GHz in 65 nm CMOS technology, and a throughput of 615 Mb/s. The area occupation ranges between 0.11 mm(2) for N-max = 256 and 2.01 mm(2) for N-max = 4096. Implementation results show an unprecedented degree of flexibility: with N-max = 4096, up to 55 code lengths can be decoded with the same hardware, along with any kernel sequence and code rate.
Keywords:
Polar codes
multi-kernel
successive-cancellation decoding
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:
5.2
Papers:
9.7K
Citations:
2.2W