ECS 452: Digital Communication Systems

Synopsis

The subject of digital communications involves the transmission of information in digital form from a source that generates the information to one or more destinations. This course extends the knowledge gained from ECS332 (Principles of Communications) and ECS315 (Probability and Random Processes). Basic principles that underlie the analysis and design of digital communication systems are covered. This semester, the main focus includes performance analysis (symbol error probability), optimal receivers, and limits (information theoretic quantities). These topics are challenging but the presented material are carefully selected to keep the difficulty level appropriate for undergraduate students.

Announcements

• Extra office hours
  • Dec 11: 9-10AM
  • Dec 12: 9-11AM
• Information regarding the final exam [Updated @ 9PM on Dec 11]
  • 15 Dec 2014 (Monday)
  • TIME 09:00 - 12:00
  • ROOM BKD 2401
  • Closed book. Closed notes.
  • Basic calculators, e.g. FX-991MS, are permitted.
  • One A4 sheet allowed.
    • Must be hand-written.
    • No small pieces of paper notes glued/attached on top of it.
    • Indicate your name and ID in the upper-right corner of the sheet (in portrait orientation).
    • Submit your formula sheet with your final exam. (You can get it back from me next semester.)
  • 9 pages + 1 cover page
  • 9 questions (17.5 + 9 + 2 + 10 + 20 + 12 + 21 + 2 + 4.5)
  • Cover all the materials that we discussed in class and practice in the HWs.
    • Material Distribution (score-wise): 17.5% (Sec 5) + 53% (Sec 6) + 4% (Sec 7) + 21% (Sec 8) + 4.5% (Sec 9-10) (draft)
  • For your studying pleasure....
    • All post-midterm annotated notes combined in one pdf file
    • All post-midterm slides.
    • All post-midterm HWs and their solutions
      • Graded HW are available in the HW box
      • Caution: HW7 is also important.
    • All post-midterm quiz solutions.
• My office hours on Wednesday is extended to 5PM.
• Information regarding the midterm exam
  • 6 Oct 2014 (Monday) TIME 09:00 - 12:00
  • ROOM BKD 3510 and 3511
  • Closed book. Closed notes. No cheat/study sheet.
  • Basic calculators, e.g. FX-991MS, are permitted
  • 10 pages + 1 cover page
  • 11 questions (8+1+10+1+12+22+10+6+10+17+3) + 1 extra credit question
  • Cover all the materials that we discussed in class and practice in the HWs.
    • Material Distribution (score-wise): 32% (Sec 2) + 30% (Sec 3) + 16% (Sec 4) + 22% (Sec 5)
  • These notes are provided for your studying pleasure....
    • All annotated notes combined in one pdf file.
      • Unannotated notes with clickable links and references.
    • All pre-midterm slides.
    • All pre-midterm HWs and their solutions
      • Graded HW are available in the HW box
    • All pre-midterm quiz solutions.
• Our Wednesday lecture room BKD3511 was somehow in conflict with another class. For now, we will move to room BKD3206 for Wednesday lecture.
• This site can be accessed via ecs452.prapun.com
• A basic RSS feed is available for tracking site updates.
• Welcome to ECS452! Feel free to look around this site.

General Information

• Instructor:Asst. Prof. Dr.Prapun Suksompong (prapun@siit.tu.ac.th)
  • Office: BKD3601-7
  • Office Hour:
    • Monday 14:00 - 16:00
    • Wednesday 14:40 - 16:00 (TRIDI LAB) 16:00-17:00
• Course Syllabus [Posted @ 4PM on Aug 12][To be distributed in class]
• Textbook: [P&S] Proakis and Salehi, Digital Communications, 5th Edition, McGraw-Hill, 2007.
• References
• [G] Robert G. Gallagher, Principles of Digital Communications, Cambridge University Press, 2008.
  • 6.450 Principles of Digital Communications I Fall 2006
• [S] Bernard Sklar, Digital communications: fundamentals and applications, Prentice Hall, 2001. Call No: TK5103.7 S55 2001.
• [N&S] Ha H. Nguyen and Ed Shwedyk, A first course in digital communications, Cambridge University Press, 2009. Call No: TK5103.7 N49 2009
• [Z&T] Rodger E. Ziemer and William H. Tranter, Principles of Communications, 6th International student edition, John Wiley & Sons Ltd, 2010.
  • Call No. QA273 Y384 2005. ISBN: 978-0-471-27214-4
  • Student Companion Site
• [L&D] B.P. Lathi and Zhi Ding, Modern Digital and Analog Communication Systems, 4th Edition, Oxford: Oxford University Press, 2009. Call No. TK5101 L333 2009
• J. G. Proakis and M. Salehi, Communication Systems Engineering, 2nd Edition, Prentice Hall, 2002. ISBN: 0-13-095007-6
• S.S. Haykin, Communication Systems, 4th Edition, John Wiley & Sons, 2001. Call Number: TK5101 H38 2001.
• [J&S] C. R. J. Jr, W. A. Sethares, and A. G. Klein, Software Receiver Design: Build Your Own Digital Communication System in Five Easy Steps, 1st ed. Cambridge University Press, 2011.
  
  • [J&S] C.R. Johnson and W.A. Sethares, Telecommunications Breakdown: Concepts of Communication Transmitted via Software-Defined Radio, Prentice Hall, 2003.
