Skip to Secondary Navigation | Skip To Content

525.707 - Error Control Coding Course Homepage

Instructor Information

A. Roger Hammons

Work Phone: (443) 778-8496

Course Information

Course Description

This course presents error-control coding with a view toward applying it as part of the overall design of a data communication or storage and retrieval system. Block, trellis, and turbo codes and associated decoding techniques are covered. Topics inlcude system models, generator and parity check matrix representation of block codes, general decoding principles, cyclic codes, an introduction to abstract algebra and Galois fields, BCH and Reed-Solomon codes, analytical and graphical representation of convolutional codes, performance bounds, examples of good codes, Viterbi decoding, BCJR algorithm, turbo codes, and turbo code decoding.

Prerequisites

Background in linear algebra, such as 625.409 Linear Algebra; in probability, such as 525.414 Probability and Stochastic Processes for Engineers; and indigital communications, such as 525.416 Communication Systems Engineering. Familiarity with MATLAB or similar programming capability.

Course Goal

To develop the mathematical and algorithmic foundations of the error detecting and error correcting codes used in modern communications systems. 

Course Objectives

  • By the end of the course, the successful student should be able to:

    Identify the major classes of error detecting and error correcting codes and how they are used in practice. 

  • Specify specific error detecting and error correcting codes in a precise mathematical manner. 

  • Develop and execute encoding and decoding algorithms associated with the major classes of error detecting and error correcting codes. 

When This Course is Typically Offered

This course is usually offered once each year in the fall term at the Applied Physics Laboratory in Laurel, Maryland.

Syllabus

Topics Covered

  • Limits of Communications
  • Block Codes
  • Cyclic Codes
  • Galois Fields
  • BCH Codes
  • Reed-Solomon Codes
  • Convolutional Codes
  • Turbo Codes

Student Assessment Criteria

Homework (6-8 assignments self-graded) 0%
Midterm 50%
Final 50%

Although homework is not graded, it is a very important component of the course.  The mathematical nature of the subject is best learned through attempts to solve problems such as found in the homework. 

Exams are generally in-class, closed-book, closed-notes.  The final exam is comprehensive but generally emphasizes the material since the midterm. 

Textbooks

Textbook information for this course is available online through the MBS Direct Virtual Bookstore.

Course Notes

There are no notes for this course.

(Last Modified: 08-25-2009 at 3:51:28 PM)