Low-complex processing element architecture for successive cancellation decoder

被引:5
作者
Babu, Geethu Sathees [1 ]
Madala, Lakshmi Renuka [1 ]
Gopalakrishnan, Lakshminarayanan [1 ]
Sellathurai, Mathini [2 ]
机构
[1] Natl Inst Technol Tiruchirappalli, Dept Elect & Commun Engn, Tiruchirappalli, Tamil Nadu, India
[2] Heriot Watt Univ, Edinburgh EH14 4AS, Midlothian, Scotland
基金
英国工程与自然科学研究理事会;
关键词
ASIC; Polar codes; Processing element; Successive cancellation decoder; POLAR; CODES; DESIGN;
D O I
10.1016/j.vlsi.2019.01.005
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A low-complexity design architecture for implementing the Successive Cancellation (SC) decoding algorithm for polar codes is presented. Hardware design of polar decoders is accomplished using SC decoding due to the reduced intricacy of the algorithm. Merged processing element (MPE) block is the primary area occupying factor of the SC decoder as it incorporates numerous sign and magnitude conversions. Two's complement method is typically used in the MPE block of SC decoder. In this paper, a low-complex MPE architecture with minimal two's complement conversion is proposed. A reformulation is also applied to the merged processing elements at the final stage of SC decoder to generate two output bits at a time. The proposed merged processing element thereby reduces the hardware complexity of the SC decoder and also reduces latency by an average of 64%. An SC decoder with code length 1024 and code rate 1/2 was designed and synthesized using 45-nm CMOS technology. The implementation results of the proposed decoder display significant improvement in the Technology Scaled Normalized Throughput (TSNT) value and an average 48% reduction in hardware complexity compared to the prevalent SC decoder architectures. Compared to the conventional SC decoder, the presented method displayed a 23% reduction in area.
引用
收藏
页码:80 / 87
页数:8
相关论文
共 23 条
[1]   Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels [J].
Arikan, Erdal .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3051-3073
[2]  
Bohr M., 2007, IEEE Solid-State Circuits Soc. Newsl, V12, P11, DOI [DOI 10.1109/N-SSC.2007.4785534, DOI 10.1109/NSSC.2007.4785534, 10.1109/N-SSC.2007.4785534]
[3]  
Chuan Zhang, 2012, IEEE International Conference on Communications (ICC 2012), P3471, DOI 10.1109/ICC.2012.6364209
[4]   A High-Throughput Energy-Efficient Implementation of Successive Cancellation Decoder for Polar Codes Using Combinational Logic [J].
Dizdar, Onur ;
Arikan, Erdal .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2016, 63 (03) :436-447
[5]   An Efficient Partial-Sum Network Architecture for Semi-Parallel Polar Codes Decoder Implementation [J].
Fan, YouZhe ;
Tsui, Chi-ying .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2014, 62 (12) :3165-3179
[6]   POLARBEAR: A 28-nm FD-SOI ASIC for Decoding of Polar Codes [J].
Giard, Pascal ;
Balatsoukas-Stimming, Alexios ;
Mueller, Thomas Christoph ;
Bonetti, Andrea ;
Thibeault, Claude ;
Gross, Warren J. ;
Flatresse, Philippe ;
Burg, Andreas .
IEEE JOURNAL ON EMERGING AND SELECTED TOPICS IN CIRCUITS AND SYSTEMS, 2017, 7 (04) :616-629
[7]   Memory-Efficient Polar Decoders [J].
Hashemi, Seyyed Ali ;
Condo, Carlo ;
Ercan, Furkan ;
Gross, Warren J. .
IEEE JOURNAL ON EMERGING AND SELECTED TOPICS IN CIRCUITS AND SYSTEMS, 2017, 7 (04) :604-615
[8]   Area-efficient VLSI design of Reed-Solomon decoder for 10GBase-LX4 optical communication systems [J].
Hsu, Huai-Yi ;
Wu, An-Yeu ;
Yeo, Jih-Chiang .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2006, 53 (11) :1245-1249
[9]   Multiple Folding for Successive Cancelation Decoding of Polar Codes [J].
Kahraman, Sinan ;
Viterbo, Emanuele ;
Celebi, Mehmet E. .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2014, 3 (05) :545-548
[10]   High-Throughput Low-Complexity Successive-Cancellation Polar Decoder Architecture using One's Complement Scheme [J].
Kim, Cheolho ;
Yun, Haram ;
Ajaz, Sabooh ;
Lee, Hanho .
JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, 2015, 15 (03) :427-435