Computer Science – Hardware Architecture
Scientific paper
2010-11-12
Computer Science
Hardware Architecture
Submitted to ICASSP 2011
Scientific paper
The recently-discovered polar codes are widely seen as a major breakthrough in coding theory. These codes achieve the capacity of many important channels under successive cancellation decoding. Motivated by the rapid progress in the theory of polar codes, we propose a family of architectures for efficient hardware implementation of successive cancellation decoders. We show that such decoders can be implemented with O(n) processing elements and O(n) memory elements, while providing constant throughput. We also propose a technique for overlapping the decoding of several consecutive codewords, thereby achieving a significant speed-up factor. We furthermore show that successive cancellation decoding can be implemented in the logarithmic domain, thereby eliminating the multiplication and division operations and greatly reducing the complexity of each processing element.
Gross Warren J.
Leroux Camille
Tal Ido
Vardy Alexander
No associations
LandOfFree
Hardware architectures for Successive Cancellation Decoding of Polar Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Hardware architectures for Successive Cancellation Decoding of Polar Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hardware architectures for Successive Cancellation Decoding of Polar Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-204246