Polar coding for processes with memory

Eren Sasoglu, Ido Tal

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

Abstract

We study polar coding over channels and sources with memory. We show that ψ-mixing processes polarize under the standard transform, and that the rate of polarization to deterministic distributions is roughly O(2-√N) as in the memoryless case, where N is the blocklength. This implies that the error probability guarantees of polar channel and source codes extend to a large class of models with memory, including finite-order Markov sources and finite-state channels.

Original languageEnglish
Title of host publicationProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
Pages225-229
Number of pages5
ISBN (Electronic)9781509018062
DOIs
StatePublished - 10 Aug 2016
Event2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain
Duration: 10 Jul 201615 Jul 2016

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2016-August

Conference

Conference2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/TerritorySpain
CityBarcelona
Period10/07/1615/07/16

Keywords

  • Channels with memory
  • periodic processes
  • polar codes
  • strong polarization

All Science Journal Classification (ASJC) codes

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

Fingerprint

Dive into the research topics of 'Polar coding for processes with memory'. Together they form a unique fingerprint.

Cite this