Channel CodingModule description #40232 / Version 2
- 3 CP
- Portfolio examination
- Graded
- Summer semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40232 / #2 |
|---|---|
| Validity | SS 2017 – SS 2017 |
| Available language(s) | English |
| Credit points | 3 |
| Person responsible for the module | Caire, Giuseppe |
| Grading | Graded |
| Exam format | Portfolio examination |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Telekommunikationssysteme |
| Academic chair | 34331600 FG Theoretische Grundlagen der Kommunikationstechnik |
Contact
| Office | HFT 6 |
|---|---|
| Contact person | Caire, Giuseppe |
| E-mail address | caire@tu-berlin.de |
| Website | http://www.commit.tu-berlin.de/menue/lehre/parameter/en/ |
Learning outcomes
This module presents an overview of the channel coding techniques currently used in wireless network standards and data storage systems. Classical coding theory (algebraic coding) is presented at a glance. A graph-theoretic framework is adopted to present convolutional codes and sparse graph codes (Turbo Codes, LDPC codes) and their decoding algorithms (Viterbi Decoding, Belief Propagation Decoding). Special topics such as regenerative storage codes, spatially coupled codes and sparse superposition codes are treated as research projects.
Content
- A review of finite fields and algebraic concepts
- Classical error correcting codes, linear codes, minimum distance decoding.
- Reed-Solomon codes, and algebraic decoding (errors and erasures).
- Convolutional codes and the Viterbi algorithm.
- Turbo Codes and the forward-backward MAP algorithm.
- LDPC codes, Belief Propagation iterative decoding, and the density evolution analysis.
- Spatially coupled LDPC codes.
- Coding for storage systems: problems and examples.
- Sparse superposition codes
- Classical error correcting codes, linear codes, minimum distance decoding.
- Reed-Solomon codes, and algebraic decoding (errors and erasures).
- Convolutional codes and the Viterbi algorithm.
- Turbo Codes and the forward-backward MAP algorithm.
- LDPC codes, Belief Propagation iterative decoding, and the density evolution analysis.
- Spatially coupled LDPC codes.
- Coding for storage systems: problems and examples.
- Sparse superposition codes
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Modern Channel Coding | Lecture | 34331600 L 003 | Summer semester | – | 2 | ISIS |
Workload and credit points
Modern Channel Coding (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance time | 15 | 2 h | 30 h |
| Examination preparation | 1 | 30 h | 30 h |
| Preparation and postprocessing | 15 | 2 h | 30 h |
| 90 h | |||
The workload of the module adds up to 90 hours. The module therefore comprises 3 credit points.
Description of teaching and learning methods
The module consists of conventional frontal teaching in class, developing theoretical and mathematical concepts, and a semester project where students work, possibly in groups, and are assigned a research paper in coding theory to read, understand, and use for implementation and simulation of a modern coding system.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Prerequisite for participation to courses are a mathematical background at the level of beginning MS students in Electrical Engineering (multivariate calculus, Fourier and Laplace Transforms, signals and systems, linear algebra and notions of matrix theory). The course is open to students enrolled in any MSc in EE CS, Mathematics and Physics.
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Portfolio examination |
| Type of portfolio examination | 100 points in total |
| Language | English |
Test elements
| Name | Points/Weight | Category | Duration/Extent |
|---|---|---|---|
| (Deliverable assessment) Project presentation | 60 | oral | 20 min |
| (Examination) Oral examination/discussion | 40 | oral | 20 min |
Exam description
The final grade according to § 47 (2) AllgStuPO will be calculated according to Notenschlüssel 3 of Faculty
IV.
IV.
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Summer semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Course teaching and organization (not module examination enrollment at Examination office/Prüfungsamt) is supported by an ISIS course. Registration details are provided at the beginning of the module.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available – Course notes and slides in electronic form are provided
Recommended literature
- Richardson, Tom, and Rüdiger Urbanke. Modern coding theory. Cambridge University Press, 2008.
- Roman, Steven. Coding and information theory. Vol. 134. Springer, 1992
Assigned programs
This module is not used in any program.
Miscellaneous
Not specified