Professional Documents
Culture Documents
20EC1152
20EC1152
CODING THEORY
(PROFESSIONAL ELECTIVE-I)
Course Code:20EC1152 L T P C
3 0 0 3
UNIT-I 10 Lectures
Information Theory
Amount of information, Entropy, Joint entropy, Conditional entropy, Relative entropy, Mutual
information, Relationship between entropy and mutual information,capacity of a noiseless binary
channel, binary symmetric channel, Gaussian channel, Bandwidth-SNR trade-off.
Learning outcomes: At the end of this unit the student will be able to
1. understand the concept of information (L2)
2. explain different entropies (L2)
3. determine the channel capacity for continuous channels (L3)
UNIT-II 10 Lectures
Source Coding
Classification of codes, Kraft inequality, Coding efficiency, Shannon-Fano coding, Huffman
coding, Shannon-Fano-Elias coding, Arithmetic coding, The Lempel-Ziv coding, Run-length
encoding, The JPEG Standard for Lossy Compression.
Learning outcomes: At the end of this unit the student will be able to
1. understand source coding (L2)
2. apply various source coding techniques to improve transmission efficiency (L3)
3. examine different error detection mechanisms (L3)
UNIT-III 10 Lectures
Linear Block Codes
Introduction to error control codes, error detection and correction, automatic repeat request,
forward error correction codes: systematic linear block codes encoding, syndrome decoding,
17 (R-2020)
B.Tech. in Electronics and Communication Engineering, V/VI Semesters
hamming code, construction of low density parity check codes, tanner graph, decoding of LDPC
codes.
Learning outcomes: At the end of this unit the student will be able to
1. understand the concept of error correction coding (L2)
2. construct the encoder and decoder of linear block codes (L3)
3. apply tanner graph for decoding LDPC codes (L3)
UNIT-IV 10 Lectures
Cyclic Codes
Introduction, cyclic codes generation, Matrix Description of cyclic codes, Burst error correction,
Fire codes, Golay codes, CRC codes, Circuit implementation of cyclic codes. BCH and RS
Codes Minimal Polynomials, Generator polynomials in terms of Minimal polynomials,
Examples of BCH codes, Decoding of BCH codes, R S codes, Implementation of RS encoders
and decoders.
Learning outcomes: At the end of this unit the student will be able to
1. understand the generation of cyclic codes (L2)
2. understand the implementation of cyclic codes (L2)
3. analyze decoding of BCH and RS codes (L4)
UNIT-V 10 Lectures
Convolutional and Turbo Codes
Encoding of Convolutional codes, state table, trellis structure, decoding using Viterbi algorithm,
Iterative design of Turbo codes, Decoding of Turbo codes: Iterative map method, The BCJR
algorithm.
Learning outcomes: At the end of this unit the student will be able to
1. understand the encoding of convolutional codes (L2)
2. apply Viterbi algorithm for decoding convolutional codes (L3)
3. analyze decoding of turbo codes using iterative map and BCJR algorithm (L4)
Text Books:
1. Thomas M.Cover, Joy A Thomas, Elements of Information Theory, 2nd Edition, Wiley,
2015.
2. Bose, Ranjan. Information theory, coding and cryptography, 2nd Edition, Tata
McGraw-Hill Education, 2008.
3. Lin, Shu, and Daniel J. Costello, Error control coding, 2nd Edition, Prentice hall, 2001.
References:
1. SimonHaykin, Communication Systems, 4th edition, Wiley Publications, 2001.
2. R. P. Singh, S. D. Sapre, Communication Systems, 2nd edition, Tata McGraw-Hill
Education, 2008.
18 (R-2020)
B.Tech. in Electronics and Communication Engineering, V/VI Semesters
3. K. Deergha Rao, Channel coding Techniques for wireless communications, 2nd edition,
Springer, 2019.
4. Biswas, Nripendra N. Logic design theory, Prentice-Hall, Inc., 1993.
***
19 (R-2020)