Article thumbnail

Faster Sequential Universal Coding via Block Partitioning

By Dror Baron and Richard G. BaraniukDror Baron and Richard G. Baraniuk

Abstract

Journal PaperRissanen provided a sequential universal coding algorithm based on a block partitioning scheme, where the source model is estimated at the beginning of each block. This approach asymptotically approaches the entropy at the fastest possible rate of 1/2log(n) bits per unknown parameter. We show that the complexity of this algorithm is /spl Omega/(nlog(n)), which is comparable to existing sequential universal algorithms. We provide a sequential O(nlog(log(n))) algorithm by modifying Rissanen's block partitioning scheme. The redundancy with our approach is greater than with Rissanen's block partitioning scheme by a multiplicative factor 1+O(1/log(log(n))), hence it asymptotically approaches the entropy at the fastest possible rate

Topics: Lossless source coding, redundancy, sequential coding, universal coding, DSP for Communications, Lossless source coding, redundancy, sequential coding, universal coding
Year: 2006
DOI identifier: 10.1109/TIT.2006.871041
OAI identifier: oai:scholarship.rice.edu:1911/19723
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/1911/197... (external link)
  • http://dsp.rice.edu/) (external link)
  • http://dx.doi.org/10.1109/TIT.... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles