Topic Areas, Fall 2000

1.

Capacity-Approaching Codes (D. Forney)

• Codes
  • turbo codes
  • low density parity check codes
  • multilevel codes (trellis representation)
• Decoding algorithms
  • turbo decoding
  • sum-product algorithm
  • belief propagation
• Codes on graphs

2.

Network Information Theory (B. Gallager)

• Channel coding
  • multiple access channel
  • broadcast channel
  • relay channel
  • general networks
• Source coding
  • Slepian-Wolf coding
  • side information
  • multiple descriptions
  • successive refinement
• Joint source-channel coding

3.

Wireless Communications (V. Tarokh)

• Models
• Multiple Access (TDMA, FDMA, CDMA)
• Diversity techniques (Coding, Spread-Spectrum)
• Antenna Arrays (Beamforming, Space-Time Coding)
• Information-theoretic considerations
  • capacity
  • knowledge assumptions (of channel at tx, rx)
  • outage probability

4.

Equalization (D. Forney, V. Tarokh)

• Decision-Feedback Equalization (DFE)
• Adaptive/Blind techniques
• Tomlinson-Harashima Precoding
• Constrained-complexity MLSE
• Approaching channel capacity on ISI channels
• Multiuser Detection

5.

Advanced Wireline Modems (D. Forney)

• Digital Subscriber Line (DSL)
• Cable

6.

Quantum Information Theory (D. Forney)