Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Channel coding for ultra-reliable low-latency communication in 5G systems

Authors

[ 1 ] Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] employee

Year of publication

2016

Chapter type

paper

Publication language

english

Keywords
EN
  • channel coding
  • LDPC
  • turbo codes
  • polar codes
  • machine-to-machine communication
  • URLLC
  • 5G
Abstract

EN This paper investigates block error rate (BLER) performance and computational complexity of candidate channel coding schemes for ultra-reliable low latency communication (URLLC) in 5G. The considered candidates are the same as those identified in 3GPP: turbo, LDPC, polar, and convolutional codes. Details of code constructions and decoding algorithms are provided with computational complexity analysis. Code construction parameters, number of iterations, and list sizes are selected to provide a fair comparison among candidate coding schemes. Simulation results on BLER are shown for several code rates and small-to-moderate block sizes. The results reveal that polar and LDPC codes outperform turbo codes for short block sizes of 40 bits, while the opposite is true for medium block sizes of 200 bits. None of the schemes is a clear winner at all considered block sizes and coding rates. Other aspects like implementation complexity, latency, and flexibility will also be important when deciding the URLLC coding scheme.

DOI

10.1109/VTCFall.2016.7880930

URL

https://ieeexplore.ieee.org/document/7880930

Book

VTC2016-Fall : The 84th IEEE Vehicular Technology Conference, Montreal

Presented on

84th IEEE Vehicular Technology Conference, VTC2016-Fall, 18-21.09.2016, Montréal, Canada

Publication indexed in

WoS (15)

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.