Next Article in Journal
Slow Dynamics and Structure of Supercooled Water in Confinement
Previous Article in Journal
Carnot-Like Heat Engines Versus Low-Dissipation Models
Article Menu
Issue 4 (April) cover image

Export Article

Open AccessArticle
Entropy 2017, 19(4), 183; doi:10.3390/e19040183

Low Complexity List Decoding for Polar Codes with Multiple CRC Codes

1
College of Information and Communication Engineering, Sungkyunkwan University, Gyeonggi-do, Suwon 16419, Korea
2
Department of Computer Science, Ulsan College, Hwajeong-dong, Dong-gu, Ulsan 44022, Korea
3
Department of Information and Communication Engineering, Chosun University, Gwangju 61452, Korea
*
Author to whom correspondence should be addressed.
Academic Editor: Raúl Alcaraz Martínez
Received: 7 February 2017 / Revised: 22 March 2017 / Accepted: 11 April 2017 / Published: 24 April 2017
(This article belongs to the Section Information Theory)
View Full-Text   |   Download PDF [445 KB, uploaded 24 April 2017]   |  

Abstract

Polar codes are the first family of error correcting codes that provably achieve the capacity of symmetric binary-input discrete memoryless channels with low complexity. Since the development of polar codes, there have been many studies to improve their finite-length performance. As a result, polar codes are now adopted as a channel code for the control channel of 5G new radio of the 3rd generation partnership project. However, the decoder implementation is one of the big practical problems and low complexity decoding has been studied. This paper addresses a low complexity successive cancellation list decoding for polar codes utilizing multiple cyclic redundancy check (CRC) codes. While some research uses multiple CRC codes to reduce memory and time complexity, we consider the operational complexity of decoding, and reduce it by optimizing CRC positions in combination with a modified decoding operation. Resultingly, the proposed scheme obtains not only complexity reduction from early stopping of decoding, but also additional reduction from the reduced number of decoding paths. View Full-Text
Keywords: polar codes; successive cancellation list decoding; multiple CRC codes polar codes; successive cancellation list decoding; multiple CRC codes
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Kim, J.-H.; Kim, S.-H.; Jang, J.-W.; Kim, Y.-S. Low Complexity List Decoding for Polar Codes with Multiple CRC Codes. Entropy 2017, 19, 183.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top