Low complexity sequential lossless coding for piecewise stationary memoryless sources

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.