Design and implementation of Lossless

Data CODEC using FPGA

Supervisors:
Prof. Dr./ Abdelhalim Abdelnaby Zekry
Dr. / Hatem Mohamed Zakaria
Agenda
 Introduction.
 CODEC.
 Data Compression Methods.
 Lossless Compression Methods.
 Lossy compression methods.
 General architecture of CODEC system.
 Compressor Coder internal Block Diagram.
 Aim of Research.
Introduction
 Video: 30 pictures per second
 Each picture = 200,000 dots or pixels
 8-bits to represent each primary color
 For RGB = 28 x 28 x 28
 Bits required for one second movie =
503316480 pixels
 Two hour movie requires = 2 x 60 x 60 x
503316480
 IT IS VERY
LARGE AMOUNT
OF DATA

ISN’T IT ?
.Compression is necessary

Compression is a way to reduce the number of

bits in a frame but retaining its meaning.

Decreases space, time to transmit, and cost.

 Codec
 Stands for coder-decoder or compressor-de-
compressor.
 In simplest form, a codec is a software
algorithm that transforms data from one
format to another.
 Codec used to compress file must be the
same used to decompress file.
 Data Compression Methods
 There’re two major categories for methods to
compress data: lossless and lossy methods
Lossless Compression Methods

 In lossless methods, original data and the

data after compression and decompression
are exactly the same.

 Text files are stored using lossless

techniques, since losing a single character
can in the worst case make the text
dangerously misleading.
Run-length encoding
 Simplest method of compression.
 How: replace consecutive repeating occurrences of a symbol by 1
occurrence of the symbol itself, then followed by the number of
occurrences.

 The method can be more efficient if the data uses only 2 symbols
(0s and 1s) in bit patterns and 1 symbol is more frequent than
another.
Huffman coding
 In Huffman coding, you assign shorter
codes to symbols that occur more
frequently and longer codes to those that
occur less frequently.
 For example:
Character A B C D E
------------------------------------------------------
Frequency 17 12 12 27 32
Table 15.1 Frequency of characters
Figure 15-4

Huffman coding
Figure 15-5

Final tree and code

Figure 15-6

Huffman encoding
Figure 15-7

Huffman decoding
Huffman coding
 The beauty of Huffman coding is that no code in
the prefix of another code.
 There is no ambiguity in encoding.
 The receiver can decode the received data
without ambiguity.
 Huffman code is called instantaneous code
because the decoder can unambiguously
decode the bits instantaneously with the
minimum number of bits.
Lempel Ziv encoding
 LZ encoding is an example of a category
of algorithms called dictionary-based
encoding.
 The idea is to create a dictionary (table) of
strings used during the communication
session.
 The compression algorithm extracts the
smallest substring that cannot be found in
the dictionary from the remaining non-
compressed string.
Figure 15-8:Part I

Example of Lempel Ziv encoding

Figure 15-8:Part 2

Example of Lempel Ziv encoding

Figure 15-9: Part I

Example of Lempel Ziv decoding

Figure 15-9: Part II

Example of Lempel Ziv decoding

Lossy compression methods

 Loss of information is acceptable in a

picture of video.

 The reason is that our eyes and ears

cannot distinguish subtle changes.

 Loss of information is not acceptable in a

text file or a program file.
General architecture of CODEC system
Encoder
Decoder
Research Plan of this Thesis
1. Literature Survey about lossless data
compression algorithms.

2. Study about FPGA Prototyping

3. Design a lossless data compression

technique and model validation
4. System simulation using VHDL.

5. FPGA hardware Implementation.

6. Comparison of simulation results against

theoretical limits.