Scribd
Upload
11 views

Coding Theory and Practice

The document discusses coding theory and practice for an electronics and communications exam. It includes questions on source coding, error control codes, linear block codes, cyclic codes, groups, convolutional codes, Reed-Solomon codes, BCH codes, code interleavers, and codes for magnetic recording.

Uploaded by

sudhakar k
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
11 views

Coding Theory and Practice

The document discusses coding theory and practice for an electronics and communications exam. It includes questions on source coding, error control codes, linear block codes, cyclic codes, groups, convolutional codes, Reed-Solomon codes, BCH codes, code interleavers, and codes for magnetic recording.

Uploaded by

sudhakar k
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/ 1

www.jntuworld.

com

NR
Code No: A7005
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
M.Tech I Semester Regular Examinations March/April 2010
CODING THEORY AND PRACTICE
(ELECTRONICS & COMMUNICATIONS)
Time: 3hours Max.Marks:60
Answer any five questions
All questions carry equal marks
---
1.a) What is source coding?
b) Show that the efficiency of an extended binary source code of order of extension ‘n’ is
given by nH(x) / , where the average code word length and H (x) is entropy of the
message ensemble.
c) A set of 5 alphabets has corresponding probabilities as P = {0.30, 0.32, 0.20, 0.14, 0.04},
Calculate the entropy of the signal.

2.a) Define coding gain of an error control code.


b) Use the relationship between the number of bits in the code word, ‘n’ and the No.of

c)
large values of ‘n’.
List the limitations of error correcting Hamming codes.
D
check bits ‘k’ of an (n, k) Hamming code to show that the code rate approaches unity for

L
3.a)
using parity check equations
O R
Draw the circuit diagram of a (6, 3) systematic Linear Block Code encoder generated

P0 = U0 XOR U2; P1 = U0 XOR U1; P2 = U1 XOR U2


b)

c)
example.

U W
Define perfect codes. Describe the characteristics of perfect codes through a suitable

If the minimum distance of a Linear Block Code is 9, Comment on the error detecting

T
and correcting capabilities of this code.

4.a)

b)

c)
N
Design a (7, 4) binary Cyclic encoder generated based on the polynomial
g(x) = 1 + x + x3.

J
Discuss the decoding procedure of a binary cyclic code with the help of a suitable
example.
What are shortened cyclic codes?

5.a) Define a Group. List all the possible binary operations on groups.
b) Generate Modulo-5 addition and Modulo-5 multiplication tables for groups.
c) Prove that every finite field has a primitive element.

6.a) Construct a code tree diagram to decode a received bit sequence of 1010 for the rate 1/3
convolution encoder specified with output sequence v1, v2, v3 given through
v1 = s1 XOR s2 XOR s3; v2 = s1 and v3 = s1 XOR s2
b) Describe the steps involved in the decoding procedure according to viterbi algorithm.

7.a) Describe Berkelamp algorithm to decode Reed-Solomon codes.


b) Compare and contrast the algorithms for decoding of BCH codes.

8. Describe the following briefly.


a) Code Intereavers.
b) Code for magnetic recording.
---o0o---
www.jntuworld.com

You might also like