Explain the predictive coding scheme with the help of the following sequence:
27 28 29 28 26 27 29 28 30 32 34 36 38

Explain the steps to derive average information with an example.

Explain the minimum variance of Huffman coding procedure with an example.

Describe the procedure for the adaptive Huffman coding algorithm, with the help of a suitable flow chart.

Design a 3-bit Tunstall code for a memoryless source with the following alphabet:
A
=0·6, =0·3, =0·1.

Explain the converse of the Rate distortion theorem.

4. Describe the LZW algorithm for building adaptive dictionary. Using this approach, encode the following sequence

wabbafwabbafwabbafwabbafwoofwoofwoofwoo

where f represents space.

5. Encode the following sequence using Prediction with Partial Match algorithm:

this is the tithe

Assume the necessary count and cum-count arrays. Given that the word length is to be 6 and represents space.

6. Differentiate between uniform and non-uniform quantization with example.

Explain discrete convolution' with appropriate flow diagram.

What is Karhunen-Loeve Transform Explain in brief.

8. Explain the different analysis and synthesis schemes for Audio Signals.

9. Describe the following in brief:

Burrows-Wheeler Transform

Tree structured Vector Quantizers

10. Write short notes on the following:

Discrete Cosine Transform

Sub-band Coding Algorithm