1

CHAPTER 1

INTRODUCTION

In this chapter, will be discussing about the project entitled Video Compression in
Wireless Network. A thorough explanation of the background study, problem statement,
objectives, scope and significance about the project to be developed.

1.1 Background Study

Over the last few years wireless network had an explosive rate of growth.
This making wireless network to be used in any places for the ease of its
connectivity among its users. Thus, making it networking resources give
and easy access to the community. However, there are many wireless
networks weaknesses to be conquered to produce a much better wireless
network service to the people.
As for example, the use of video over wireless network environment is
being used all over the world making this big size electronic media
transmission the needs of compression in avoiding any reduce channel
congestion and transmission overhead.

1.2 Problem Statement

An existing data rate support needs to be improved to produce a high speed
application use. One of its factor is data compression algorithm. As high
compressed data make it highly sensitive to the network errors and any
network interference (Singh et al., 2014).
As many variation of size is use during wireless network compression.
Some large size data gives off channel congestion, increase in transmission

delay and the occurrence of data loss. There are lots of existing compression
technique are invented in controlling its data size. Unfortunately, not all of
those technique are efficient enough in producing its desired compression
efficiencies and robustness (Shiladitya et al., 2015).

1.3 Project Objectives

1. To design a video compression using a fixed length coding compression.
2. To develop a video compression using a fixed length coding
compression.
3. To evaluate the effectiveness and efficiencies of a video compression
using a fixed length coding compression.

1.4 Project Scopes

The scopes to be tackle in this project is in making video compression in
wireless network by implementing an compression algorithm that help
reducing network congestion, transmission delay, data loss occurrences and
improving the network data rate.

1.5 Project Significance

An improved data rate of a wireless network. By the implementation of a
fixed length coding compression algorithm that compressed data by not
destroying any part of the data. Thus, creating a wireless network that can
transfer compressed large size data that has a high compression efficiency.

1.6 Network Element

In this project, the network element that can be found is the video
compression technique that is use in compressing video in the wireless
network.

1.7 Expected Outcome

The outcome that can be expected from this project is the small size video
compression that preserve the exact originality of the uncompressed video
after the compression takes part in a wireless network environment in
avoiding any transmission overhead and channel congestion.

CHAPTER 2

LITERATURE REVIEW

In this chapter, the background study of the project is elaborate to explore the aspect
that will be used in understanding and constructing the project.

2.1 Data Compression

Data compression is a process which reduces volume of the data and
preserve the content of information at an acceptable level of fidelity. The
information content is usually measured by entropy (Dang, Bulusu, & Feng,
2013).
The data compression can be divided into two category which are lossy
compression and lossless compression.

2.1.1 Lossy Compression

In lossy compression, the decompressed data is required to contain some
small error inside the information of the original data (Dang et al., 2013).
The redundancy of the data sets will be destroyed permanently and making
it unretrievable when decompression. The data quality is degrade during its
compression (Shiladitya, Lukman, & Izzatdin, 2015).

Figure 2.1 Lossy Compression

(Source Pooja Anoorag et al,. 2013)

2.1.2 Lossless Compression

In lossless compression, decompressed data is required to contain the exact
same information as the original given data (Dang et al., 2013). Moreover,
the data is rewritten to a much more efficient manner.

Figure 2.2 Lossless Compression

(Source Pooja Anoorag et al,. 2013)

Lossless compression technique can be divide into 2 category which is variable length
coding technique (VLC) and fixed length coding technique (FLC).

2.2 Variable Length Coding Technique (VLC)

Depend upon prefix codes where the codes makes two unalike consecutive
codes between it in producing their compressed codes. Other than that, it
can be influenced easily by all the types of channel noise or error in data. In
some cases, the whole compressed code is rendered unreadable if any
corruption occur to a single bit of the prefix code during transmission. Thus,
the robustness of VLC compression is low against the various data errors
and channel noises (Shiladitya et al., 2015).
Example of some VLCs :

2.2.1 Huffman Coding

Huffman code problem solving is by finding an optimal codebook for an
arbitrary probability distribution of symbols. A specific method is used in
choosing each symbol representation, producing in a prefix code (Steven
Pigeon, 2003).

In common, the design of the Huffman binary tree is made by using the
symbols frequencies which are different from each symbol of the files data.
As the data travel across the Huffman binary tree, the compressed codes are
produces (Golander, Taharlev, Glass, Biran, Manole, 2013). Thus, if any
small interference occurred to the compressed code will make the data
compromised from being retrieve.

2.2.2 Arithmetic Coding

Arithmetic coding usually use a string of characters of a word represented
into a fixed number of bits per character. When the arithmetic conversion
occur, the fewer bits stored the frequently used characters whilst more bits
keep the not-so-frequently occur characters producing a total of fewer bits
used. It give a disadvantage, if there occur a bit of corruption when the
compression or transmission of the compressed code occurred. This will
make the data irretrievable (Chuang, Chen, Liao, Lin, 2012).

