|Hour/sem||Lectures||Sem. Exercises||Lab. exercises||Comp. exercises||Other|
|Guarantee:||Šilhavý Pavel, Ing., Ph.D., UTKO|
|Lecturer:||Šilhavý Pavel, Ing., Ph.D., UTKO|
|Faculty:||Faculty of Electrical Engineering and Communication BUT|
|Department:||Department of Telecommunications FEEC BUT|
| || ||The aim of the course is to introduce students to the basic knowledge of data communication, tools for its realization, and to the conditions of its realization in contemporary as well as prospective telecommunication systems.|
| || ||Information theory: Description of the information source. Discrete telecommunication system. Data transmission: Basic conception, data and signals, types of transmission, transmission reliability, coding of analog and discrete signals. Coding for redundance reduction: Prefix codes, Huffman code, data compression principles. Anti-error coding: Block codes, tree codes, anti-error coding systems. Special modulations. Coding principles. Cryptography and cryptoanalysis, cryptographis system, methods of classical cryptology. Public key encryption. Methods of ensuring network security. Encryption in networks. Access verification. User authentication. Queuing theory: Description of queuing system. Queuing system performance, Kendall classification and other queuing system parameters.|
|Knowledge and skills required for the course:|
| || ||Fundamentals of electrical and electronic engineering and electro-magnetic signals transmission.|
|Learning outcomes and competences:|
| || ||Students will be introduced in detail to data transmission systems and the possibilities of realizing data communication in these systems. The subject matter discussed is focused mainly on codes, their types and their application. Based on the range of the subject matters the student should be able, after a successful completion of the course, to solve all the standard problems that appear in this type of data communication.|
|Syllabus of lectures:|
- Information theory. Information source: Amount of information, entropy, redundance. Discrete communication system: Static and dynamic characteristics of the source, transmission channel, receiver. Coding: Realization principles, signification for transmission, examples of application.
- Data transmission. Fundamental concepts and terminology: Frequency, spectrum, bandwidth,bit rate, data transfer rate. Data and signals, sorts of transmission and their examples. Data corruption during transmission: Outer influence, inner influence. Transmission reliability. Transmission media.
- Coding of analog and discrete signals. Explanantion of the concepts "analog data" and "digital data". Four possible systems for data transmission: Systems "digital data and digital signals", "digital data and analog signals","analog data and digital signals" and "analog data and analog signals". Application and realization regions of these systems.
- Coding for redundance reduction. Fundamental methods: Prefix codes, Huffman code. More complex methods: Compression of bit sequences, one- and double-line encoding in the fax system.
- Anti-error coding. Method for the simulation of interfering effects. Detection and correction of errors. Example of a decoding Table. Principles of anti-error coding. Protection capability of codes. Classification of anti-error codes.
- Block codes. Methods of setting block codes: Generation and control matrix, generation polynomials. Data protection by cyclic codes: Model of the protection process, possibilities of encoder and decoder realization. Examples of block codes.
- Tree codes. Classification of tree codes: Fundamental trees codes, trellis codes, convolution codes. Methods of setting convolution codes: Generation polynomials, generation matrix. Protection capability of tree codes. Encoding and decoding process realization.
- Anti-error code protection systems (ACPS). Example of the formation of ACPS. Position of ACPS in a superior transmission system. Requirements made on ACPS and their solution possibilities. Examples of ACPS.
- Special modulations which make use of the anti-error protection principles. Systems with multilevel phase keying. Artificial increase in modulation system redundancy. Anti error coding in a phase keying system.
- Scrambling technology. Necessity of uniform distribution of signal energy. Fundamental scrambler. Scramblers with N counters for N periods. Spectral characteristics of output signal. Scramblers and phasing. Transmission security during scrambling.
- Encryption basics. Principles of data security: Cryptography and cryptoanalysis, cryptographic system, cryptographic key, rules of cryptology. Methods of classical cryptology. Public key encryption.
- Security assurance in networks. Security problems in computers networks. Encryption in networks. Verification of access. Authentication of users. Endangerment by active nodes. Monitoring of traffic. Data integrity.
- Queuing theory. Description of queuing system (QS): Properties, structure, significance of individual parts. Queuing theory characteristics: Kendall classification of QS, other parameters of QT. Examples of application QS in technical practice: Node throughput of communication networks, designing a system of maintenance.
|Syllabus of laboratory exercises:|
- Stochastic parameters of data transmission.
- Synchronous and asynchronous communication on point-to-point data link.
- Data signal protection by general block codes.
- Data signal protection by cyclic block codes.
- Data signal protection by convolution codes.
|Syllabus of computer exercises:|
- Data signal compression in data communication systems.
- Scrambling in data communication systems.
- Fundamentals of encryption technology in data communication systems.
- Anti-error protection code systems in data communication systems.
- Simulation of the influence of transmission parameters on data signal.
| || ||Continual checking of classwork: At the end of each laboratory or computer practice, the instructor checks the presentation of results of the assignment given and awards points. The points obtained for laboratory measurements and computer practice (a maximum of 30 points in a semester) are a part of the evaluation in the examination and thus of the final assessment.|
| || ||A precondition for awarding the credit pass is a successful completion of laboratory measurements and computer practice. The student can miss 20% of practice if properly excused. The missed practice must be made up for by agreement with the instructor.|