Because of maintenance the locking system will not be available starting 16:00 for various changes. Thanks for your understanding!

389.164 Digital Communications 2
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2018W, VU, 3.0h, 4.5EC

Properties

  • Semester hours: 3.0
  • Credits: 4.5
  • Type: VU Lecture and Exercise

Aim of course

Knowledge of the most important techniques for channel coding

Subject of course

1. Block-based coded transmission:  HISO channel, Gaussian memoryless channel, HIHO channel, discrete memoryless channel, binary symmetric channel, optimum soft-input and hard-input block decoding (MAP, ML), optimum block decoding for the Gaussian memoryless channel and the discrete memoryless channel, problems

2. Fundamentals of block codes: Galois fields, repetition code, single parity check code, elementary modifications of block codes, minimum distance and bounded minimum distance decoding, error detection, erasure filling, burst errors, performance bounds (Singleton bound, Hamming bound, asymptotic performance bounds, capacity of the binary symmetric channel), problems

3. Linear block codes:  Linearity, minimal distance, weight distribution and weight enumerator, error probability of the ML decoder, matrix description, dual code, syndrome, syndrome decoding, repetition code, single parity check code, Hamming codes, modifications and compositions of linear block codes (permutation, length and rate modifications, subfield-subcodes, product codes, interleaved codes, serially concatenated codes, turbo codes), problems

4. Cyclic block codes: Polynomial description, dual code, syndrome decoding, matrix description, shift-register circuits for encoding and decoding, primitive cyclic codes, defining set, cyclic redundancy check (CRC) codes, frequency-domain description, Reed-Solomon codes, BCH codes, problems

5. Convolutional codes:  Elementary encoders, distance profile and free distance, weight distribution and weight enumerator, error probability of the ML decoder, truncation and termination, matrix description, syndrome, syndrome decoding, polynomial description, noncatastrophic encoders, trellis description, graph-searching decoders, Viterbi algorithm for hard-input and soft-input ML decoding, sequential decoding, trellis-coded modulation, problems

6. Turbo codes: Encoder, elementary parameters, BER performance, weight distribution and spectral thinning, interleaver, L-values, iterative turbo decoding algorithm, BCJR algorithm, max-log-MAP algorithm, EXIT chart, problems 

Appendix ¿ Mathematical fundamentals:  Galois fields, Hamming weight and Hamming distance, Hamming spheres, standard array, polynomials over GF(q), primitive elements and exponential representation, extension fields and splitting fields, primitive polynomials, DFT over GF(q), problems

Additional information

First class: Mon., October 1, 2018, 10:45 - 12:00, EI 6 Eckert

Lecturers

Institute

Course dates

DayTimeDateLocationDescription
Mon10:45 - 12:0001.10.2018 - 21.01.2019EI 6 Eckert HS VU
Wed10:00 - 11:1503.10.2018 - 23.01.2019EI 6 Eckert HS VU
Wed10:00 - 11:1502.01.2019EI 6 Eckert HS VU Digital Communications 2
Digital Communications 2 - Single appointments
DayDateTimeLocationDescription
Mon01.10.201810:45 - 12:00EI 6 Eckert HS VU
Wed03.10.201810:00 - 11:15EI 6 Eckert HS VU
Mon08.10.201810:45 - 12:00EI 6 Eckert HS VU
Wed10.10.201810:00 - 11:15EI 6 Eckert HS VU
Mon15.10.201810:45 - 12:00EI 6 Eckert HS VU
Wed17.10.201810:00 - 11:15EI 6 Eckert HS VU
Mon22.10.201810:45 - 12:00EI 6 Eckert HS VU
Wed24.10.201810:00 - 11:15EI 6 Eckert HS VU
Mon29.10.201810:45 - 12:00EI 6 Eckert HS VU
Wed31.10.201810:00 - 11:15EI 6 Eckert HS VU
Mon05.11.201810:45 - 12:00EI 6 Eckert HS VU
Wed07.11.201810:00 - 11:15EI 6 Eckert HS VU
Mon12.11.201810:45 - 12:00EI 6 Eckert HS VU
Wed14.11.201810:00 - 11:15EI 6 Eckert HS VU
Mon19.11.201810:45 - 12:00EI 6 Eckert HS VU
Wed21.11.201810:00 - 11:15EI 6 Eckert HS VU
Mon26.11.201810:45 - 12:00EI 6 Eckert HS VU
Wed28.11.201810:00 - 11:15EI 6 Eckert HS VU
Mon03.12.201810:45 - 12:00EI 6 Eckert HS VU
Wed05.12.201810:00 - 11:15EI 6 Eckert HS VU

Examination modalities

Exam consists of written and oral parts. Active participation in the Exercise section is required. Grading mode and previous exam problems: see http://www.nt.tuwien.ac.at/teaching/courses/winter-term/389101/

Exams

DayTimeDateRoomMode of examinationApplication timeApplication modeExam
Mon15:00 - 19:0027.01.2020 EI 7written06.01.2020 00:00 - 20.01.2020 00:00TISSschriftl. Prüfung
Tue13:00 - 17:0017.03.2020 EI 7written25.02.2020 00:00 - 10.03.2020 00:00TISSschriftl. Prüfung
Tue13:00 - 17:0019.05.2020 EI 7written25.02.2020 00:00 - 10.03.2020 00:00TISSschriftl. Prüfung
Tue13:00 - 17:0019.05.2020 EI 7written25.02.2020 00:00 - 12.05.2020 00:00TISSschriftl. Prüfung
Thu15:00 - 19:0018.06.2020 EI 7written28.05.2020 00:00 - 11.06.2020 00:00TISSschrift. Prüfung

Course registration

Registration modalities:

Registration for the Exercises is required --> during the first exercise unit. Personal attendance during the exercise units is required.

Curricula

Study CodeSemesterPrecon.Info
066 507 Telecommunications 3. Semester
066 938 Computer Engineering

Literature

Lecture notes for this course are available at the "Graphischen Zentrum an der TU Wien," Wiedner Hauptstraße 8 - 10, 1040 Wien (ground floor, red area). Complementary literature --> see lecture notes for Digital Communications 1

Previous knowledge

A sound knowledge of random variables and random vectors is an absolute prerequisite

Miscellaneous

Language

English