• [C&T] Thomas M. Cover, Joy A. Thomas, Elements of Information Theory, Second Edition, Wiley-Interscience, 2006
• P. Suksompong, ECS332: Principles of Communications
• MATLAB Primer, 8th edition T. A. Davis. CRC Press, 2010.
• MIT RES.6.007 Signals and Systems (1987) on Youtube

Handouts and Course Material

• Slides: Course Introduction [Posted @ 4PM on Aug 13]
  • Some extra notes from lecture 1 [Posted @ 1PM on Aug 18]
• Section 1: Elements of a Digital Communication System [Posted @ 10PM on Aug 12][Distributed in class on Aug 13]
  • Annotated version [Posted @ 1PM on Aug 18]
  • Slides [Posted @ 4PM on Aug 13]
• Section 2: Source Coding
  • 2.1 General Concepts [Posted @ 10PM on Aug 12][Distributed in class on Aug 13]
    • Annotated version [Posted @ 1PM on Aug 18, Updated @ 4PM on Aug 20]
    • Review: Multiple discrete random variables
    • MATLAB: GenRV_Discrete_datasample_Ex.m, GenRV_Discrete_datasample_Ex1.m, GenRV_Discrete_datasample_Ex2.m
  • 2.2 Huffman Coding and 2.3 Extension Coding [Posted @ 8PM on Aug 17][Distributed in class on Aug 18]
    • Annotated version [Posted @ 1:30PM on Aug 25]
    • MATLAB: Huffman_Demo_Ex1.m, Huffman_Demo_Ex2.m
  • 2.4 (Shannon) Entropy for Discrete Random Variables [Posted @ 9PM on Aug 24][Distributed in class on Aug 25]
    • Annotated version [Posted @ 3PM on Aug 27]
  • Slides [Posted @ 9PM on Aug 18][Updated @ 4PM on Aug 20, @ 2PM on Aug 25, and @ 3PM on Aug 27]
• Section 3: An Introduction to Communication Systems Over Discrete Memoryless Channel (DMC)
  • 3.1 Discrete Memoryless Channel (DMC) Models [Posted @ 9:30AM on Aug 27][Distributed in class on Aug 27]
    • Annotated version [Posted @ 4PM on Sep 1; Updated @ 4:30PM on Sep 3]
    • Solution for Quiz 1 [Posted @ 4:30PM on Sep 3]
  • 3.2 Decoder and Symbol Error Probability, 3.3 Optimal Decoding for BSC, and 3.4 Optimal Decoding for DMC [Posted @ 9AM on Sep 1; Updated @ 9PM on Sep 9; Distributed in class on Sep 3]
    • Annotated version [Posted @ 3PM on Sep 3; Updated @ 2PM on Sep 8, @ 9PM on Sep 10, and @ 5PM on Sep 15]
    • Solution for Quiz 2 [Posted @ 5PM on Sep 16]
  • Slides [Posted @ 9AM on Sep 1; Updated @ 4PM on Sep 1, @ 2PM on Sep 8, @ 9PM on Sep 10, and @ 9PM on Sep 23]
  • MATLAB: BSC_demo.m, BAC_demo.m, DMC_demo.m, DMC_Analysis_demo.m, DMC_Channel_sim.m, BSC_decoder_ALL_demo.m,DMC_decoder_DIY_demo.m, DMC_decoder_ALL_demo.m, DMC_decoder_MAP_demo.m, DMC_decoder_ML_demo.m
• Section 4: An Introduction to Channel Coding and Decoding over BSC [Posted @ 9AM on Sep 15;Distributed in class on Sep 15]
  • Annotated version [Posted @ 5PM on Sep 15; Updated @ 5PM on Sep 17]
• Section 5: Mutual Information and Channel Capacity
  • 5.1 Information-Theoretic Quantities [Posted @ 5PM on Sep 17; Updated @ 10AM on Sep 22]
    • Annotated version [Posted @ 3PM on Sep 22; Updated @ 3:30PM on Sep 24]
      • Detailed calculation of the last example is added.
    • Solution for Quiz 3 [Posted @ 8PM on Sep 24]
  • 5.2-5.3 Channel Capacity [Posted @ 3PM on Oct 12 and Updated @ 11AM on Oct 15][Distributed in class on Oct 13]
    • Annotated version [Posted @ 5:30PM on Oct 13 and Updated @ 5PM on Oct 15, @ 3PM on Oct 20, and @ 10PM on Oct 22]
    • Solution for Quiz 4 [Posted @ 3PM on Oct 20]
    • Slides [Posted @ 3PM on Oct 20; Updated @ 10PM on Oct 22]
    • MATLAB: capacity_blahut.m
