{"title":"Hardware Implementation of Improved Fast-SSC-Flip Decoder for Polar Codes","authors":"Jing Zeng, Yangcan Zhou, Jun Lin, Zhongfeng Wang","doi":"10.1109/ISVLSI.2019.00109","DOIUrl":null,"url":null,"abstract":"Polar code has gained worldwide recognition due to its capacity-achieving property. The fast simplified successive cancellation flip (Fast-SSC-Flip) algorithm improves the frame error rate (FER) performance of successive cancellation (SC) decoders with extra metric computations. However, the metric includes exponential operations, which is inefficient to implement. In this work, one shift operation and one addition are employed to approximate the exponential operations with negligible performance loss. Besides, the metric computations of more constituent codes (Type-I to Type-V) are derived that the complexity of Fast-SSC-Flip is further reduced. Simulation results show that the FER performance of the improved Fast-SSC-Flip algorithm with list size λ = 8 outperforms that of the Fast-SSC algorithm by 0.7dB. Moreover, based on the proposed algorithm, an efficient hardware architecture is first developed. It uses less look up tables and achieves a maximum throughput of 140.6 Mbps at high SNR on the Altera Stratix IV EP4SGX530KH40C2 FPGA. Compared with the state of art Fast-SSC implementation, the proposed architecture has a higher resource utilization efficiency (throughput per look-up tables). Under the 28 nm CMOS technology, the throughput can reach up to 483.8 Mbps at a clock frequency of 704 MHz.","PeriodicalId":6703,"journal":{"name":"2019 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","volume":"88 1","pages":"580-585"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVLSI.2019.00109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
Polar code has gained worldwide recognition due to its capacity-achieving property. The fast simplified successive cancellation flip (Fast-SSC-Flip) algorithm improves the frame error rate (FER) performance of successive cancellation (SC) decoders with extra metric computations. However, the metric includes exponential operations, which is inefficient to implement. In this work, one shift operation and one addition are employed to approximate the exponential operations with negligible performance loss. Besides, the metric computations of more constituent codes (Type-I to Type-V) are derived that the complexity of Fast-SSC-Flip is further reduced. Simulation results show that the FER performance of the improved Fast-SSC-Flip algorithm with list size λ = 8 outperforms that of the Fast-SSC algorithm by 0.7dB. Moreover, based on the proposed algorithm, an efficient hardware architecture is first developed. It uses less look up tables and achieves a maximum throughput of 140.6 Mbps at high SNR on the Altera Stratix IV EP4SGX530KH40C2 FPGA. Compared with the state of art Fast-SSC implementation, the proposed architecture has a higher resource utilization efficiency (throughput per look-up tables). Under the 28 nm CMOS technology, the throughput can reach up to 483.8 Mbps at a clock frequency of 704 MHz.