Scribd
Upload
86 views3 pages

Question Paper Code:: Reg. No.

1. The document is a question paper for an Information Technology exam covering topics like information coding techniques, modulation, source coding, channel coding, speech coding and video coding. 2. It contains 15 questions divided into 2 sections - 10 short answer questions in Part A and 5 long answer questions in Part B. 3. The long answer questions in Part B involve topics like delta modulation, Huffman coding, cyclic codes, image compression standards like JPEG, video compression techniques and speech coding models.

Uploaded by

Saravanan Sadhasivam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
86 views3 pages

Question Paper Code:: Reg. No.

1. The document is a question paper for an Information Technology exam covering topics like information coding techniques, modulation, source coding, channel coding, speech coding and video coding. 2. It contains 15 questions divided into 2 sections - 10 short answer questions in Part A and 5 long answer questions in Part B. 3. The long answer questions in Part B involve topics like delta modulation, Huffman coding, cyclic codes, image compression standards like JPEG, video compression techniques and speech coding models.

Uploaded by

Saravanan Sadhasivam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

*64430*

Reg. No. :

Question Paper Code : X 64430

B.E./B.Tech. Degree Examinations, NOV./DEC. 2020


Fifth Semester
Information Technology
if 356 – information coding techniques
(Regulations 2001)

Time : Three Hours Maximum : 100 Marks

Answer all questions

Part – A (10×2=20 Marks)

1. State channel capacity theorem.

2. An alphabet set contains 3 letters A, B and C transmitted with probabilities of


1/3, 1/4, 1/4 find entropy.

3. Define sampling theorem.

4. State how digital modulation systems transmit analog message signals.

5. Why cyclic codes are extremely well suited for error detection ?

6. What is Hamming code ?

7. Why differential encoding is carried out only for DC coefficient in JPEG ?

8. Differentiate ‘makeup codes’ and ‘termination codes’ in digitization documents.

9. Give an account of frequency masking.

10. What is Dolby AC–1 ?

Part – B (5×16=80 Marks)

11. a) What is modulation ? Explain how the Adaptic delta modulator works with
different algorithms. (16)
(OR)
b) Compare delta modulation with adaptive delta modulation. (16)
X 64430 -2- *64430*

12. a) Construct a Huffman code binary (D = 2) for the following messages


[X] = [x1, x2, x3, x4, x5, x6, x7, x8]
[P(x)] = (.22,.2,.18,.15,.10,.08,.05,.02)
Determine the average length of encoded messages and find the coding
efficiency. (16)
(OR)
b) i) A subband coding scheme has a total of 7 subbands. The sampling rate for
the all band input signal is 8 KHz and the average number of bits used to
encode a sample of the input is 2. Calculate (a) The sampling rate for each
subband and (b) Total number of bits/sample. (10)
ii) Consider the four codes listed below :
Symbol Code I Code II Code III Code IV
S0 0 0 0 00
S1 10 01 01 01
S2 110 001 011 10
S3 1110 0010 110 110
S4 1111 0011 111 111
Identify the prefix coded and construct their decision trees and find probability
of each symbol. (6)

13. a) i) Using the generator polynomial g(x) = 1 + x + x3, generate a systematic code
word from the (7, 4) code word set for the message vector m = 1011. (4)

ii) Construct an (n – k) stage cyclic encoder for an (n – k) binary cyclic code


generated by g(x) = l + g1x + g2x2 + ..... + gn–k–1xn–k–1 + xn–k. Briefly explain about
the encoding operation and verity its operation using information given in
part. (i) (12)
(OR)
b) Consider the convolutional encoder shown in Fig. 13 (b)


Fig. 13 (b)
*64430* -3- X 64430

i) Find the output code word if the input sequence is all 1’s. (11111..). (8)
ii) Consider that the given encoder is used over a binary symmetric channel
(BSC). Assume that the initial encoder state is the 00 state. At the output
of the BSC, the received sequence is r = (1100000111 rest all 0). Find the
maximum likelihood path through the trellis diagram and determine the first
5 decoded data bits. (8)

14. a) Compare and constrast the following :


i) File formats
1) TIFF
2) GIF
3) PNG and
4) JPG. (8)
ii) List out the significance Discrete Cosine Transform (DCT) and why it is
preferred to JPEG. Calculate DCT for the input image [l 2 ; 3 4]. (8)
(OR)
b) i) For the probability model shown in the table :
Letter Probability
a1 0.2
a2 0.3
a3 0.5
Decode a sequence of length 10 with the tag 0.63215699. (8)
ii) Consider a source A that generates letters form an alphabet of size four,
1 1
A = {a1, a2, a3, a4} probabilities p(a1 ) = , p(a2 ) = p(a3) = 1/8, p(a4) = 1/8.
2 4
Generate a binary code for this source. (8)

15. a) i) Explain the Linear Predictive Coding (LPC) model of analysis and synthesis
of speech signal. (8)
ii) Explain the encoding procedure of I, P and B frames in video coding with
suitable diagrams. (8)
(OR)
b) Explain in details about perceptual coding. (16)

________________

You might also like