Code No: 17911

FACULTY OF ENGINEERING
M.E. (ECE-DS) I Semester Regular (Make up) Examination, June / July 2019

Subject: Wireless Channel Coding Techniques

Time: 3 Hours Max. Marks: 70

Note: i) First question is compulsory and answer any four questions from the
remaining six questions. Each question carries 14 marks.
ii) Answers to each question must be written at one place only and in the
same order as they occur in the question paper.
iii) Missing data, if any, may suitable be assumed.

1. a) Define primitive field element. Test whether α5 is primitive in GF (24). [2]

oe
b) Mention the properties of standard array. [2]
c) Define syndrome polynomial. How will you calculate syndrome in cyclic codes. [2]
d) Differentiate recursive and non-recursive convolutional encoders. [2]

-c
e) Define branch metric, path metric and active path with reference to trellis
diagram. [3]
f) Differentiate regular and irregular LDPC codes. [3]
U
2. a) What is Galois field? Construct a table of GF (23) using the primitive polynomial
O
p(x)=1+x+x3. Display the power representation, polynomial representation and
vector representations of each element. [9]
b) Describe binary BCH codes. [5]
oe

3. a) The generator polynomial of a (15, 5) cyclic code is g(x)=1+x+x2+x4+x5+x8+x10. [10]

1) Find the code vector c(x) in systematic form for the message polynomial
m(x)=1+x2+x4 and draw the encoder.
-c

2) Assume that the third bit of the code vector c(x) found in part (1) suffers
transmission error, find the syndrome.
b) What are linear cyclic codes? Mention the properties of linear cyclic codes. [4]
U

4. a) Draw code tree diagram and trellis diagram for a (3, 1) convolutional code with
O

generator sequences 110, 101 and 011. [9]

b) Explain Viterbi algorithm for decoding convolutional codes. [5]

5. a) A turbo encoder is shown below. Assume a  interleave as (2 5 3 0 4 1 6 7). If

the input sequence is 11010110, find the output of the turbo encoder. [10]

…..2
 Code No: 17911/MP
-2-

b) What is Tanner graph? Assume a suitable parity check matrix of any regular
LDPC code and draw Tanner graph. [4]

6. a) A (6, 3) systematic linear block code has the following parity check equations. [10]
C4=d1+d2+d3, C5=d1+d2, C6=d1+d3+d2 where d1, d2 and d3 are message digits.
1) Construct the generator matrix.
2) Find the code word for the message vector 101.
3) If the received code vector is 000110, find the syndrome and mark on HT
matrix.
b) Prove that the minimum distance of linear block code is equal to the minimum
weight of its non-zero code word. [4]

oe
7. Write a note on the following: [14]
a) BCJR algorithm.
b) Reed-Muller Codes.

-c
******
U
O
oe
-c
U
O