CONCORDIA UNIVERSITY
Department of Electrical and Computer Engineering
ELEC 6131 – Error Detecting and Correcting Codes

Winter 2019

Instructor:

Dr. M. R. Soleymani, Office: EV-5.125, Telephone: 848-2424 ext: 4103.

Time and Place: Tuesday, 17:45 – 20:15, Room MB S1.301.

Office Hours: Tuesday, 15:00 – 17:00

Areas to be Covered:

• Introduction to coding
• An introduction to abstract algebra
• Linear block codes
• Cyclic codes
• BCH and Reed Solomon codes
• Convolutional codes
• Overview of Turbo codes, LDPC codes and Raptor Codes.
• Space-time codes (if time permits)

Textbook:

S. Lin and D. J. Costello, Error Control Coding: Fundamentals and Applications, 2nd Edition, Prentice-Hall, 2005.

Chapters 2, 3, 4, 5, 6, 7, 11, 12 will be covered in detail.

References:

• S. B. Wicker, Error Control Systems for Digital Communication and Storage, Prentice-Hall, 1995.
• Richard E. Blahut, Algebraic Codes for Data Transmission, Cambridge University Press, 2003.
• E. R. Berlecamp, Algebraic Coding Theory, Aegean Park Press, 1984.
• G. Ungerboeck, “Channel coding with multilevel/phase signals,” IEEE Transactions on Information Theory, vol. 28, no. 1, pp. 55-67, January 1982.
• S. M. Alamouti, “A simple transmitter diversity scheme for wireless communications,” IEEE J. Select. Areas in Communications, vol. 16, pp. 1451–1458, Oct. 1998.
• V. Tarokh, N. Seshadri, and A. R. Calderbank, “Space–time codes for high data rate wireless communication: Performance analysis and code construction,”

IEEE Trans. Inform. Theory, vol. 44, pp. 744–765, March 1998.

• A. Shokrollahi, “Raptor codes,” IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2551 –2567, June 2006.
• M. R. Soleymani, et al., Turbo Coding for Satellite and Wireless Communications, Kluwer Academic Publishers, 2002.

Grading Scheme:

Project: 20% (10% literature review, 7% simulation, 3% presentation).

Midterm : 30% (March 5, 2019)

Final Examination: 50%.

· Sample Final.

IMPORTANT NOTICE:

• Exams will be closed book, only crib-sheet will be allowed.
• In order to pass the course, you should get at least 60% in the final.
• Failing to write a Midterm results in losing the 30% assigned to the test.

Course Notes:

• Lecture 1.
• Lecture 2.
• Lecture 3.
• Lecture 4.
• Lecture 5
• Lecture 6
• Lecture 7
• Lecture 8
• Lecture 9
• Lecture 10
• RS Decoding (copied from Error correction coding: mathematical methods and algorithms By Todd K. Moon).

Other Material:

• Group Theory and Rubik’s Cubes.

Homework:

• Several homework assignments will be assigned during the semester.
• You will be given the solutions to these assignments also tutorials may be scheduled to discuss the problems.
• While there is no credit for the assignments it is essential that you do these problems diligently in order to be prepared for the midterm and final exams.

LIST OF ASSIGNMENTS:

Assignment 1.

· Solution to Assignment 1:

Assignment 2.

· Solution to Assignment 2:

Assignment 3.

· Solution to Assignment 3:

Assignment 4.

· Solution to Assignment 4:

Assignment 5.

· Solution to Assignment 5:

Assignment 6.

· Solution to Assignment 6:

Assignment 7.

· Solution to Assignment 7:

Assignment 8.

· Solution to Assignment 8:

Suggested Project Topics:

· Algebraic decoding of Reed Solomon Codes.

· Frequency Domain decoding of Reed Solomon Codes.

· Turbo Coding/Decoding.

· LDPC codes.

· Raptor Codes for erasure channels.

· Raptor Codes over binary symmetric channels.

· Space-time codes.