Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
Compare the rate distortion performances using a one-tap and two-tap predictor.
Encode the sequence using the ppma algorithm and an adaptive arithmetic coder.
Encode using the Burrows-Wheeler transform and move-to-front coding.
A sequence is encoded using the Burrows-Wheeler transform. Given L = elbkkee, and index = 5.
What is the SNR for each of the reconstructions? Do the relative values reflect the difference in the perceptual quality?
If the sequence is random with P(0) = 0.8, compute the rate and distortion for M = 1, 2,4, 8, 16.
Generate a random binary sequence with P(0) = 0.8, and compare your simulation results with the analytical results.
Suppose there was an error in the channel and the first bit was received as a 0 instead of a 1. Decode the received sequence of bits.
For a binary source with probabilities P(0) = 0.9, P(l) = 0.1, design a Huffman code for the source obtained by blocking m bits together.
Encode the following sequence of 16 values using the Rice code with 7 = 8 and one split sample option.
Write a program for encoding images using the Rice algorithm. Use eight options, including the fundamental sequence, five split sample options.
Given a number a in the interval [0, 1) with an n-h ii binary representation.
The binary arithmetic coding approach specified in the JBIG standard can be used for coding gray-scale images via bit plane encoding.
Bit plane encoding is more effective when the pixels are encoded using a Gray code.
We will encode the sequence 1 3 2 1 with parameters shown in Table .
What is the word length required for unambiguous encoding?
Plot the difference of the rate in bits/symbol and the entropy as a function of L. Comment on the effect of L on the rate.
Discuss the trade-offs involved in selecting larger or smaller values of M.
Design and implement a digram coder for text files of interest to you.
Given an initial dictionary consisting of the letters a b r y b, encode the message using the LZW algorithm.
A sequence is encoded using the LZW algorithm and the initial dictionary shown in Table.
Assume you have a window size of 30 with a look-ahead buffer of size 15. Furthermore, assume that C{a) = 1, C{b) = 2, C{b) = 3, C{r) = 4, and C{y) = 5.
Encode the decoded sequence and make sure you get the same sequence of triples.
Write a program to compute the first-order entropy of some of the image and speech files.
Write a program that randomly selects letters from the 26-letter alphabet [a,b,..., z} and forms four-letter words.