SubjectsSubjects(version: 945)
Course, academic year 2023/2024
   Login via CAS
Automata and Convolutional Codes - NMMB401
Title: Automaty a konvoluční kódy
Guaranteed by: Department of Algebra (32-KA)
Faculty: Faculty of Mathematics and Physics
Actual: from 2021
Semester: winter
E-Credits: 6
Hours per week, examination: winter s.:3/1, C+Ex [HT]
Capacity: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: not taught
Language: English, Czech
Teaching methods: full-time
Teaching methods: full-time
Additional information:
Guarantor: doc. Mgr. Štěpán Holub, Ph.D.
Class: M Mgr. MMIB
Classification: Mathematics > Algebra
Interchangeability : NMIB401
Is interchangeable with: NMIB401
Annotation -
Last update: T_KA (14.05.2013)
Course is an introduction into convolutional codes. Description of encoders is facilitated by an overview of finite automata. The algebraic structure of convolutional codes is explored, as well as its performance and basic decoding methods.
Course completion requirements -
Last update: doc. Mgr. Štěpán Holub, Ph.D. (28.10.2019)

The conclusion of the course is by a final test which can be be repeated.

Literature -
Last update: T_KA (14.05.2013)

Rolf Johannesson, Kamil Sh. Zigangirov, Fundamentals of Convolutional Coding, Wiley-IEEE Press, 1998

T. Richardson, R. Urbanke, Modern Coding Theory, Cambridge University Press 2008

Requirements to the exam -
Last update: doc. Mgr. Štěpán Holub, Ph.D. (28.10.2019)

The course is ended by a written exam followed by an oral exam based on the results of the written one. The resulting grade is a combination of both stages.

Syllabus -
Last update: T_KA (14.05.2013)

1. Basic properties of finite automata

  • finite automata, regular expressions, Kleene's theorem

2. Convolutional codes and their algebraic structure

  • representation by transition diagram and trellis, properties of

generating matrices and their realization, minimal encoders

3. Performance

  • free distance of the code, error-probability bounds

4. Decoding

  • Viterbi algorithm, sequential decoding, iterative decoding.

Charles University | Information system of Charles University |