August 29: Please begin reading the Ziemer/Peterson textbook.
If you don't have a copy of the text yet,
PDF files of the preface, table of contents, and
chapter 1 are available on the web at
Chapter 1 of text
Please browse chapter 1, paying particular attention to sections 1.1
Also, browse the links to web sites related to communications on the course home page, and browse the materials about Claude Shannon under Class Notes on the course home page.
September 5: Please solve problems 1-2 and 1-4 in the Ziemer/Peterson text, and submit your solutions on Monday, September 10.
September 10: Please begin reading Chapter 6 as follows:
Section 6.2.1, pp. 368-370 (We will not study source coding, which is also called compression, at this time. But source coding is a good topic for your project for this course.)
Section 6.3: We will work to understand the basic ideas of block coding, and we will simulate the Hamming codes in Matlab.
Please solve problem 6-1 (a, b, c only) for Friday, Sept. 12.
October 3: Please simulate the bit error rate (BER) performance of the Hamming(7,4) code over a binary symmetric channel (BSC). Produce a log-log plot of BER versus BSC error probability p for 0 < p < 0.5. You may want to refer to the Matlab program and plots for the 3-times repetition code that is posted under Class Notes (for September 26) on the course home page. Your plot should include the following:
Please submit your results in class on Wednesday, October 10. I will be available to meet with you if you have questions.
October 31: For Friday, November 2, please produce a plot of BER versus Eb/N0 for BPSK in AWGN. You should be able to produce a plot that is very similar to the example below.
November 12: We will have a short quiz on Wednesday, November 14, on convolutional coding and the Viterbi algorithm for hard-decision decoding.