Project 1 dealt with single symbol Huffman Coding. Project 2 deals with Extended Huffman Codes. For instance, for a source emitting two symbols A and B, the second order extension involves coding messages AA, AB, BA and BB (22 in number). The third order extension involves messages such as AAA, AAB, etc. (23 in number). The probabilities of such strings are computed by multiplying the individual probabilities. For this project, use the Matlab code you have developed in Project 1 to perform third, fourth and fifth order extensions of a source message. 1. Choose an alphabet a set of at least six (6) symbols with assigned probabilities. 2. Compute the third, fourth and fifth order extension probabilities. 3. Using the built-in algorithm, derive the Huffman Code for each extension. 4. Compute the following quantities: (i) Average length of the codeword; (ii) The code
Project 1 dealt with single symbol Huffman Coding. Project 2 deals with Extended Huffman
Codes. For instance, for a source emitting two symbols A and B, the second order extension
involves coding messages AA, AB, BA and BB (22 in number). The third order extension
involves messages such as AAA, AAB, etc. (23 in number). The probabilities of such strings are
computed by multiplying the individual probabilities.
For this project, use the Matlab code you have developed in Project 1 to perform third, fourth
and fifth order extensions of a source message.
1. Choose an alphabet a set of at least six (6) symbols with assigned probabilities.
2. Compute the third, fourth and fifth order extension probabilities.
3. Using the built-in
4. Compute the following quantities: (i) Average length of the codeword; (ii) The code
efficiency; (iii) The Compression Ratio; (iv) Speed of computation.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
