Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
ON
A Project Report
Submitted in Partial Fulfillment of the Requirements
For the award of the Degree of
Bachelor of Technology in
Electronics & Communication Engineering (ECE)
By
K.SAI SANDEEP 14311A0464
K.SAI RAM 14311A0465
G. SAI KRISHNA 14311A0466
B.Tech III year I semester
Chapter 1 INTRODUCTION
1.1 Aim of the project
• Introduction to Shannon Fannon Coding
• Shannon-Fano Algorithm
1.4 Example
Chapter 2 MATLAB
2.1 Introduction
Chapter 3 RESULT
3.1 Source code
3.2 Output
3.3 Output Waveforms
CHAPTER 1
INTRODUCTION
At about 1960 Claude E. Shannon (MIT) and Robert M. Fano (Bell Laboratories)
had developed a coding procedure to generate a binary code tree. The procedure
evaluates the symbol's probability and assigns code words with a corresponding
code length.
1.4 EXAMPLE :
Freq- 1. Step 2. Step 3. Step
Symbol quency Sum Kode Sum Kode Sum Kode
-----------------------------------------------
A 24 24 0 24 00
----------
B 12 36 0 12 01
--------------------------
C 10 26 1 10 10
----------------------
D 8 16 1 16 16 110
-----------
E 8 8 1 8 8 111
CHAPTER 2
MATLAB
2.1 INTRODUCTION
CHAPTER 3
RESULT
3.2 OUTPUT
3.3 OUTPUT WAVEFORMS