Course detail

# Data Communication

FEKT-BKC-DAKAcad. year: 2019/2020

Students will be introduced in detail to data transmission systems and the possibilities of realizing data communication. The course covers issues of information theory, information source and discrete communication system description. Furthermore, it focuses on data transmission, in particular on the basic concepts, data and signal description, transmission methods, transmission reliability, coding of analog and discrete signals. In greater detail it also focuses on coding: redundancy reducing code - prefix codes, the Huffman code, data compression principles. Forward error coding: Block codes, tree codes, turbo codes, concatenated codes, error security system. Last but not least, it also focuses on modulations, cryptography basics and other fields of data transmission.

Supervisor

Department

Learning outcomes of the course unit

Students who complete this course are able to:

- explain the concepts of information, information content and redundancy

- evaluate the static properties of the information source, in particular redundancy, and propose an appropriate code to reduce redundancy

- explain the concept of channel capacity, the Shannon-Hartley theorem, and determine it for discrete and analog channels

- describe the principle of FEC and ARQ systems

- explain the principle of error protection using codes

- explain the concepts of the Hamming distance and weight

- determine the detection and correction capabilities of code

- explain the principle of security using block, cyclic, tree and concatenated codes

- secure data by the previously mentioned codes based on the specified generation matrix or polynomial

- find the encoder and the decoder diagram of the block, cyclic or tree code

- draw a tree diagram, trellis diagram and state diagram of the tree code

- describe the principle of the Viterbi decoding algorithm

- list the transmission methods in the base-band and pass-band

- list and describe some line codes and their utilization

- list and describe the basic keying methods and combined keying methods

- list and describe the principle of single carrier and multicarrier transmission with application examples

- list the basic concepts of data encryption and cryptographic systems

- list the services provided by cryptographic systems

- describe and compare symmetric and asymmetric cryptographic systems

Prerequisites

Students who are going to attends this course should have a full knowledge of selected topics in mathematics, in particular: solving the equations and non-equations with logarithms, matrix calculation, especially vector multiplication with a matrix, know arithmetic operations with polynomials, in particular dividing, conversion into the binary numerical system and calculations in binary numerical system. Students should have experience of creating simple functions in MATLAB.

Co-requisites

Not applicable.

Recommended optional programme components

Not applicable.

Recommended or required reading

ŠILHAVÝ, P. Datová komunikace. Brno: Vysoké učení technické v Brně, 2012. s. 1-211. ISBN: 978-80-214-4455-3. (CS)

ŠILHAVÝ, P. Datová komunikace - Laboratorní cvičení. Brno: Vysoké učení technické v Brně, 2013. s. 1-84. ISBN: 978-80-214-4725-7. (CS)

ŠILHAVÝ, P. Přenos dat a kódování pro integrovanou výuku VUT a VŠB-TUO. Brno: Vysoké učení technické v Brně, 2013. s. 1-107. ISBN: 978-80-214-4827-8. (CS)

MORELOS-ZARAGOZA, Robert H. The art of error correcting coding. Chichester : John Wiley & Sons, 2002. 221 s. ISBN 04-714-9581-6. (EN)

BIGGS, Norman L. Codes : an introduction to information communication and cryptography. London : Springer, 2008. 273 s. ISBN 978-184-8002-722. (EN)

SKALAR, B.. Digital Communications, Fundamentals and applications, Prentice-Hall, 2003, ISBN 0-13-084788-7. (EN)

GITLIN, Richard D; HAYES, Jeremiah F; WEINSTEIN, Stephen B. Data communications principles. New York : Plenum Press, 1992. 733 s. ISBN 03-064-3777-5. (EN)

GLAVIEUX, Alain. Channel coding in communication networks : from theory to turbocodes. London : ISTE, 2007. 418 s. ISBN 19-052-0924-x. (EN)

MOON, Todd K. Error correction coding : mathematical methods and algorithms. Hoboken : John Wiley & Sons, 2004. 756 s. ISBN 04-716-4800-0. (EN)

LIN, Shu; COSTELLO, Daniel J. Error control coding : fundamentals and applications. 2nd ed. Upper Saddle River : Pearson Prentice Hall, 2004. 1260 s. ISBN 01-304-2672-5. (EN)

Planned learning activities and teaching methods

Techning methods include lectures, computer laboratories, homeworks and practical laboratories. Course is taking advantage of e-learning (Moodle) system.

Assesment methods and criteria linked to learning outcomes

At the end of each laboratory or computer exercise the teacher checks the results of the given assignment and awards points. Assessment of computer exercises also includes assessment of homeworks. The points awarded for laboratory and computer exercises (a maximum of 30 points in a semester) go to the evaluation of the examination and thus also the assessment. The exam is written. The maximum number of points is 70. The overall evaluation is the sum of points for computer exercises, laboratories and a written exam. The minimum feasible value is 50 points; the maximum value is 100 points.

Language of instruction

Czech

Work placements

Not applicable.

Course curriculum

1. Basics of information theory

2. Information transmission systems

3. Data transmission

4. Coding for redundancy reduction

5. Error control coding

6. Block codes

7. Cyclic codes

8. Examples of cyclic codes

9. Tree codes

10. Turbo codes

11. Forward error correction coding systems

12. Modems in data communication systems

13. Cryptography basic

Aims

The aim of the course is to introduce students to the basic knowledge of data communication, tools for its realization and the conditions of its realization in contemporary as well as prospective telecommunication systems.

Specification of controlled education, way of implementation and compensation for absences

Attendance at laboratory and computer exercises is compulsory, justified absence can be made up for after prior arrangement with the instructor. The content and forms of instruction in the evaluated course are specified by a regulation issued by the lecturer responsible for the course and updated for every academic year.