Low Complexity List Decoding for Polar Codes with Multiple CRC Codes
AbstractPolar 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
Share & Cite This Article
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.
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(4):183.Chicago/Turabian Style
Kim, Jong-Hwan; Kim, Sang-Hyo; Jang, Ji-Woong; Kim, Young-Sik. 2017. "Low Complexity List Decoding for Polar Codes with Multiple CRC Codes." Entropy 19, no. 4: 183.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.