| 
  • If you are citizen of an European Union member nation, you may not use this service unless you are at least 16 years old.

  • You already know Dokkio is an AI-powered assistant to organize & manage your digital files & messages. Very soon, Dokkio will support Outlook as well as One Drive. Check it out today!

View
 

FrontPage

Page history last edited by Haoran 11 years, 2 months ago

Welcome to IERG4200 Channel Coding and Modulation! 

 

Here are some official documents provided by the University. Please read them in advance.

 

Class Evaluations: Spreadsheet.

 

Student/Faculty Expectations on Teaching and Learning

http://www.erg.cuhk.edu.hk/erg-intra/upload/documents/StaffStudentExpectations.pdf

 

Academic honesty and plagiarism

Attention is drawn to University policy and regulations on honesty in academic work, and to the disciplinary guidelines and procedures applicable to breaches of such policy and regulations. Details may be found at http://www.cuhk.edu.hk/policy/academichonesty/ . With each assignment, students will be required to submit a statement that they are aware of these policies, regulations, guidelines and procedures.

 

Course Information

 

Instructor: Professor Sidharth (Sid) JAGGI

jaggi@ie.cuhk.edu.hk

http://staff.ie.cuhk.edu.hk/~sjaggi/

Calendar: http://calendar.jaggi.name

TA: Haoran YU,

yh012@ie.cuhk.edu.hk

Office Hour: 9:50-12:00 a.m. Tuesday @Room825 SHB

 

 

Class Time and Location: 

 

Learning resources for students

Recommended Textbooks (first two free online, third in CUHK bookstore):

  1. Notes on Coding Theory by Jonathan Hall
  2. Information Theory, inference, and learning problems by David Mackay

    3.  Introduction to Coding Theory by Ron Roth

 

 

 

Course Title: IERG 4200 Channel Coding and Modulation

Description: The course aims to cover

 

  1. Modeling noise and communication over noisy/adversarial channels
  2. Information theoretic tools to design codes over noisy channels (Asymptotic Equipartition Principle, typicality, probabilistic method)
  3. Information theoretic limits on communication over noisy channels (entropy, mutual information, inequalities, converse techniques)
  4. Coding theoretic constructions/bounds (GV codes, RS codes, Hamming bound, Singleton bound, Plotkin bound, concatenated codes, convolutional codes)
  5. Continuous channels (AWGN channels) and techniques for coding. Connections with modulation schemes. 
  6. Some topics in Modern coding theory (Expander codes, LDPC codes, Compressive sensing...)

 

 

Learning outcome:

 

Demonstrate ability to model noisy communication systems, design high-throughput and computationally-efficient codes for them, and understand fundamental limits on their performance.

 

 

 

 

 

 

 

Learning activities

Lecture

Problem Sets

Online Activities (Scribe Notes/Discussion)

Homeworks

 

 

(hr)
in class

 

 

(hr)
in/out class

 

 

(hr)
out of class

 

 

(hr)
out of class

36

 

 

0

36

12

12

6

15

0

M

 

 

O

M

O

M

O

M

O

M: Mandatory activity in the course

O: Optional activity

NA: Not applicable

 

 

 

 

Assessment scheme

Task nature

Description

Weight

Homework

Class participation

Class project

Final Exam 

Collaborative homeworks (~4)

In-class discussion/Notes on wiki

Individual project

Examination 

20% 

20%

20%

40% 

 

 Feedback for evaluation:

Class evaluations

 

Students are welcome to express their comments and suggestions via the following formal and informal feedback channels:

 

 

  • Two course evaluations. First one to be conducted in the middle of the term and the second one at the end of the term. Students are encouraged to provide specific comments and/or suggestions in addition to the numeric ratings.
  • At the end of each lecture there will be a single question feedback slip given to each student.
  • Students are also encouraged to provide feedbacks using informal channels, such as email/discussion to instructor/tutor, and via the talk pages on the class wiki.

 

 

 

 

Problem Sets/Exercises/Homeworks/...

 

Item

Date

Topic

Author

0.  Background material

 

1. PS1

 

2. PS1 Notes (partial)(modified)

 

3. Homework1

 

4. PS2

 

5. PS2 Notes (updated)

 

6. PS3

 

7. Homework2

 

8. PS4

 

9. PS5

 

10. Lecture on Network Coding

 

11.  Lecture on Group Testing

 

12. HW3

 

13. Lecture on Last Class (1)(2)

 

14. Viterbi Decoder

 

15. HW3 solution Page(1) Page(2)

 

16. Presentation Materials

 

12 Sep

 

12 Sep

 

26 Sep

 

26 Sep

 

16 Oct

 

21 Oct

 

23 Oct

 

24 Oct

 

31 Oct

 

6 Nov

 

14 Nov

 

21 Nov

 

28 Nov

 

28 Nov

 

28 Nov

 

17 Dec

 

17 Dec

Basic probability theory

 

 (Introduction to Information Theory/Coding theory)

 

 

 

 

 

Finite fields

 

 

 

Concatenated codes

 

 

 

Source codes

 

Expander Codes

 

Network Coding

 

Group Testing

 

Due: 17 Dec.

 

Convolutional Codes etc.

Sid

 

Sid

 

Sid

 

Sid

 

Sid

 

Sid

 

Sid

 

Sid

 

Sid

 

Sid

 

Haoran

 

Sid

 

Haoran

 

Haoran

 

Haoran

 

Haoran

 

Haoran

 

Important Announcements:

 

Item

Date

Author

 Advertisement/evals/material/answers/...
14 Sep 2012  Sid 
 Announcement
15 Sep 2012
Sid
 Announcement2
26 Sep 2012
Haoran 
 Possible project ideas
21 Oct 2012 Sid. 
 Preliminary Result of project topics 
1 Nov 2012 
Haoran 
 Date for Presentation and Final
14 Nov 2012  Haoran 
 About HW3  3 Dec 2012  Haoran 
 Final Result  25 Dec 2012  Haoran 
     
     
     
     
     
     
     

 

Scribe Notes Schedule:

Week  
 
1  
 
2

 

 

 

 

 

4

 
 

 

Free help:

1. Learn how to use PBwiki: The PBwiki Manual

2. If you prefer video, watch a recording of our popular webinar, PBwiki 101: Your Guide to Wiki Basics.

3. Need more help? Sign up for a Free introductory webinar

4. Not So Short Introduction to LaTeX

 

Comments (0)

You don't have permission to comment on this page.