On the construction of polar codes for channels with moderate input alphabet sizes

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

Abstract

Current deterministic algorithms for the construction of polar codes cannot be argued to be practical for channels with input alphabets of moderate size. In this paper, we show that any construction algorithm which follows the paradigm of 'degrading after each polarization step' will inherently be impractical with respect to a certain 'hard' underlying channel having an input alphabet of moderate size. This result also sheds light on why the construction of LDPC codes using density evolution is impractical for channels with moderate sized input alphabets.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
Pages1297-1301
Number of pages5
ISBN (Electronic)9781467377041
DOIs
StatePublished - 28 Sep 2015
EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
Duration: 14 Jun 201519 Jun 2015

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2015-June

Conference

ConferenceIEEE International Symposium on Information Theory, ISIT 2015
Country/TerritoryHong Kong
CityHong Kong
Period14/06/1519/06/15

Keywords

  • Polar codes
  • construction
  • degrading cost

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this