Abstract

Polar codes are a new class of forward-error-correction codes, which have been proved asymptotically capacity-achieving for symmetric memoryless channels. Successive-cancellation (SC) decoders are low complexity while suffering from low speed due to their serial processing nature. Based on a newly published fast simplified SC algorithm, we propose a more efficient decoder than the prior art in this brief. Well-optimized components in the decoder core are developed. Additionally, several efficient approximate computing units (Apx-CUs) are introduced to substitute their accurate counterparts in the decoder to achieve even higher operating frequency. Field-programmable gate-array implementation results show that our design is about 1.5 times faster than the prior art, and the proposed Apx-CUs can bring an additional 19% processing speed.

Full Text
Paper version not known

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.