Low complexity sequential lossless coding for piecewise stationary memoryless sources
Low complexity sequential lossless coding for piecewise stationary memoryless sources
复制标题
分段固定无记忆源的低复杂度顺序无损编码
DOI：
10.1109/isit.1998.708627
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
N. Merhav
中科院分区：
文献类型：
--
作者：
G. Shamir;N. Merhav
针对统计量突变的无记忆信源，提出了一种具有固定计算复杂度的强序贯无损压缩方案。当统计量的跃迁较大时，实现O(logN/N)的冗余度，否则达到O(/SPL RADIC/(logN/N))的冗余度。
A strongly sequential lossless compression scheme with fixed per-letter computational complexity is presented for memoryless sources with abruptly changing statistics. It achieves redundancy of O(log N/N) when the transitions in the statistics are large and O(/spl radic/(log N/N)) otherwise.