2.2.3 Dictionary Based Coding

Dictionary based compression algorithm will make a partition by the string
input receive make it into phrases which are the non-overlapping substring
and then make a codewords where each phrase is replaced with
corresponding bit strings. The functionality of the dictionary is mapping
phrases to the codewords (Sahinalp, Rajpoot, 2003).

2.2.4 Lempel Ziv Compression

The easiness of its use and its flexible nature made it as a primary technique
in common purpose data compression. The ability of the technique is in
decreasing data files into one-half of its original sizes (Pooja, Anurag,
Chetan, 2013).

This algorithm make a data dictionary (also known as a translation table or

string table) of an uncompressed data stream. Later, the dictionary will
matched the identifiable pattern of data (substrings) of the data stream. If it
cant be found, data content of the substring will form a new code
expression based on it and stored into the dictionary (Pooja et al., 2013).

2.3 Fixed Length Coding Technique (FLC)

Fixed length code is a code where fixed number of symbols in source are
encoded in the fixed number of the symbols output. Usually in a block code
(D. John, 2004). FLCs can solve the robustness matter as when FLCs
generating the compressed code without relying upon the prefix code. If any
corruption occur during data transmission wont be affecting the data block
as a whole. Unfortunately the existing FLCs is not efficient enough in big
data application in the matter of the required compression efficiencies
(Shiladitya et al., 2015).
This are some example of existing FLC that available :

2.3.1 Run Length Coding

Run Length Coding also known as Run Length Limiting is a notable
lossless

compression approach and also used in numerous other

compression technique. A sequence of pixels with similar intensity value by

first registering the default intensity value, followed by the number of
instance which is known as run is how the RCL encoding process occur
(Mustafa, Wong, 2010).

2.3.2 Fixed Length Compression

This compression technique is create in overcoming the wall that exist in
both existing fixed and variable length coding. Moreover, it is useful in
compressing big data file by not depend fully on the prefix code. Resulting
a high level of robustness against any channel noises and errors (Shiladitya
et al., 2015).
This compression has a 2 separate part, the first part is in the creating the
character table and the second part is in creating the compressed code. The
compression start by converting the input file into binary string. The binary
strings then seperated into 8 bit sub strings. In building the character table,
the substring is sorted using its frequency accordingly. Then, the process of
constructing the compressed code by following the character table. Both of
the compressed code and character string in the character table is to be
concatenated into one single string of compressed data before sending to the
receiving end (Shiladitya et al., 2015).

2.4 Summary
In summarization, lossless compression is better than lossy compression as
the data compressed is exactly the same as the original. Lossless
compression is categorized into two, which are variable length coding and
fixed length coding. Both of it has its strong points and weaknesses. This
will help in selecting a suitable type of compression technique to be used in
the project.

CHAPTER 3

METHODOLOGY

In this chapter, the general view of the project development is discussed. It will show
the procedure and method to be used in conducting the project and managing the project
in a timely order.

3.1 Project methodology

In helping to have a much better understanding the flow of the project. 5
phases has to be completed sequentially for the project. The 4 phases are
information gathering, planning, design and development, testing and
implementation.

3.1.1 Information gathering

In this phase, the objective of the project is determined. The information
related to the project is to be gathered and breakdown in knowing the most
important part of the project that needed. Furthermore, this phase helps in
searching current problem that arise in the project. This phase is completed
by gathering relatable articles and journals of the project.
Thus, title, problem statement, objectives, significance, network element
and expected outcome of the project can be identified.

3.1.2 Planning
The project need to have a well prepared planning. This will help the project
to be done according to its time. Moreover, it also help in identifying the

related project element which are the compression technique to be use.

Other than that, the hardware and software needed is also identified.
Hardware requirement :
1. Lenovo G40
Processor : AMD A8-6410 APU 2.00 GHz
RAM : 8 GB
Graphic : AMD Radeon R5 Graphics
2. D-Link DSL-2730E
Wireless Modem
Dual Band
Wi-Fi : 2.4GHz, 802.11b/g/n
Wi-Fi Security : WEP/WPA/WPA2
Software Requirement :
1. Windows 10
2. NetBeans IDE 8.2

3.1.3 Design
In this third phase, the design process of the project application interface
and coding algorithm is to be done. This phase will show the flow of the
project application.

Figure 3.3 compression model

(Soruce: Shiladitya et al., 2015)

3.1.4 Testing and Implementation

In testing and implementation stage, the working prototype of the project
application will be tested. The debugging and fixing of the application logic
and coding will be done.
Thus, implementation process will be carry out in a real environment as the
working version of the project application is done.

3.2 Summary
To summarize this chapter, project methodology will support the project
with a step by step stages that can be used in understanding the project.
Furthermore, it will help in selecting a compatible hardware and software
needed in conducting the project. Lastly, it helps in designing the project
and type of test needed in testing the project before implementing it in real
working environment.