DATA COMPRESSION

Basic Idea or Definition

Data compression is a used for reducing the size of the file.

Purpose
Data compression is a set of techniques provided to reduce the size of file or bits which
benefits in following manners.
1) Smaller files requires less storage space
2) Due less space occupied by the files, the transferring of over networks become
faster. [1]

Process
To reduce the size of file is what we are encoding our information in fewer bits and
when we want to retrieve the encoded information we decode it through the scheme used
for encoding.[2]

Technique’s for data compression

1) Lossless scheme
2) Lossy scheme

1) Lossless

“Lossless compression scans the data for repetitive sequences or regions and replaces
them with a single "token." For example, every occurrence of the word the or region with
the color red might be converted to $.”[3]
Lossless compression does not loss any data during process. It makes the file size of the
original file to the half by signifying the redundant data in the file.[4] For example “If an
original file is 1.5MB (megabytes), lossless compression can reduce it to about half that
size, depending on the type of file being compressed. This makes lossless compression
convenient for transferring files across the Internet, as smaller files transfer faster.
Lossless compression is also handy for storing files as they take up less room.”[4]
Lossless techniques are usually applied on text and images. The most famous format for
text compression is Zip and for Image is GIF. There are two important algorithms used
for lossless compression

1) Huffman coding
2) Lempel-Ziv coding
1) Huffman code

“The basic idea in Huffman coding is to assign short codeword to those input blocks with
high probabilities and long codeword’s to those with low probabilities. This concept is
similar to that of the Morse code. A Huffman code is designed by merging together the
two least probable characters, and repeating this process until there is only one character
remaining. A code tree is thus generated and the Huffman code is obtained from the
labeling of the code tree”[5]

2) Lempel-Ziv coding

“The basic idea is to parse the input sequence into non-overlapping blocks of different
lengths while constructing a dictionary of blocks seen thus far.”[5]

2) Lossy

“Lossy compression is the technique which eliminates redundant or unnecessary data

form the information.”[6]
Lossy technique is the technique in which the some of the detail of the data is lost, which
reduce the quality in some extend.[3]
“Lossy compression reduces a file by permanently eliminating certain information,
especially redundant information. When the file is uncompressed, only a part of the
original information is still there (although the user may not notice it). Lossy compression
is generally used for video and sound, where a certain amount of information loss will not
be detected by most users. The JPEG image file, commonly used for photographs and
other complex still images on the Web, is an image that has lossy compression. Using
JPEG compression, the creator can decide how much loss to introduce and make a trade-
off between file size and image quality.”[7]

“Algorithms used on lossy compression

1) Transform coding. Type of data compression for data like audio signals
or photographic images.
2) Vector quantization. Technique often used in lossy data compression.
3) Wavelet compression. Form of data compression well suited for image and
audio compression.”[8]
DATA STORAGE FORMATS
Data storage format in computer is that how the particular data is encoded in the file that
will store in computer. Format is actually referred to the encoded scheme of the file.

DATA STORAGE FORMATS OF SOME FILES

Text Image
1) DOC — Microsoft Word document 1) GIF — CompuServe's Graphics
2) DOCX — Office Open XML Text document or Interchange Format
Microsoft Office Word 2007 for 2) BMP — Microsoft Windows Bitmap
3) HTML — HyperText Markup Language formatted image
(.html, .htm) 3) JPEG, JFIF (.jpg or .jpeg) — Joint
4) PDF — Portable Document Format Photographic Experts Group - a
5) TXT — ASCII or Unicode plaintext lossy image format widely used to
display photographic images.
4) PSD, PDD — Adobe
Photoshop Drawing

AUDIO VIDEO
1) WAV — Microsoft Wave 1) 3GP — (the most common video
2) WMA — Windows Media Audio 9 Lossless format for cell phones)
(WMA) 2) M1V MPEG-1 — Video
3) MP2 (MPEG Layer 2) 3) M2V MPEG-2 — Video
4) MP3 (MPEG Layer 3) 4) MPEG (.mpeg, .mpg, .mpe)
5) RealAudio (RA, RM) 5) WMV — Windows Media Video (See
ASF)
MOORE’S LAW

“The original Moore's Law derives from a speech given by Gordon Moore, later a
founder of Intel, in 1965, in which he observed that the number of micro components that
could be placed in an integrated circuit (microchip) of the lowest manufacturing cost was
doubling every year and that this trend would likely continue into the future. As this
observation and prediction began to be frequently cited, it became known as Moore's
Law. In later years, the Law was occasionally reformulated to mean that rate. The pace of
change having slowed down a bit over the past few years, the definition has changed
(with Gordon Moore's approval) to reflect that the doubling occurs only every 18
months.” [9]

“According to Moore’s Law, the number of transistors on a chip roughly doubles every
two years. As a result the scale gets smaller and smaller. For decades, Intel has met this
formidable challenge through investments in technology and manufacturing resulting in
the unparalleled silicon expertise that has made Moore’s Law a reality. In a universe
where smaller is better, Intel’s current process technology — the most advanced silicon
process in volume production anywhere in the world — prints individual lines smaller
than a virus and 1,000 times thinner than a human hair and manufactures microprocessors
with some features as thin as five atomic layers. As transistor counts climb so does the
ability to increase device complexity and integrate many capabilities onto a chip. The
cumulative impact of these spiraling increases in capability power the economy and the
Internet, running everything from digital phones and PCs to stock markets and spacecraft,
and enable today’s information-rich, converged digital world. Intel expects to continue
driving the leading edge of Moore’s prediction well into the foreseeable future. In 1965,
Gordon Moore sketched out his prediction of the pace of silicon technology. Decades
later, Moore’s Law remains true, driven largely by Intel’s unparalleled silicon expertise.
Nearly 40 years ago, Intel co-founder Gordon Moore forecasted the rapid pace of
technology innovation. His prediction, popularly known as “Moore’s Law,” states that
transistor density on integrated circuits doubles about every two years. Today, Intel
continues to lead the industry, driving Moore’s Law to increase functionality and
performance and decrease costs, bringing growth to industries worldwide.”[10]
 REFRENCES

[1] http://www.wisegeek.com/what-is-data-compression.htm
[2] http://en.wikipedia.org/wiki/Data_compression
[3] http://www.answers.com/topic/data-compression
[4] http://www.wisegeek.com/what-is-lossless-compression.htm
[5] http://www.data-compression.com/lossless.shtml
[6] http://www.webopedia.com/TERM/L/lossy_compression.html
[7] http://searchcio-midmarket.techtarget.com/sDefinition/0,,sid183_gci214453,00.html
[8] http://www.scriptol.com/programming/list-algorithms.php
[9] http://whatis.techtarget.com/definition/0,,sid9_gci212591,00.html
[10]
ftp://download.intel.com/museum/Moores_Law/Printed_Materials/Moores_Law_2pg.pdf
FORMAN CHRISTIAN COLLEGE (A Chartered University)

ASSIGNMENT #2

NAME: SOFEEM NASIM

ROLL NO: 11-10760

COURSE CODE: CSIT 400

SUBMITTED TO: Dr. Prof. I.H.SHAH

SUBMISSION DATE: 05-11-2010