ECE 755 – Digital communications


Description

This course covers advanced topics in digital communication systems: maximum likelihood and maximum a posteriori detection (Viterbi and BCJR algorithms), equalization on inter-symbol interference channels, fundamentals of binary and signal-space coding, fading and diversity, MIMO systems.

Prerequisites

Basic knowledge of random signal analysis (ECE 673) and communications systems (ECE 642, ECE 742).

Instructor

Dr. Osvaldo Simeone
Email: osvaldo.simeone@njit.edu
Phone: (973) 596-5710
Office: 211 ECE Dept. 
Office Hours: Tuesday 2-6pm (and by appointment)

Textbooks

J. R. Barry, E. A. Lee and D. G. Messerschmitt, Digital Communication, Springer, 2003 (ISBN: 0792375483).

 

Other references:

 

A. Goldsmith, Wireless Communications, Cambridge University press, 2005.

D. Tse and P. Viswanath, Fundamentals of wireless communications, Cambridge University press, 2005.


Requirements

There will one midterm (30%) and one final exam (40%) plus weekly assignments (10%), and a project (20%) to be completed by the date of the final exam.

For the project, a recent paper will be assigned to each student based on individual interests. A brief report on the paper, possibly including MATLAB simulations, is due before the final.


Additional material

·        David Slepian on bandwidth (a discussion on the “2WT formula”).

·        Aaron Wyner on the capacity of band-limited Gaussian channels.

·        Andrew Viterbi on the Viterbi algorithm.

·        The original paper on the BCJR algorithm.

·        David Forney on precoding for ISI channels and V.92.

·        Tanner’s graphs.

·        The original paper on turbo codes.

·        Capacity of LDPC codes.

·        Ungerboeck’s original paper on trellis coded modulation.


Exams and grades

·        Spring 2008: Midterm (with solutions) and grades.

·        Spring 2008: Final (with solutions) and grades.

(grade mapping after final -- 6-7: C+, 7-8: B, 8-9: B+, 9-10: A).

·        Spring 2009: Midterm (with solutions) and grades.

·        Spring 2009: Final (with solutions) and grades.


Spring 2009: Tentative schedule

Week

Date

Plan

Ch.

1

Jan. 26

  • Introduction
  • Spectral efficiency, capacity (Shannon’s formula)

 

         4-5

2 -3

Feb. 2 -

Feb. 9

  • Review of PAM modulation
  • Fundamentals of advanced modulation (OFDM, SS)
  • Probability of error, union bound

         4-6

4-6

Feb. 16 –

Mar. 2

  • Probabilistic detection: Maximum Likelihood Sequence detection and Viterbi algorithm, Maximum a Posteriori and BCJR

           7

7

Mar. 9

Midterm

 

8 -9

Mar. 23 – Mar. 30

  • Equalization

          8

10-12

Apr. 6-20

  • Coding (block, convolutional, LDPC and turbo-codes)
  • Signal space coding (lattice codes, trellis codes)

       10-11

13

Apr. 27

  • Fading and diversity

       12-13

   14

May 4

  • Fundamentals of synchronization

       14-16

 


 

The NJIT Honor Code will be upheld, and that any violations will be brought to the immediate attention of the Dean of Students.