EECS 869: Error Control Coding
Daily Schedule
  Fall 2009



Schedule:
Lecture period: MW 8:35-9:50, 1136 Learned Hall


Instructor: Prof. Erik Perrins
Office: 2020 Eaton Hall
Office hours: MW 10:00-12:00. Drop-ins at other times are always welcome but
are best scheduled via e-mail.
Office phone: 864-7370/864-7770
E-mail: e s p "at" k u . e d u



Home

Here is a link to the source code files from the textbook (if you want to download them all at once, just grab the file "error_control.zip").
Day
 Date
 Reading Assignment
 Topic
 Assignment
Mon
 		08/24
 		Chapter 1
 		Basics,
Modulation/
Demodulation
 		Project: Simulation of
Uncoded Modulations
(Due Wed. 09/02 at 5:00 pm)
Wed
 		08/26 Chapter 1
 		Modulation/
Demodulation
Mon 08/31 Chapter 1
 		Information
Theory
Wed 09/02
 		Chapter 1 and 2
 		Basic codes
Abstract algebra
 		HW#1: Problems 1.15, 1.19,
1.20, 1.24, and these two
(Due Wed. 09/09 at 5:00 pm)
Mon
 		09/07
 		---No class, Labor Day---

Wed
 		09/09
 		Chapter 2
 		Abstract Algebra
Mon
 		09/14
 		Chapter 3
 		Linear Block Codes
 		Project: Hamming Codes
(Due Wed. 09/23 at 5:00 pm)
Wed
 		09/16
 		---No class, make-up on 09/18---

Mon
 		09/21
 		Chapter 3
 		Linear Block Codes
Wed
 		09/23
 		Chapter 4
 		Cyclic Codes
 		HW#2: Problems 3.7, 3.8, 3.9
3.14, and 3.20
(Due Wed. 09/30 at 5:00 pm)
Mon
 		09/28
 		Chapter 4
 		Cyclic Codes
Wed
 		09/30
 		pp. 398-402
 		Golay Codes
 		HW#3: Problems 4.1 and 4.9 abdefghi
(Due Wed. 10/07 at 5:00 pm)
Project: Extended Golay Code
(Due Fri. 10/09 at 5:00 pm)
Mon
 		10/05
 		Chapter 5
 		Galois Fields
Wed
 		10/07
 		Chapter 5
 		Galois Fields
Mon
 		10/12
 		Chapter 5/Chapter 6
 		BCH Codes
 		HW#4: Problems 5.49, 5.63, 5.66, and 6.1
(Due Wed. 10/21 at 5:00 pm)
Project: BCH Decoder
(Due Fri. 10/23 at 5:00 pm)
Wed
 		10/14
 		Chapter 5/Chapter 6
 		BCH Codes
 		---End of Midterm #1 material---
Mon
 		10/19
 		Chapter 12 (pp. 453-461)
 		Convolutional Codes
Wed
 		10/21
 		Chapter 12 (pp. 469-510)
 		Convolutional Codes
Mon
 		10/26
 		Midterm #1

Wed
 		10/28
 		---No class, make-up with 5 min. early---

Mon
 		11/02
 		Chapter 12 (pp. 469-510) Viterbi Algorithm
 		Project: Viterbi Algorithm for CCs
(Due Wed. 11/11 at 5:00 pm)
Wed
 		11/04
 		Chapter 12 (pp. 469-510) Perf. of Conv. Codes
 		HW#5: Problem 12.1*
(Due Wed. 11/11 at 5:00 pm)
Mon
 		11/09
 		Chapter 13 (pp. 535-544)
 		TCM
 		Project: Viterbi Algorithm for TCM
(Due Mon. 11/16 at 5:00 pm)
Wed
 		11/11
 		Supplemental Papers
 		Other Trellis Algorithms
Mon
 		11/16
 		Supplemental Papers
 		Concatenated Codes/ID
 		Project: Serially Concatenated CCs
(Due Tue. 11/24 at 5:00 pm)
Wed
 		11/18
 		Chapter 15 (pp. 634-639)
 		LDPC
 		Report Topics
(Report due Thur. 12/10 at 5:00 pm)
Mon
 		11/23
 		Chapter 15 (pp. 649-653)
Appendix A (pp. 735-737)
 		LDPC
 		Project: LDPC Decoder
(Example LDPC codes)
(Due Thur. 12/10 at 5:00 pm)
Wed
 		11/25
 		---No class, Thanksgiving Break---

Mon
 		11/30
 		---No class, already made up on 11/06---

Wed
 		12/02
 		---No class, make-up with 5 min. early---

Mon
 		12/07
Report Presentations
Wed
 		12/09
Report Presentations


* Skip part (j), assume d_free = 1 and b_dfree = 1 for later parts.  For part (l), only do the Pb bound using (12,37), but also make the comparison to uncoded BPSK.  For part (m), only do the Pb bound using (12.41), also compare to uncoded BPSK.  You might like to make the (l) and (m) plots on the same plot.