Fast Polar Decoders: Algorithm and Implementation

Abstract

Polar codes provably achieve the symmetric capacity of a memoryless channel while having an explicit construction. The adoption of polar codes however, has been hampered by the low throughput of their decoding algorithm. This work aims to increase the throughput of polar decoding hardware by an order of magnitude relative to successive-cancellation decoders and is more than 8 times faster than the current fastest polar decoder. We present an algorithm, architecture, and FPGA implementation of a flexible, gigabit-per-second polar decoder.

Other Versions

Version 2, 2013-07-26, preprints

This publication has 10 references indexed in Scilit:

A two phase successive cancellation decoder architecture for polar codes
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2013
Increasing the Throughput of Polar Decoders
IEEE Communications Letters, 2013
Fully-parallel LUT-based (2048,1723) LDPC code decoder for FPGA
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2012
A successive cancellation decoder ASIC for a 1024-bit polar code in 180nm CMOS
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2012
A Semi-Parallel Successive-Cancellation Decoder for Polar Codes
IEEE Transactions on Signal Processing, 2012
A Simplified Successive-Cancellation Decoder for Polar Codes
IEEE Communications Letters, 2011
Systematic Polar Coding
IEEE Communications Letters, 2011
On bit error rate performance of polar codes in finite regime
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2010
Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
IEEE Transactions on Information Theory, 2009
Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
IEEE Transactions on Information Theory, 1989

Cited by 277 articles