Polar Coding for Processes With Memory

DOI10.1109/TIT.2018.2885797zbMATH Open1431.94065arXiv1602.01870OpenAlexW2921868595WikidataQ128198758 ScholiaQ128198758MaRDI QIDQ5223908FDOQ5223908

Authors: Eren Şaşoğlu, Ido Tal 

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We study polar coding for stochastic processes with memory. For example, a process may be defined by the joint distribution of the input and output of a channel. The memory may be present in the channel, the input, or both. We show that $psi$-mixing processes polarize under the standard Ari{}kan transform, under a mild condition. We further show that the rate of polarization of the emph{low-entropy} synthetic channels is roughly $O(2^{-sqrtN})$, where $N$ is the blocklength. That is, essentially the same rate as in the memoryless case.

Full work available at URL: https://arxiv.org/abs/1602.01870

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Cited In (1)

• Algorithmic polarization for hidden Markov models

This page was built for publication: Polar Coding for Processes With Memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223908)