Low-complexity decoding architecture for rate-compatible puncturing polar codes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

Polar codes are the first family of codes which can achieve the channel capacity. Motivated by the demand of high speed transmission for 5G communications, researchers are keen to explore efficient decoding architecture for polar codes. In this paper, we propose a low-complexity decoding architecture for rate-compatible puncturing polar (RCPP) codes with two different puncturing methods, quasi-uniform puncturing (QUP) and shortening. By removing the redundant processing elements for the recursive calculation of log-likelihood ratio, the proposed decoding architecture significantly reduces the space complexity and latency with no BLER performance loss. Moreover, we illustrate that the proposed decoding architecture reduces more complexity if two puncturing methods are employed simultaneously, with negligible BLER performance loss.

Original languageEnglish
Title of host publication2017 17th IEEE International Conference on Communication Technology, ICCT 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages97-101
Number of pages5
ISBN (Electronic)9781509039432
DOIs
Publication statusPublished - 2 Jul 2017
Event17th IEEE International Conference on Communication Technology, ICCT 2017 - Chengdu, China
Duration: 27 Oct 201730 Oct 2017

Publication series

NameInternational Conference on Communication Technology Proceedings, ICCT
Volume2017-October

Conference

Conference17th IEEE International Conference on Communication Technology, ICCT 2017
Country/TerritoryChina
CityChengdu
Period27/10/1730/10/17

Keywords

  • Low-complexity architecture
  • Polar codes
  • Successive cancellation (SC) decoding

Fingerprint

Dive into the research topics of 'Low-complexity decoding architecture for rate-compatible puncturing polar codes'. Together they form a unique fingerprint.

Cite this