Name
Abstract | ||
|---|---|---|
Polar codes are a recently discovered family of capacity-achieving codes that are seen as a major breakthrough in coding theory. Motivated by the recent rapid progress in the theory of polar codes, we propose a semi-parallel architecture for the implementation of successive cancellation decoding. We take advantage of the recursive structure of polar codes to make efficient use of processing resources. The derived architecture has a very low processing complexity while the memory complexity remains similar to that of previous architectures. This drastic reduction in processing complexity allows very large polar code decoders to be implemented in hardware. An $N=2^{17}$ polar code successive cancellation decoder is implemented in an FPGA. We also report synthesis results for ASIC. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/TSP.2012.2223693 | IEEE Transactions on Signal Processing |
Keywords | Field | DocType |
application specific integrated circuits,codes,decoding,field programmable gate arrays,ASIC,FPGA,capacity-achieving codes,coding theory,polar codes,semi-parallel architecture,semi-parallel successive-cancellation decoder,successive cancellation decoding,very low processing complexity,Codes,FPGA,VLSI,decoding,polar codes,successive cancellation | Mathematical optimization,Concatenated error correction code,Computer science,Parallel computing,Block code,Field-programmable gate array,Theoretical computer science,Coding theory,Polar code,Linear code,Decoding methods,Very-large-scale integration | Journal |
Volume | Issue | ISSN |
61 | 2 | 1053-587X |
Citations | PageRank | References |
89 | 4.63 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Camille Leroux | 1 | 233 | 24.73 |
| Alexandre J. Raymond | 2 | 106 | 6.45 |
| Gabi Sarkis | 3 | 253 | 17.23 |
| Warren J. Gross | 4 | 1106 | 113.38 |