Abstract

Deploying polar codes in ultra-reliable low-latency communication (URLLC) is of critical importance and is currently receiving tremendous attention in both academia and industry. However, most of the state of the art polar codes decoders like progressive bit-flipping decoder (PBF) and successive cancellation list (SCL) decoder, involve strong data dependencies and suffer from huge decoding delay. This contradicts the low-latency requirement in URLLC. To address such issue, this paper appeals to the parallel computing and proposes an adaptive ordered statistic decoder (OSD). In particular, we first propose a novel codeword searching metric which proves to be hardware-friendly, and an adaptive OSD algorithm is then developed to adaptively rule out the unpromising codewords, thus significantly reducing the latency. Secondly, to further reduce the computational complexity of the proposed algorithm, we decompose the current code sequence into several independent subcodes, and by handling these subcodes with concatenated adaptive OSDs, a good trade-off between decoding latency and complexity can be achieved. Finally, numerical results show that the proposed adaptive OSD outperforms the conventional decoders in terms of block error rate (BLER) and decoding latency.

Highlights

  • Ultra-reliable and low-latency communication (URLLC) is one of the most important scenarios in 5G communications and beyond

  • With progressive bit-flipping (PBF) decoding [5], superior block error rate (BLER) performance can be achieved with low complexity in high signal-to-noise ratio (SNR) regime

  • The reliability feature is evaluated by the BLER performance of the proposed adaptive

Read more

Summary

INTRODUCTION

Ultra-reliable and low-latency communication (URLLC) is one of the most important scenarios in 5G communications and beyond. The decoding latency inevitably increases with the block length To avoid such data dependency, ordered statistic decoder (OSD) was proposed. Invoking a different decoding structure, OSD is well suitable for parallel implementation and is able to concurrently estimate all polar codeword bits This parallel computing nature dramatically reduces the decoding latency. Codewords with large metric are considered unpromising and should be eliminated Based on this searching metric, the adaptive OSD can rule out the unpromising candidates throughout the tested codewords and simplify the decoding procedure. For this reason, the decoding latency is greatly decreased.

POLAR CODES
DECODING LATENCY OF L-LEVEL OSD
A NOVEL CODEWORD SEARCHING METRIC
ADAPTIVE OSD
LOW COMPLEXITY IMPLEMENTATION
POLAR DECOMPOSITION
THE TRADE-OFF BETWEEN DECODING LATENCY AND COMPLEXITY
SIMULATION RESULTS AND COMPARISONS
DECODING LATENCY ANALYSIS
CONCLUSION
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