Complete Material Cost #3,000
Order for Complete Material now
ABSTRACT
The Domain “Sun Zip” lets you reduce the overall number of bits and bytes in a file so it can be transmitted faster over slower internet connections, or take up less space on a disk. Domain Sun Zip is a System Based Software. The user need not depend on third party software’s like WinZip, winrar, Stuff etc.
TABLE OF CONTENTS
TITLE PAGE ERROR! BOOKMARK NOT DEFINED.
ACKNOWLEDGMENT II
DEDICATION III
CERTIFICATION IV
ABSTRACT V
TABLE OF CONTENTS VI
CHAPTER ONE 1
1.0 INTRODUCTION 1
1.1 STATEMENT OF THE PROBLEM 3
1.2 OBJECTIVE OF THE STUDY 3
1.3 SCOPE OF THE PROJECT 4
1.4 DEFINITION OF TECHNICAL TERMS 5
CHAPTER TWO 7
2.0 LITERATURE REVIEW 7
2.1 DATA COMPRESSION 7
2.2 LOSSLESS DATA COMPRESSION 8
2.3 LOSSY DATA COMPRESSION 10
2.4 THE THEORETICAL BACKGROUND OF COMPRESSION 11
2.5 AUDIO DATA COMPRESSION 12
2.5.1 LOSSLESS AUDIO COMPRESSION 13
2.5.2 LOSSY AUDIO COMPRESSION 15
2.5.3 SPEECH ENCODING 19
2.6 VIDEO COMPRESSION 20
CHAPTER THREE 26
3.0 ALGORITHMS, LOGIC DESIGN AND FLOWCHART 26
3.1 ALGORITHMS 26
3.1.1 ALGORITHM TO COMPRESS OR DECOMPRESS FILE 26
3.2 LOGIC DESIGN (FLOWCHART) 27
3.2.1 FLOW CHART 27
CHAPTER FOUR 28
4.0 PROGRAM SOURCE CODES 28
4.2 SAMPLE OUTPUT 49
4.3 RUNNING PROCEDURES (HOW THE PROGRAM RUNS) 53
4.4 REASONS FOR CHOICE OF LANGUAGE 54
CHAPTER FIVE 56
5.0 SUMMARY 56
5.1 CONCLUSION 56
5.2 RECOMMENDATION 57
REFERENCE 58
CHAPTER ONE
1.0 INTRODUCTION
The Domain “File Compression” lets you reduce the overall number of bits and bytes in a file so that it can be transmitted faster over slower Internet connections, or take up less space on a disk. Domain File compression is a System Based Software. The software will be implemented using Core Java. It can be used in the System as a utility. The type of compression we will use here is called lossless compression.
The user need not depend on third party software’s like winzip, winrar, Stuff etc. the software can be used to compress as well as decompressed files when the need arises. To implementing this Software we want to use algorithms, Huffman coding which is an entropy encoding algorithm used for lossless data compression. The term refers to the use of a variable-length 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. It was developed by David Huffman A when he was a Ph.D. student at MIT, and published in the 1952 paper “A Method for the Construction of Minimum-Redundancy Codes”.
Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called “prefix-free codes”) (that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol) that expresses the most common characters using shorter strings of bits than are used for less common source symbols. Huffman was able to design the most efficient compression method of this type: no other mapping of individual source symbols to unique strings of bits will produce a smaller average output size when the actual symbol frequencies agree with those used to create the code. A method was later found to do this in linear time if input probabilities (also known as weights) are sorted.
For a set of symbols with a uniform probability distribution and a number of members which is a power of two, Huffman coding is equivalent to simple binary block encoding, e.g., ASCII coding. Huffman coding is such a widespread method for creating prefix codes that the term “Huffman code” is widely used as a synonym for “prefix code” even when such a code is not produced by Huffman’s algorithm.
1.1 STATEMENT OF THE PROBLEM
Due to the nature of low disk space and that, users need to store files on disk, we need flexible and efficient file compressor to reduce the overall number of bits and bytes in a disk so it can contact more file, or take up less space on a disk, both from a processing time point of view and also in terms of accuracy in the result general. It is necessary to have this application if the need arises.
1.2 OBJECTIVE OF THE STUDY
The problems of file compression are among the most studied application, with the interest of reducing the overall number of bits and bytes in a file so it can be transmitted faster over slower Internet connections, or take up less space on a disk, in specific terms, the objectives of this study are:
1. It aims is to reducing the overall number of bits and bytes in a file so it can be transmitted faster over slower Internet connections, or take up less space on a disk.
2. To identify all possible means of reducing larger files to the available space on a disk. In the case of congesting an alternative space in any external hard disk.
3. It also help to protect the file from unauthorized users .
4. It serves as an encryption program in a case where unauthorized cant gain access or view the content of a compressed file.
1.3 SCOPE OF THE PROJECT
Conventional techniques for saving larger files that are more than the available space on e.g. a hard disk, by the use of this file compression program, the optimal for a symbol-by-symbol coding (i.e. a stream of unrelated symbols) with a known input probability distribution, its optimality can sometimes accidentally be over-stated. In this project I have tried to compress some files by the use of “Sun Zip” that will let you reduce the overall number of bits and bytes in a file so it can be transmitted faster over slower Internet connections and take up less space on a Hard disk.
1.4 DEFINITION OF TECHNICAL TERMS
Algorithm: A prescribed step by step procedure, which a computer will take in solving a particular problem.
Congestion Level: The general operating condition of the bits and bytes in a file so it can be transmitted faster over slower Internet connections, or take up less space on a disk.
Destination: The purpose of reducing bits and bytes in a file for easy transmission, often define by the help of file compression.
Flowchart: It is a diagrammatic representation of the prescribed steps necessary to solve a particular problem.
Optimization: This is the art of easy transmission of larger files to any available space found.
Compress file or folder: This module helps us to compress a file or folder. The compressed file will have a extension that has been given at the development time. We can send the compressed file over the internet so that users having this software can decompress it.
Decompress a file or folder: This is the reverse process of file compression. Here we can decompress the compressed file and get the original file.
View files in the compressed file: Here we can view the list of files inside our compressed file. We can view the files before decompressing and decide to decompress or not.
Set icon and extension: This is additional feature in this project. We can set our own extension to the compressed file more than that we can specify the style of icon for the compressed file. Users will also be given an option to change the icon as per their preference.
Complete Material Cost #3,000