Polar Coding for Processes with Memory.

ISIT(2019)

引用 47|浏览79
暂无评分
摘要
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.
更多
查看译文
关键词
Channels with memory, polar codes, mixing, periodic processes, fast polarization, rate of polarization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要