A Multimode Area-Efficient SCL Polar Decoder

Polar codes are of great interest, since they are the first provably capacity-achieving forward error correction codes. To improve throughput and to reduce decoding latency of polar decoders, maximum likelihood (ML) decoding units are used by successive cancellation list (SCL) decoders as well as SC decoders. This paper proposes an approximate ML (AML) decoding unit for SCL decoders first. In particular, we investigate the distribution of frozen bits of polar codes designed for both the binary erasure and additive white Gaussian noise channels, and take advantage of the distribution to reduce the complexity of the AML decoding unit, improving the throughput-area efficiency of the SCL decoders. Furthermore, a multimode (MM) SCL decoder with variable list sizes and parallelism is proposed. If high throughput or small latency is required, the decoder decodes multiple received words in parallel with a small list size. However, if error performance is of higher priority, the MM-SCL decoder switches to a serial mode with a bigger list size. Therefore, the MM-SCL decoder provides a flexible tradeoff between latency, throughput, and error performance at the expense of small overhead. Hardware implementation and synthesis results show that our polar decoders not only have a better throughput-area efficiency but also easily adapt to different communication channels and applications.

[1]  Alexios Balatsoukas-Stimming,et al.  Hardware Architecture for List Successive Cancellation Decoding of Polar Codes , 2014, IEEE Transactions on Circuits and Systems II: Express Briefs.

[2]  Zhiyuan Yan,et al.  A reduced latency list decoding algorithm for polar codes , 2014, 2014 IEEE Workshop on Signal Processing Systems (SiPS).

[3]  Zhiyuan Yan,et al.  Symbol-based successive cancellation list decoder for polar codes , 2014, 2014 IEEE Workshop on Signal Processing Systems (SiPS).

[4]  Bin Li,et al.  Low-latency polar codes via hybrid decoding , 2014, 2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

[5]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[6]  Keshab K. Parhi,et al.  Low-Latency Sequential and Overlapped Architectures for Successive Cancellation Polar Decoder , 2013, IEEE Transactions on Signal Processing.

[7]  Garik Markarian,et al.  Performance of short polar codes under ML decoding , 2009 .

[8]  Keshab K. Parhi,et al.  Low-Latency Successive-Cancellation List Decoders for Polar Codes With Multibit Decision , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[9]  Zhiyuan Yan,et al.  Symbol-Decision Successive Cancellation List Decoder for Polar Codes , 2015, IEEE Transactions on Signal Processing.

[10]  Warren J. Gross,et al.  A Scalable Successive-Cancellation Decoder for Polar Codes , 2013, IEEE Transactions on Signal Processing.

[11]  Mehmet Ertugrul Çelebi,et al.  Code based efficient maximum-likelihood decoding of short polar codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[12]  Erdal Arikan,et al.  Systematic Polar Coding , 2011, IEEE Communications Letters.

[13]  Alexios Balatsoukas-Stimming,et al.  LLR-Based Successive Cancellation List Decoding of Polar Codes , 2013, IEEE Transactions on Signal Processing.

[14]  Bin Li,et al.  Parallel Decoders of Polar Codes , 2013, ArXiv.

[15]  Kai Chen,et al.  CRC-Aided Decoding of Polar Codes , 2012, IEEE Communications Letters.

[16]  Alexander Vardy,et al.  Increasing the speed of polar list decoders , 2014, 2014 IEEE Workshop on Signal Processing Systems (SiPS).

[17]  Alexander Vardy,et al.  Fast Polar Decoders: Algorithm and Implementation , 2013, IEEE Journal on Selected Areas in Communications.

[18]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[19]  Warren J. Gross,et al.  Increasing the Throughput of Polar Decoders , 2013, IEEE Communications Letters.

[20]  Keshab K. Parhi,et al.  Latency Analysis and Architecture Design of Simplified SC Polar Decoders , 2014, IEEE Transactions on Circuits and Systems II: Express Briefs.

[21]  Kai Chen,et al.  Low-Complexity Sphere Decoding of Polar Codes Based on Optimum Path Metric , 2013, IEEE Communications Letters.

[22]  Warren J. Gross,et al.  A Semi-Parallel Successive-Cancellation Decoder for Polar Codes , 2013, IEEE Transactions on Signal Processing.

[23]  Emre Telatar,et al.  Polarization for arbitrary discrete memoryless channels , 2009, 2009 IEEE Information Theory Workshop.

[24]  Zhengya Zhang,et al.  A 4.68Gb/s belief propagation polar decoder with bit-splitting register file , 2014, 2014 Symposium on VLSI Circuits Digest of Technical Papers.

[25]  Zhiyuan Yan,et al.  An Efficient List Decoder Architecture for Polar Codes , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[26]  E. Arkan,et al.  A performance comparison of polar codes and Reed-Muller codes , 2008, IEEE Communications Letters.

[27]  Zhiyuan Yan,et al.  A High Throughput List Decoder Architecture for Polar Codes , 2016, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[28]  Ying Li,et al.  Construction and Block Error Rate Analysis of Polar Codes Over AWGN Channel Based on Gaussian Approximation , 2014, IEEE Communications Letters.

[29]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.