1. Engineering
  2. Electrical Engineering
  3. please solve the question please do not copy paste solution...

Question: please solve the question please do not copy paste solution...

Question details

1224 A discrete memoryless source x has the alphabet (-5,-3,-1,0 1,23 with the 1. Design a Huffman code for this source and find R, the average code word length corresponding probabilities (0.08,0.2,0.12,0.15,0.03,002,0.4). of the Huffman code 2. Determine the entropy of the source and, using the result of Part 1, determine the efficiency of the Huffman code you designed. The efficiency s is defined as 3. Now quantize the source using the following quantization rule 1-10, 2, X=-1,0,1 x=2.3 What is the absolute minimum required rate (bits per symbol) for perfect recon struction of x? 4. Looking at sequences of length 10,000 at the output of the quantized source (i.e., X), what is the possible number of sequences? What is the number of typ- ical sequences? before quantization (ic., taking two letters at a time), what can you say about the average code word length per individual source symbol? Find bounds on the average code word length. 5. If a Huffman code is designed for the second extension of the original source

please solve the question. please do not copy paste solution manuel of book. please write every formula

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution