School of Electronics Engineering

Continuous Assessment Test – II

ECE4007-Information theory and Coding
Class Number: VL2021220102190 Slot: C1+TC1
Faculty: Dr. K.S.Preetha Date: 26-10-2021
Exam Duration: 08.30 to 09.30 AM Maximum Marks: 30

Instruction: Answer all questions

SET A

1 Encode the given DCT matrix by using JPEG procedure. Consider uniform 10
quantization with Q = 8. DC coefficient is converted into an 8 bit binary bit and AC
coefficients are encoded using Shannon Fano coding. Justify your answer by
measuring the compression ratio.

1480 26 9.5 8.9 −26.4 15.1 −8.1 0.3

11 8.3 −8.2 3.8 −8.4 −6 −2.8 10.6
−5.5 4.5 9 5.3 −8 4 −5.1 4.9
10.7 9.8 4.9 −8.3 −2.1 −1.9 2.8 −8.1
𝐹 (𝑥, 𝑦) =
1.6 1.4 8.2 4.3 3.4 4.1 −7.9 1
−4.5 −5 −6.4 4.1 −4.4 1.8 −3.2 2.1
5.9 5.8 2.4 2.8 −2 5.9 3.2 1.1
[ −3 2.5 −1 0.7 4.1 −6.1 6 5.7 ]
2 The Prancing Horse symbol used by World War I pilot Francesco Baracca on his 10
airplane was later adapted by a manufacturer. The manufacturer name is encoded
using adaptive Huffman code to get the following code.

′ 𝟎𝟎𝟏𝟎𝟏𝟎𝟎𝟎𝟏𝟎𝟎𝟎𝟎𝟏𝟎𝟎𝟎𝟏𝟏𝟎𝟏𝟏𝟏𝟎𝟎𝟎𝟎𝟎𝟎𝟏𝟏𝟏𝟏𝟏𝟎𝟎𝟎𝟏𝟎𝟎𝟎 ′

Decode it and find the manufacturer name.

3 The parity check bits of (8,4) block code are generated by 10

c5 = d1 ⨁ d2 ⨁ d4
c6 = d1 ⨁ d2 ⨁ d3
c7 = d1 ⨁ d3 ⨁ d4
c8 = d2 ⨁ d3 ⨁ d4

where d1, d2, d3 and d4 are the message bits.

 i) Find the generator matrix and the parity check matrix for this code.
ii) Draw the encoder circuit and syndrome circuit

SET B

1 Generate the tag for the encoder output 110110101100101 and decode a five letter string 10
for the given probability distribution shown in Table 1 using Arithmetic Coding.
Table 1: Probability distribution

Symbol Probability
A 0.2
B 0.1
C 0.2
D 0.05
E 0.3
F 0.05
! 0.1
2 Two young British soldiers during the First World War, who are ordered by General 10
Erinmore to deliver a message to Colonel Mackenzie during Operation Alberich in
1917. This message is especially important to one of the young soldiers, as his
brother is taking part in the pending attack. The message is encoded as
[𝟐, 𝟕, 𝟓, 𝟕, 𝟔, 𝟑, 𝟓, 𝟖, 𝟐, 𝟏, 𝟓, 𝟏𝟏, 𝟒, 𝟒, 𝟏𝟔, 𝟏𝟖, 𝟐𝟎, 𝟒] using LZW algorithm with
the following initial dictionary as shown in Table 2. Help Colonel Mackenzie to
decode the message.

Table 2: Initial dictionary

1 A
2 C
3 E
4 F
5 L
6 N
7 0
8 Space
3 A (15,5) cyclic code has a generator polynomial as follows: 10

𝐺(𝑃) = 𝑃10 + 𝑃8 + 𝑃5 + 𝑃2 + 𝑃 + 1

i) Draw the encoder schematic.

ii) Find the code vector polynomial (in systematic form) for the message 𝑀(𝑃) = 𝑃4 +
𝑃2 + 1
 School of Electronics Engineering
Continuous Assessment Test – II
ECE4007-Information theory and Coding
Class Number: VL2021220102192 Slot: C2+TC2
Faculty: Dr. K.S.Preetha Date: 26-10-2021
Exam Duration: 02.00 to 03.00 PM Maximum Marks: 30

Instruction: Answer all questions

SET A

1 Construct an arithmetic code in real decimal number for the word “ 𝑩𝑨𝑫𝑪𝑨𝑩$ ” 10
for the given probability distribution shown in Table 1.

Table 1: Probability distribution

Symbol Probability
A 0.2
B 0.1
C 0.2
D 0.05
E 0.3
F 0.05
$ 0.1
2 Encode the following string using adaptive Huffman encoding procedure. 10
String: “ 𝒃𝒊𝒈𝒃𝒐𝒔𝒔 ”.
3 A parity check code has the parity check matrix 10

1 0 1 1 0 0
𝐻 = [1 1 0 0 1 0]
0 1 1 0 0 1

a) Determine the generator matrix G.

b) Draw the encoder and the syndrome circuits.
c) Suppose that the received word is 110110. Decode this received word.
 SET B

1 Encode the given DCT matrix by using JPEG procedure. Consider uniform 10
quantization with Q = 35. DC coefficient is converted into an 8 bit binary bit and
AC coefficients are encoded using Shannon Fano coding. Justify your answer by
measuring the compression ratio.

256 −35 52 −30 −7 −27 10 −3

141 11 −62 11 56 14 5 −5
41 −54 48 98 −35 −19 −14 8
−22 −16 56 48 −48 17 −24 −3
𝐹 (𝑥, 𝑦) =
−4 5 −6 −16 14 −15 −15 9
−10 20 −11 9 −7 −15 22 12
−9 12 −12 5 −4 0 14 3
[ −2 6 −2 3 −3 0 8 −2]

2 Decode the sequence from the output of the Lempel Ziv encoder as [0, V], [0, I], 10
[0, T], [0, -], [3, b], [1, I], [3, T], [2, b], [6, T], [4, b], [9, T], [8, V], [0, U], [13, b], [1,
U], [14, V], [13, U].
3 Design a feedback shift register encoder for a (8, 5) cyclic code with a generator 10
polynomial 𝐺(𝑃) = 𝑃3 + 𝑃2 + 𝑃 + 1 . Use the encoder to find the code word for
the message 1 0 1 0 1 in systematic form.