|
|
|
||
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 (14.05.2013)
|
|
||
The conclusion of the course is by a final test which can be be repeated. Last update: Holub Štěpán, doc. Mgr., Ph.D. (28.10.2019)
|
|
||
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 (14.05.2013)
|
|
||
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. Last update: Holub Štěpán, doc. Mgr., Ph.D. (28.10.2019)
|
|
||
1. Basic properties of finite automata
2. Convolutional codes and their algebraic structure
generating matrices and their realization, minimal encoders 3. Performance
4. Decoding
Last update: T_KA (14.05.2013)
|