Abstract

Adaptive Reduced Path Successive Cancellation List (ARP-SCL) decoding for polar codes is proposed in this paper. The aim here is to reduce the complexity of the conventional Successive Cancellation List (SCL) and a previously proposed Reduced Path SCL (RP-SCL) decoders. The complexity reduction is obtained at low and moderate signal to noise power ratio (SNR) regions. The operation of the proposed ARP-SCL decoder relied on the calculation of different optimum pruning parameters according to the operating SNR, while RP-SCL used single parameters set. Simulation tests are carried out to determine both the complexity and Bit Error Rate (BER) performances of the proposed ARP-SCL decoder in comparison with SCL and RP-SCL decoders. Additive White Gaussian Noise (AWGN) channel and two fading channel models simulating indoor 5G environment using millimeter Wave (mmWave) with carrier frequency of 28GHz and having either 50 or 400 MHz bandwidths are used. The results revealed that the proposed ARP-SCL decoder reduced the average processed paths up to 46.88%. The largest complexity reductions are obtained in the case of fading channel having 400 MHz bandwidth at high SNR regions. In most test conditions, the mentioned reduction in complexity is achieved without greatly sacrificing the required BER.

Highlights

  • Polar codes are linear block codes introduced in 2009 by Erdal Arikan [1]

  • This paper aims at obtaining better complexity reduction at low and moderate signal to noise power ratio (SNR) regions while maintaining an acceptable Bit Error Rate (BER) performance of the decoder

  • The main idea of Adaptive Reduced Path Successive Cancellation List (ARP-Successive Cancellation List (SCL)) is to take the variation in operation SNR into account by considering multiple sets of pruning parameters optimized based on multiple values of design SNR compared to a single set of pruning parameters corresponding to single design SNR used with Reduced Path SCL (RP-SCL)

Read more

Summary

INTRODUCTION

Polar codes are linear block codes introduced in 2009 by Erdal Arikan [1]. Channel polarization is used in polar codes to realize the channel capacity of binary-input discrete memoryless channels (B-DMC). Successive cancellation list (SCL) decoding was proposed with cyclic redundancy check (CRC) to promote the code performance at both low and moderate coding lengths at the expense of increased decoding complexity to O (L.N.log N), where L is the list size of the decoder [2, 3] Both decoding approaches use the same initial steps, but they use a different mechanism to decode the data bits. A Reduced Paths Successive SCL (RP-SCL) decoder considering three different thresholds for tree pruning are suggested in [19] These thresholds were optimized to give the least complexity and reasonable bit error rate (BER) performance for fixed SNR. Improved SC (called SC list) decoding is introduced

Successive Cancellation List Decoding
Reduced Paths Successive Cancellation List Decoding
THE PROPOSED ADAPTIVE REDUCED PATHS SUCCESSIVE CANCELATION LIST DECODING
System and Channel Models
The Decoding Complexity
BER Performance
Discussion of Results
Findings
CONCLUSIONS
Full Text
Published version (Free)

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