Hardware Implementation of Successive-Cancellation Decoders for Polar Codes

Authors:
Camille Leroux;Alexandre J. Raymond;Gabi Sarkis;Ido Tal;Alexander Vardy;Warren J. Gross
Affiliations:
Institut Polytechnique de Bordeaux, Bordeaux, France;McGill University, Montreal, Canada H3A 0E9;McGill University, Montreal, Canada H3A 0E9;University of California San Diego, La Jolla, USA;University of California San Diego, La Jolla, USA;McGill University, Montreal, Canada H3A 0E9
Venue:
Journal of Signal Processing Systems
Year:
2012

Citing 3
Cited 0

Information Theory and Reliable Communication

Information Theory and Reliable Communication
Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels

IEEE Transactions on Information Theory
Performance of polar codes for channel and source coding

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3

Quantified Score

Hi-index	0.00

Visualization

Abstract

The recently-discovered polar codes are seen as a major breakthrough in coding theory; they provably achieve the theoretical capacity of discrete memoryless channels using the low-complexity successive cancellation decoding algorithm. Motivated by recent developments in polar coding theory, we propose a family of efficient hardware implementations for successive cancellation (SC) polar decoders. We show that such decoders can be implemented with O(N) processing elements and O(N) memory elements. Furthermore, we show that SC decoding can be implemented in the logarithmic domain, thereby eliminating costly multiplication and division operations, and reducing the complexity of each processing element greatly. We also present a detailed architecture for an SC decoder and provide logic synthesis results confirming the linear complexity growth of the decoder as the code length increases.