Hardware Implementation of Successive Cancellation Decoders for Polar Codes

Computer Science – Hardware Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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 (SC) decoding algorithm. Motivated by recent developments in polar coding theory, we propose a family of efficient hardware implementations for SC polar decoders. We show that such decoders can be implemented with O(n) processing elements, O(n) memory elements, and can provide a constant throughput for a given target clock frequency. Furthermore, we show that SC decoding can be implemented in the logarithm 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 growth in complexity of the decoder as the code length increases.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Hardware Implementation of Successive Cancellation Decoders for 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 Implementation of Successive Cancellation Decoders for Polar Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hardware Implementation of Successive Cancellation Decoders for Polar Codes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-549522

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.