• Section 6: Introduction to Digital Modulation
  • 6.1 Vector Space and Inner Product [Posted @ 10PM on Oct 21; Updated @ 9AM on Nov 6]
    • Annotated version [Posted @ 10PM on Oct 22; Updated @ 1:30PM on Oct 27, @ 9PM on Oct 29, @ 9AM on Nov 6, @ 9AM on Nov 6, @ 3PM on Nov 10 , and @ 2PM on Nov 17]
    • Solution for Quiz 5 [Posted @ 9PM on Dec 10]
  • 6.2 Signal Space [Posted @ 9AM on Nov 17]
    • Annotated version [Posted @ 2PM on Nov 17; Updated @ 5PM on Nov 19]
  • 6.3 Constellations for Digital Modulation Schemes [Posted @ 8:30AM on Nov 19]
    • Annotated version [Posted @ 5PM on Nov 19; Updated @ 2PM on Nov 24]
  • Slides [Posted @ 10PM on Oct 22; Updated @ 1:30PM on Oct 27, @ 9PM on Oct 29, @ 2PM on Nov 3, @ 9:30AM on Nove 6, and @ 3PM on Nov 10]
  • MATLAB: ASK_playTones_Demo.m, FSK_playTones_Demo.m, addToneAF.m, plotspec.m
  • Review: Fourier Transform
  • Review: Modulation
  • In-class review of ECS332 concepts [Posted @ 9PM on Oct 29; Updated @ 2PM on Nov 3 and @ 9AM on Nov 6]
• Section 7: The Waveform Channel
  • 7.1 Random Processes [Posted @ 8:30AM on Nov 19]
    • Annotated version [Posted @ 2PM on Nov 24; Updated @ 5:30PM on Nov 26]
  • 7.2 Equivalent Vector Channel [Posted @ 10AM on Nov 24]
    • Annotated version [Posted @ 5:30PM on Nov 26]
• Section 8: Optimal Detection for Additive Noise Channels: 1-D Case
  • Annotated version [Posted @ 5:30PM on Nov 26; Updated @ 3PM on Dec 1 and @ 4PM on Dec 3]
  • Slides [Posted @ 7:30PM on Nov 26; Updated @ 3PM on Dec 1 and @ 4PM on Dec 3]
    • The version distributed in class on Dec 1.
• Section 9: Optimal Detection for Additive Noise Channels: K-D Case
  • Slides [Posted @ 4PM on Dec 3]
• Section 10: Channel Coding (A Revisit)
• Slides [Posted @ 4PM on Dec 3]

Problem Set

1. HW 1 (Due: Sep 1)
   • Correction: For Q6, in the hint part, the first probability value should be 0.01 (not 0.1).
   • Solution
2. HW2 (Due: Sep 26)
   • HW_DMC_Channel_Data.mat
   • Solution[Updated @ 9PM on Sep 28]
3. HW3 (Not Due)
   • Solution
4. Self-Evaluation (Due: Oct 31)
5. HW4 (Due: Nov 7)
   • Solution[Updated @ 10:30AM on Dec 8]
6. HW5 (Due: Nov 27)
   • Solution
7. HW6 (Due: Dec 4)
   • Solution
   • Solution (.mht)
8. HW7 (Due: Not Due)
   • Solution
9. Self-Evaluation (Due: Dec 15)
   

Calendar

Reading Assignment

Misc. Links

• Information Theory Basics (Free sample chapter from the textbook "Information Theory Tools for Image Processing" by Miquel Feixas, Anton Bardera, Jaume Rigau, Qing Xu, and Mateu Sbert.
• Article: IEEE 802.11ac—Wi-Fi for the Mobile and Video Generation
  
• C.E. Shannon
  • Paper: C.E. Shannon, "A Mathematical Theory of Communication", Bell System Technical Journal, vol. 27, pp. 379–423, 623-656, July, October, 1948
  • Video: Claude Shannon - Father of the Information Age
  • The Significance of Shannon's Work by Aaron Wyner
• Paper: Sergio Verdü (2000). "Fifty years of Shannon theory"
• Video: Demo from MIT (1987) showing introduction to function generator, spectrum analyzer (with sampling and FFT), spectrum of square and triangular signals, time and frequency scaling, spectrum of speech, and amplitude modulation.
• Article: Articles about source coding: PC World article, US Patent 5,533,051, the comp.compression FAQ.
• Article: Jim Giles, Traffic jam: the coming cellphone crunch, New Scientist, November, 2010
• 20 Questions
  • Twenty Questions online game
  • Twenty Questions (1949): Players were allowed to ask up to twenty questions about a mystery object in their quest to identify it.
    • Video: 20 Questions game show from the 1950's
• A Brief History of Communications: IEEE Communications Society - a fifty-year foundation for the future
  • ประวัติย่อ "การสื่อสารโลก": ห้าสิบปีชมรมไฟฟ้าสื่อสาร--รากฐานสู่อนาคต
• Thai Telecommunications Encyclopedia (สารานุกรม โทรคมนาคมไทย)
• IEEE Thailand Section
• Google Calculator (Cheat Sheet)
• Learn the Greek Alphabet in less than 10 minutes
• The Greek Alphabet Song