Automata and convolutional codes - NMIB401
Title: Automaty a konvoluční kódy
Guaranteed by: Department of Algebra (32-KA)
Faculty: Faculty of Mathematics and Physics
Actual: from 2018
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: cancelled
Language: Czech
Teaching methods: full-time
Guarantor: doc. Mgr. Štěpán Holub, Ph.D.
Classification: Mathematics > Algebra
Interchangeability : NMMB401
Is interchangeable with: NMMB401
Opinion survey results   Examination dates   Schedule   Noticeboard   
Annotation -
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.
Last update: T_KA (17.05.2012)
Literature -

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

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

Last update: T_KA (04.05.2012)
Syllabus -

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.

Last update: T_KA (17.05.2012)