Unit1 (Part 1)
Unit1 (Part 1)
DATA COMPRESSION
Presented By
SAUMYA PATHAK
DATA COMPRESSION
• Data compression is the process of reducing the size of data to save storage space or transmission
bandwidth.
• In computer science and information theory, data compression is the process of encoding information
using fewer bits than a decoded representation would use through use of specific encoding schemes.
• It is the art or science of representing information in a compact form. This compaction of information is
done by identifying the structure that exists in the data.
• Compressed data communication only works when both the sender and the receiver of the information
understand the encoding scheme.
• For example, any text makes sense only if the receiver understands that it is intended to be interpreted as
characters representing English language.
• Similarly, the compressed data can only be understood if the decoding method is known by the receiver.
NEED OF DATA COMPRESSION
• Compression is needed because it helps to reduce the consumption of expensive resources such as a
hard disk space or transmission bandwidth.
• As an uncompressed text or multimedia (speech, image or video) data requires a huge amount of
bits to represent them and thus require large bandwidth, this storage space and bandwidth
requirement can be decreased by applying proper encoding scheme for compression.
• The design of data compression schemes involves trade off among various factors including the
degree of compression, the amount of distortion introduced and the computational resources
required to compress and decompress the data.
APPLICATION OF DATA COMPRESSION
• Cellular phones would not provide effective Communication with increasing clarity
of DC is not used.
• Modem.
• Fax machines.
•A compression technique or
compression algorithm refers two
algorithms Le., compression algorithm
and reconstruction algorithm.
• The compression algorithm takes an
input X and generates a representation
X, that requires fewer bits, and the
reconstruction algorithm operates on
the compressed representation X to
generate the reconstruction Y.
MORSE CODE
• This is an early example of DC developed by Samuel Morse
in mid 19th century.
• Letters sent by telegraph are encoded in Dots and Dashes.
• Morse noticed that certain letters occurred more often than
others.So, in order to reduce the average time required to
send a message , he assigned shorter sequences to letters that
occur more frequently such as a(._) & e(.).
• The longer sequence letters that occur less frequently such as
q(_ _._) & j(._ _ _).