INSTITUTE FOR TELECOMMUNICATIONS RESEARCH

EEET 5099 - Error Control Coding G 2012

News:

19 Dec 2011: All relevant information will be distributed through this web site. Please check this section of the site on a regular basis to be up to date with available material.

2009 Exam.
2010 Exam.
2011 Exam.

All assignments are to be handed in during the lecture. Any assignments submitted after the lecture will not be accepted, unless accompanied with the usual paper work (doctor's certificate, etc.).

If you are unable to submit the assignment at the lecture, then you must give the assignment to the ITR secretary, located in Room W2-01 before the due date and time and advise me by email so that I can collect the assignment.

Completing the assignments is an important part of the learning process for this course. Pay heed to the saying "I was told and I forgot. I saw and I remembered. I did and I understood." You should put in the work in completing the assignments. Working in groups to complete the assignment is OK, but at the end of working the problem you must write down your own answer and not just copy someone else's work, as this defeats the point of the excercise.

Assignment 1. Due 9:10 am Tuesday 27 March 2012.

The chapter section numbers from Lin & Costello are given for each lecture.

• Lecture 1: 1.1, 1.2, 1.3, and 1.5.
• Lecture 2: 2.7, 3.1, 3.3 (up to Theorem 3.1), and 1.4.
• Lecture 3: 3.4, 3.3 (from Theorem 3.2), and 3.2.
• Lecture 4: 3.5.
• Lecture 5: 11.1, 11.2
• Lecture 6: 12.1
• Lecture 7: 12.2, 12.3, 5.1
• Lecture 8: 5.2, 5.3
• Lecture 9: 5.5, 6.1, 7.3, 16.1
• Lecture 10: 14.4
• Lecture 11: 14.5, 14.6, 16.5, 17.1

Postgraduate students can enrol using the postgraduate student enrolment system.

Lecturer:

Dr. Steven S. Pietrobon
Institute for Telecommunications Research
SPRI Building, Room 2-2
email: Steven.Pietrobon@unisa.edu.au
Office hours: Tuesday, after lecture.

Traditional lectures will be given where basic theory and important concepts are presented in order to complement and support the course textbook. However, the lectures will not cover all relevant material. There will be subject matters, which are left for self-study of the course textbook.

Lectures are given once a week:

• Tuesday 9:10 am to 11:00 am (SPRI Lecture Theatre, Building W, Room MLK/W1-06)

Assignments: Students will be required to complete four assignments. Assignments should be submitted to the lecturer at the beginning of the lecture on the due date of the assignment. They will be returned to you at the lecture within approximately two weeks of the due date. Assignments submitted after the due date will not be accepted and will be given zero marks. Each assignment will be marked out of a total of 20 marks and will count towards 12.5% of the overall mark.

Final Exam: The final exam will assess knowledge of concepts and principles of error control coding, according to the following rule of thumb:

• Use the lecture notes and the textbook to become comfortable with the material such that general concepts and principles are well understood and can be applied. Some simple calculations may be required.

The exam is closed-book. No material is allowed at the exam, with the exception of a basic calculator, a printed English dictionary or a bilingual printed dictionary.

Shu Lin and Daniel J. Costello, Jr., "Error Control Coding (2nd Edition)," Prentice Hall, 2004, ISBN 0-13-017973-6. (Available at Unibooks)

To examine the theory of error correcting codes and their applications in error control systems used in digital transmission and computer storage.

On completion of this subject, the student should be able to:

• describe the algebraic structure of block and convolutional codes;
• understand encoding and decoding procedures for cyclic, convolutional, turbo and LDPC codes, and;
• identify the appropriate choice of coding scheme for various applications.

• Fundamental Properties of Codes: introduction to error detection and correction, types of codes, minimum distance, vector algebra, abelian groups, binary fields.
• Block Coding Principles: generator matrix description, systematic codes, detection and correction bounds, Hamming and Golay codes.
• Decoding Block Codes: parity check matrix, syndrome calculation, cosets, standard array, minimum weight theorems.
• Convolutional Codes: encoders, generator polynomials, constraint length, state diagrams, tree and trellis diagrams, distance measures.
• Decoding Convolutional Codes: Viterbi and MAP algorithms, soft-decision decoding.
• Cyclic Codes: polynomial representation, extension field theory, generator theorems, systematic codes, generator circuits, syndrome calculation, error trapping, BCH and Reed-Solomon codes.
• Turbo and LDPC codes: encoder structures, iterative decoding, extrinsic information, EXIT charts.