Total No. of Pages : 02
Total No. of Questions : 18
--- Content provided by FirstRanker.com ---
B.Tech. (ECE) (E-1 2012 to 2017) (Sem.-6)
INFORMATION THEORY AND CODING
Subject Code : BTEC-907
M.Code : 71236
Time : 3 Hrs. Max. Marks : 60
--- Content provided by FirstRanker.com ---
INSTRUCTIONS TO CANDIDATES :
- SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
- SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
- SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions.
SECTION-A
--- Content provided by FirstRanker.com ---
Answer briefly :
- What is meant by stop-and-wait ARQ? Explain.
- An alphabet set contains 3 letters A, B, C transmitted with probabilities of 1/3, ¼, 1/4. Find entropy.
- What is meant by linear code?
- Write Lempel Ziv source coding algorithm.
- Why cyclic codes are extremely well suited for error detection?
- Define the terms Coding Efficiency and Redundancy.
- State two properties of mutual information.
- What is Source Coding? Define code length & code efficiency. Give the relation between it.
- Define Channel Capacity of the discrete memoryless channel.
- What is meant by Cyclic Code?
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
SECTION-B
- Explain briefly the syndrome calculation circuit for (n,k) cyclic code.
- Briefly describe the steps of Viterbi algorithm.
- Give the relation between channel capacity C, bandwidth W and signal to noise ratio S/N of AWGN channel. Explain the trade-off between them.
- Verify the following expression :
H(X,Y)= H(X|Y)+H(Y) - State Hartley-Shannon Law.
--- Content provided by FirstRanker.com ---
SECTION-C
- A DMS has five equally likely symbols.
--- Content provided by FirstRanker.com ---
a) Construct a Shannon- Fano code for X, and calculate the efficiency of the code.
b) Construct another Shannon- Fano code and compare the results.
c) Repeat the Huffman code and compare the results. - Explain the maximum likelihood decoding and viterbi decoding algorithms of a convolution encoder.
- For a systematic linear block code, the three parity check digits, C4, C5 and C6 are given by :
--- Content provided by FirstRanker.com ---
C4=m1 ? m2 ? m3
C5=m1 ? m2
C6=m1 ? m3
a) Construct generator matrix.
b) Construct code generated by this matrix.--- Content provided by FirstRanker.com ---
c) Determine error detecting probability.
d) Prepare decoding table.
e) Decode the received word 101100 and 000110.
NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.
--- Content provided by FirstRanker.com ---
This download link is referred from the post: PTU B.Tech Question Papers 2020 December (All Branches)
--- Content provided by FirstRanker.com ---