1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.

Data Compression

Discussion in 'C' started by abbasahmad, May 19, 2010.

  1. abbasahmad

    abbasahmad New Member

    Joined:
    May 19, 2010
    Messages:
    1
    Likes Received:
    0
    Trophy Points:
    0
    Can anybody help on this??? plz

    The Burrows-Wheeler compression algorithm consists of three different algorithmic components, which are applied in succession:
    1. Burrows-Wheeler transform. Given a typical English text file, transform it into a text file in
    which sequences of the same character occur near each other many times.

    2. Move-to-front encoding. Given a text file in which sequences of the same character occur near
    each other many times, convert it into a text file in which certain characters appear more
    frequently than others.

    3. Huffman compression. Given a text file in which certain characters appear more frequently than
    others, compress it by encoding frequently occurring characters with short codewords and rare
    ones with long codewords. The only step that compresses the message is the final step. The
    final step is particularly effective because the first two steps result in a text file in which certain
    characters appear much more frequently than others.

    Decompression : To expand a message, apply the inverse operations in reverse order: first apply the
    Huffman expansion, then the move-to-front decoding, and finally the inverse Burrows-Wheeler trans-
    form.


    Inputs
    For Compression: .txt file is given as an input .
    For Decompression: .bwc file is given for decompression. Outputs
    For Compression: decompressed file generated with .bwc extension.
    For Decompression: original .txtfile generated from the input. Check List:
    Correctness of algorithm: no data should be lost while compressing or decompressing.
    Step-By-Step progress of algorithm: system should tell the intermediate products of each step in the process of compression and decompression.
    List of data structures used for the solution
    Bonus
    Well designed user interface, and a look & feel of proper compression tool.
     
  2. xpi0t0s

    xpi0t0s Mentor

    Joined:
    Aug 6, 2004
    Messages:
    3,012
    Likes Received:
    203
    Trophy Points:
    0
    Occupation:
    Senior Support Engineer
    Location:
    England
    What help do you need? Do you understand the project?
    When does it need to be in by?
     
  3. shyam_oec

    shyam_oec New Member

    Joined:
    Nov 26, 2007
    Messages:
    89
    Likes Received:
    1
    Trophy Points:
    0
    Occupation:
    Software Developer, .NET Framework
    Location:
    Jamshedpur
    what do u mean by this line ?
     
  4. shabbir

    shabbir Administrator Staff Member

    Joined:
    Jul 12, 2004
    Messages:
    15,285
    Likes Received:
    364
    Trophy Points:
    83
    Probably something like

    ssssssssssjjjjjjjjjjjjjjjjjjffffffffffffffff
    would become
    s10j18f16
     

Share This Page