Scribd
Upload
10 views

Huffman Coding and Encoding Data Methods

HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH

Uploaded by

احمد السيد
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views

Huffman Coding and Encoding Data Methods

HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH

Uploaded by

احمد السيد
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

‫‪Huffman Coding and Encoding Data Methods‬‬

‫األسماء‪:‬‬
‫عبدالله ناصر السبيعي (‪)44253965‬‬ ‫‪.1‬‬
‫عبدالرحمن دخيل السبيعي (‪)44203048‬‬ ‫‪.2‬‬
‫مفرح فهد السبيعي (‪)44253582‬‬ ‫‪.3‬‬

‫التخصص‪ :‬علوم حاسب‬

‫الدكتور‪ :‬د‪ .‬حمزة فرج‬

‫‪:Abstract‬‬
This project explores the implementation of Huffman Coding, a widely-
used data compression technique, in MATLAB. Huffman Coding
provides a lossless method for data encoding by assigning variable-
length binary codes to characters based on their frequency in a dataset,
ensuring minimal redundancy. The project covers the entire process,
from frequency analysis of input data to tree construction, code
generation, and data encoding. Additionally, it evaluates the
performance of Huffman Coding compared to other encoding methods
in terms of compression ratio and computational efficiency. The results
demonstrate the practicality of Huffman Coding in optimizing storage
and transmission of data while preserving data integrity.
Keywords: Huffman Coding, Data Compression, Lossless Encoding,
MATLAB, Binary Codes, Encoding Efficiency, Compression Ratio, Data
Optimization
:Introduction
Efficient data storage and transmission are critical in modern
computing, where vast amounts of information are generated and
shared daily. Data compression techniques aim to reduce the size of
data while maintaining its integrity, enhancing storage utilization and
reducing transmission bandwidth. Among these techniques, Huffman
Coding stands out as a foundational algorithm for lossless data
compression due to its simplicity and effectiveness. Huffman Coding
assigns variable-length binary codes to characters based on their
frequency in the input dataset, with frequently occurring characters
receiving shorter codes. This ensures optimal use of storage space
while maintaining the original data's fidelity upon decompression. The
algorithm leverages a binary tree structure, known as the Huffman
Tree, to generate these codes systematically.
This project delves into the practical implementation of Huffman
Coding using MATLAB, a powerful platform for numerical computation
and algorithm development. It includes analyzing the frequency of
characters, constructing the Huffman Tree, generating binary codes,
and encoding data. Furthermore, the project compares Huffman Coding
with other encoding methods, highlighting its advantages in terms of
compression efficiency and computational simplicity. By exploring the
principles and applications of Huffman Coding, this project contributes
to a deeper understanding of data compression methods and their
relevance in solving real-world challenges in data management and
communication systems.
Implementation:
1-MATLAB Code:
Below is the MATLAB implementation of Huffman Coding. The code
takes input data, calculates the frequency of each character, builds a
Huffman Tree, assigns binary codes, and encodes the data.
% Huffman Coding and Encoding without User-Defined Functions

% Input Data
data = 'hello huffman coding';

% Step 1: Calculate frequency of each symbol


symbols = unique(data); % Unique symbols in the data
freq = histc(data, symbols); % Frequency of each symbol

% Step 2: Build the Huffman Tree


nodes = struct('symbol', num2cell(symbols), 'freq', num2cell(freq), 'left',
[], 'right', []);
while length(nodes) > 1
% Sort nodes by frequency
[~, idx] = sort([nodes.freq]);
nodes = nodes(idx);

% Merge two nodes with the lowest frequency


left = nodes(1);
right = nodes(2);
newNode = struct('symbol', '', 'freq', left.freq + right.freq, 'left',
left, 'right', right);
nodes = [newNode, nodes(3:end)];
end
huffmanTree = nodes(1);

% Step 3: Generate Huffman Codes


codes = containers.Map; % To store the Huffman codes
stack = {huffmanTree, ''}; % Stack for iterative tree traversal
while ~isempty(stack)
currentNode = stack{1};
currentCode = stack{2};
stack = stack(3:end);

if isempty(currentNode.left) && isempty(currentNode.right)


codes(currentNode.symbol) = currentCode; % Leaf node
else
stack = [{currentNode.left, strcat(currentCode, '0')},
{currentNode.right, strcat(currentCode, '1')}, stack];
end
end

% Step 4: Encode the Data


encodedData = '';
for i = 1:length(data)
encodedData = strcat(encodedData, codes(data(i)));
end

% Step 5: Decode the Data


decodedData = '';
currentNode = huffmanTree;
for i = 1:length(encodedData)
if encodedData(i) == '0'
currentNode = currentNode.left;
else
currentNode = currentNode.right;
end

if isempty(currentNode.left) && isempty(currentNode.right)


decodedData = strcat(decodedData, currentNode.symbol);
currentNode = huffmanTree;
end
end

% Display Results
disp('Original Data:');
disp(data);

disp('Huffman Codes:');
disp(codes);

disp('Encoded Data:');
disp(encodedData);

disp('Decoded Data:');
disp(decodedData);

2-Result:
Conclusion:
The implementation of Huffman Coding in MATLAB demonstrates the
efficiency and practicality of this lossless data compression technique.
By assigning variable-length binary codes based on character
frequency, Huffman Coding achieves significant reductions in data size
while ensuring no loss of information. The project successfully outlined
the steps involved, from frequency analysis and tree construction to
code generation and data encoding, providing a comprehensive
understanding of the algorithm's workflow.Through this project, it is
evident that Huffman Coding is not only computationally efficient but
also highly adaptable for various data types and compression needs.
MATLAB proved to be a robust tool for implementing and visualizing
the process, offering insight into the algorithm's performance and
benefits. Future work could extend this project by exploring variations
of Huffman Coding, such as adaptive Huffman Coding, or by integrating
it with other compression techniques to evaluate hybrid
methods.Overall, this project underscores the importance of efficient
data encoding methods like Huffman Coding in modern computing,
where storage optimization and transmission efficiency are critical.

References:
1. Moffat, A. (2019). Huffman coding. ACM Computing Surveys
(CSUR), 52(4), 1-35.
2. Arshad, R., Saleem, A., & Khan, D. (2016, August). Performance
comparison of Huffman coding and double Huffman coding.
In 2016 Sixth International Conference on Innovative Computing
Technology (INTECH) (pp. 361-364). IEEE.

You might also like