SYSTEM BASED COMPRESSION SOFTWARE

PROJECT GUIDE MS. KAVITA SAXENA

DEVELOPED BY: NIKHIL GUPTA MANAN SEHGAL MUKUL GOEL

INTRODUCTION
ZIP SOFTWARE allows us to reduce numbers of bits and bytes so that it can be transmitted over slower Internet connection. It is a system based software and user need not to depend on third partys software like WINZIP, WINRAR..etc. Different compression/decompression techniques are used.

IEEE PAPERS AND RESEARCH

A new lossless method of image compression and decompression using huffman coding techniques By JAGADISH H. PUJAR and LOHIT M.KADLASKAR. Data Compression By Debra A. Lelewer and Daniel S. Hirschberg

http://www.johnwiseman.com/technical/MPEG_tuto rial.htm http://www.ics.uci.edu/~dan/pubs/DataCompressio n.html

ALGORITHMS USED:
GZIP ALGORITHM RUN LENGTH ENCODING (RLE) LEMPEL ZIV WELCH (lZW) HUFFMAN COMPRESSION/DECOMPRESSION

Differences with existing systems.

Dependence on third party software Existing system require more computational time.

DATA FLOW FOR SYSTEM

GZIP(GNU ZIP) ALGORITHM

It finds duplicated strings in the input data. The second occurrence of a string is replaced by a pointer to the previous string, in the form of a pair (distance, length). Distances are limited to 32K bytes, and lengths are limited to 258 bytes. When a string does not occur anywhere in the previous 32K bytes, it is emitted as a sequence of literal bytes.

Literals or match lengths are compressed with one Huffman tree, and match distances are compressed with another tree. The trees are stored in a compact form at the start of each block. Duplicated strings are found using a hash table. All input strings of length 3 are inserted in the hash table.

RUN LENGTH ENCODING (RLE)

Run-length encoding (RLE) is a very simple form of data compression in which runs of data (that is, sequences in which the same data value occurs in many consecutive data elements) are stored as a single data value and count, rather than as the original run. wwwwwwaaaaabbbbbsssddddd. Will be stored as : 6w5a5b3s5d

LENPEL ZIV WELSH (LZW)

Its a form of compression/decompression technique which makes use of a dynamic dictionary for encoding as well as decoding a particular stream of data. LZW dictionary is not an external dictionary that lists all known symbol strings. Instead, the dictionary is initialized with an entry for every possible byte.

HUFFMAN ALGORITHM

Huffman coding is an entropy encoding algorithm used for lossless data compression. The term refers to the use of a variablelength code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol.

Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code ) that expresses the most common source symbols using shorter strings of bits than are used for less common source symbols. The technique works by creating a binary tree of nodes.

TECHNOLOGICAL PLATFORM
JAVA SDK 1.6 OS WINDOWS 7 NETBEANS 6.9.1 JAVA.UTIL.ZIP main package used.

WORK DONE TILL NOW

Through with programming phase. Testing is undergoing. Working better than current ZIP software.