TEACHING: Subjects

 GENERAL INFORMATION

Name:

Channel Coding.

Degree:

Telecommunication Engineering. 2nd Cyle. Optional.

Professor(s):

Luis Muñoz Gutiérrez.

Timetable:

1st Semester.
Monday (10:30 - 11:30)
Thursday (11:30 - 12:30)
Friday (10:30 - 12:30)

 OBJECTIVES

To study coding and decoding techniques associated to the most common block and convolutional codes. Hence, a short introduction to general concepts like linear codes, Hamming distance and Galois Fields is made. Afterwards, the basis for designing binary codes, BCH, and non-binary, RS, is provided as well as their application to mobile and fixed communications. Finally, convolutional codes are shown including their properties and decoding algorithms.

 SYLLABUS

Generator and parity-check matrices. Some examples: ISBN and repetition codes.

Finite fields. The channel. The decission rule. Hamming codes. Shortened and extended codes.

Coding and decoding. The Slepian Table. Matrices G and H: Hamming codes.

Detection and correction probabilities. Residual error protection.

BCH and RS codes. Some properties. Applications to GSM,DVB-S and the CD.

Decoding BCH and RS codes. Chien search. Decoding errors and erasures in BCH and RS codes.

The generator polynomial. The irreducible polynomial in the Galois Field. Syndromes evaluation. Euclid's Algorithm. Berlekamp-Massey Algorithm.

Linear convolutional codes. Constrain and memory lenght. Polynomial and matricial description. Free-error distance. Decoding convolutional codes. Trellis coded modulation.

 EVALUATION CRITERIA

Final exam in February and extraordinary exam in September.

 BIBLIOGRAPHY

Clark, J.B. Cain: “Error Correction Coding for Digital Communications”; Plenum Press, 1988

A. Michelson, A. Levesque: “Error-Control Techniques for Digital Communication”; John Wiley, 1985

 MATERIALS