Föreläsningar
Two lectures are given every week on
Mondays, 13.15 - 15.00 in E:2311 and
Wednesdays, 13.15 - 15.00 in E:2311
Exception: the lecture on Monday, Dec 3 and the exercise lesson on Friday, Nov 30 are swapped
The lecture on Monday, Dec 10 takes place 17:15 - 19:00 in room E:2517
Lecture notes:
For watching online: PDF For printing (save paper): PDF 2up
The lecture notes may be updated during the course. Watch out for new versions!
Note: most files can only be accessed from a university computer (or via VPN) without password
Content of the lectures: (preliminary)
Cal. Week |
Lecture | Topic | Material |
45 | Mon, Nov 5 | Chapter 1: Introduction, What is error control coding? | Chap. 1.1-1.5, Lec1 |
QR Demo | QR | ||
Wed, Nov 7 | Chapter 2: Principles of error control coding | Lec2 | |
Channel models, Linear block codes, Syndrome decoding | Chap. 2.1-2.2 |
||
AWGN and BSC example | Matlab | ||
46 | Mon, Nov 12 | Constructing codes from other codes, | Lec3 |
Boundson achievable code parameters, Cyclic codes | Chap. 2.3-2.5 | ||
Wed, Nov 14 | Convolutional codes | Chap. 2.6, Lec4 |
|
47 | Mon, Nov 19 | Termination, Tailbiting, Puncturing, Catastrophic encoders | Chap. 2.6 cont. |
Chapter 3: Optimal decoding methods | |||
Overview, MD vs BMD decoding | Chap. 3.1, Lec5 | ||
Example: noisy image | Matlab | ||
Example: repetition code experiment | Matlab | ||
Wed, Nov 21 | ML Decoding, Viterbi algorithm, Trellises of block codes | Chap. 3.2-3.3, Lec6 | |
48 | Mon, Nov 26 | Decoding error probability, Weight enumerators | Chap. 3.4, Lec7 |
Example: union bound for (7,4) Hamming code | Matlab | ||
APP decoding, BCJR algorithm | Chap. 3.5 | ||
A tutorial on BCJR and APP decoding by Silvio A. Abrantes | Link | ||
Wed, Nov 28 | Log-APP, Max-Log-APP decoding | Lec8 | |
Chapter 4: Iterative decoding of concatenated codes | |||
Product codes, Parallel and serial concatenation, Turbo codes | Chap. 4.1 | ||
IEEE Spectrum article on turbo codes | Link | ||
Fri, Nov 30 | Monday lecture from week 49 moved here | Lec9 | |
Iterative decoding, Extrinsic and intrinsic L-values | Chap. 4.2 | ||
LDPC Codes, Tanner graphs, Message passing decoding | Chap. 4.3 | ||
49 | Mon, Dec 3 | Exercise lession from week 48 moved here | |
Wed, Dec 5 | Belief propagation, min-sum and hard-decision decoding | Chap. 4.3 cont. |
|
Irregular LDPC codes, Protographs, Quasi-cyclic LDPC codes | |||
LDPC convolutional codes | Chap. 4.4 Lec10 | ||
50 | Mon, Dec 10 | Spatial coupling (17:15-19:00 in room E:2517) | |
Beyond coding: iterative receivers, turbo equalization | Chap. 4.5, Lec11 | ||
An introduction to factor graphs | Link | ||
Turbo equalization | Link | ||
Chapter 5: Reed-Solomon codes | |||
Non-binary codes, Parameters of RS codes | Chap. 5.1 | ||
Wed, Dec 12 | Frequency domain representation, Encoding, Syndrome | Chap. 5.2-5.3 | |
Error location, Key equation, Error evaluation | Lec12 | ||
51 | Mon, Dec 17 | Error evaluation: Forney algorithm, Euclidean algorithm, | Chap. 5.3 cont. |
Berlekamp-Massey algorithm, Frequency domain error evaluation | Lec13 | ||
Wed, Dec 19 | Summary: algebraic decoding, Weight enumerators | Lec14 | |
Extension fields, Application examples | Chap. 5.4 | ||