Results 1 to 4 of 4

Thread: Statistical implementation of Ziv-Lempel

  1. #1
    Join Date
    Feb 2009
    Thanked 0 Times in 0 Posts

    Statistical implementation of Ziv-Lempel


    as a part of my diploma thesis I want to implement an LZ-based compression scheme. I need it to be statistical, i.e. it does not itself compress, but returns a probability for the next symbol. Also the implementation should work bitwise. (Since I am going to compress text, the compression scheme could internally work in a bytewise manner, but I need a prediction for every new bit.) 100 MB of memory should be sufficient.

    There is a whole lot of different implementations both for LZ77 and LZ78. I dont know which is better. Could anyone suggest me a scheme, that is appropriate for my task? Maybe you can tell me the title of a paper for this scheme.

    Thanks in advance!

  2. #2
    Administrator Shelwien's Avatar
    Join Date
    May 2008
    Kharkov, Ukraine
    Thanked 1,362 Times in 779 Posts
    It kinda sounds like what I recently mentioned in

    LZ78 might be easier for the task, as you only have to
    consider the available symbols, and you can control the
    alphabet size, but the only well-known implementation is
    LZW, and its compression is relatively bad.

    So I guess it should be more interesting to implement such
    a thing for some simple existing LZ77 - like
    Of course, things like deflate and LZMA are more popular, but
    it'd be probably too hard to deal with their sources,
    and there's a lot of unnecessary (here) features - like
    blocks in deflate.

    Anyway, LZ77 just codes the references to substrings in
    the already processed data, so its idea is really simple.
    And you won't be able to use the existing library for
    such task either way, so it might be better to just write
    your own coder.

    So basically, with LZ77 you'd have a set of literals +
    all possible matches, and it'd be necessary to estimate
    their code lengths (=log2 of probability) and sort by
    first bit value, convert to probabilities, integrate and normalize.

    Which is not very hard to implement in a direct way,
    but then making it to run reasonably fast might be
    a tough problem.

    But still, even a direct implementation would be interesting
    to compare with straight version of its LZ model, and estimate
    the LZ's redundancy.

  3. #3
    Join Date
    Nov 2008
    Thanked 0 Times in 0 Posts
    The following links might also be interesting for you:

    (In fact, the english version of this article is a stub. So if you
    can read german or russian, the following might be more interesting:

    Maybe you can use google translate.)


    is another implementation of Ilia.

    Last edited by Alibert; 10th February 2009 at 20:01. Reason: yet another link

  4. #4
    The Founder encode's Avatar
    Join Date
    May 2006
    Moscow, Russia
    Thanked 415 Times in 158 Posts
    Better check out BALZ! BALZ is an improved QUAD and its source is in the Public Domain!

Similar Threads

  1. Move-to-Front Implementation
    By Cyan in forum Data Compression
    Replies: 34
    Last Post: 8th August 2010, 02:11
  2. Implementation of JPEG2000 LLC based on LZMA
    By Raymond_NGhM in forum Data Compression
    Replies: 0
    Last Post: 19th March 2010, 02:14
  3. Lempel-Ziv-Tamayo
    By lunaris in forum Data Compression
    Replies: 4
    Last Post: 3rd August 2008, 03:00

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts