Abstract

Abstract: Polar codes were introduced by E.Arıkan in 2008. They are the first family of error-correcting codes that attain the capacity of binary memoryless and symmetric channels with efficient encoding, decoding, and construction algorithms. In this paper, implementation of high speed and area efficient polar encoder for systematic polar codes is presented. According to an iterative property of the generator matrix and particular lower triangular structure of the matrix, the number of XOR computations are reduced. In this implementation, total area of the encoder is decreased by 33.69%, delay is decreased by 54.6% and power consumption is decreased by 39.44%.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.