Scribd
Upload
6 views

ITC Midesm

Uploaded by

gowrianand24
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

ITC Midesm

Uploaded by

gowrianand24
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ITC-2021

Midsem

Q. 1 BITS Pilani Goa campus has organized a sport series between EEE and CSE department,
which is denoted by E and C, respectively. Let X is considered as a random variable which
represents the series outcome between team ‘E’ and team ‘C’. The possible values of X are
AAAA, BABABAB, BBBAAAA. Let Y denotes the number of games played, which ranges
from 4 to 7. Assuming E and C are equally matched and that the games are independent,
calculate H(X), H(Y), H(Y/X), and H(X/Y).

Q. 2(a) An input alphabet (a keyboard on a word processor) consists of 100 characters.

(i) If the keystrokes are encoded by a fixed-length code, determine the required number of bits
for the encoding.

(ii) We make the simplifying assumption that 10 of the keystrokes are equally likely and that
each occurs with probability 0.05. We also assume that the remaining 90 keystrokes are equally
likely. Determine the average number of bits required to encode this alphabet using a variable-
length Huffman code. {Hint: you can consider 90 keystrokes together.}

(b) A DMS has three output symbols with probabilities {0.5, 0.4, 0.1}. Determine the Huffman
code for this source taking two symbols at a time and find the efficiency.

Q. 3 The input source to a noisy communication channel is a random variable X over the four
symbols a, b, c, d. The output from this channel is a random variable Y over these same four
symbols. The joint distribution of these two random variables is as follows:

(i) Write down the marginal distribution for X and compute the marginal entropy H(X) in bits.

(ii) Write down the marginal distribution for Y and compute the marginal entropy H(Y) in bits.

(iii) What is the joint entropy H(X, Y) of the two random variables in bits?

(iv) What is the conditional entropy H(Y | X) in bits?

(v) What is the mutual information I(X ; Y) between the two random variables in bits?
Q. 4 An information source X generates the 5 symbols with different probabilities as shown
below.

a= 0.4, b=0.4, c=0.12, d=0.06, e=0.02.

Encode the source symbols using Arithmetic and Huffman coding. Determine efficiency
and comment on the performance of each code.

Q. 5 (a) Consider the following binary sequence 01001111100101000001010101100110000.


Use the Lempel-Ziv algorithm to encode this sequence.

(b) Consider a telegraph source having two symbols dot and dash. The dot duration is 0.2 sec, the
dash duration is 3 times the dot duration. The probability of dot occurring is twice that of dash
and the time between symbols is 0.2 sec. Calculate the information rate of telegraph source.

Q. 6 (a) Write a short note on JPEG standard for Lossy compression. Consider a 4x4 DCT
transformed image which includes DC coefficient, Low and high frequency coefficients. DC
component is 5.11 and the highest frequency component is 0.01, other non-zeros components can
be chosen appropriately. Determine the coded pattern after using quantization followed by zig-
zag coding on DCT matrix.

(b) Determine the Shannon Fano Elias code for the probability distributions: {0.25, 0.25, 0.20,
0.15, 0.15}.

You might also like