Question: In this exercise, Huffman coding will be applied to compress pcm.wav le. The program steps are as follows: 1. Read pcm.wav le into vector y
In this exercise, Huffman coding will be applied to compress pcm.wav le. The program steps are as follows: 1. Read pcm.wav le into vector y (you can truncate the original data to the desired length); 2. Quantize y into 8 levels (level 0-7) using uniform quantization; 3. Find the probability of each symbol (8 symbols: level 0-7); construct the Huffman tree; calculate the entropy of the source. 4. Encode the symbols and form the bit stream. 5. Calculate the coding efciency (average length of bits/symbol over entropy), and compression ratio compared with PCMencoding.
Write a programto decode the Huffman-coded bit streamgiven the Huffman table. Run this program on your coded data in part I and compare the decoded symbols with the transmitted ones.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
