440-2104/01 – Introduction to Digital Systems (ZDS)
Gurantor department | Department of Telecommunications | Credits | 5 |
Subject guarantor | Ing. Marcel Fajkus, Ph.D. | Subject version guarantor | Ing. Marcel Fajkus, Ph.D. |
Study level | undergraduate or graduate | Requirement | Compulsory |
Year | 2 | Semester | winter |
| | Study language | Czech |
Year of introduction | 2019/2020 | Year of cancellation | |
Intended for the faculties | FEI | Intended for study types | Bachelor |
Subject aims expressed by acquired skills and competences
The goal of the subject is to present to students the digital systems and their realization with gates and finite state machines, representation of numbers and glyphs, basic algorithms for arithmetic operations in digital systems.
Teaching methods
Lectures
Tutorials
Experimental work in labs
Project work
Summary
Introduction to the hardware realization of digital systems - logic, Boolean algebra and functions, gates, latches and flip flops, combinational and sequential circuits, finite state machine, properties basic circuits as multiplexers, decoders, registers, counters, adders.
Introduction to representation of information in the digital systems - numeral number systems with any radix, importance of binary and decimal numeral systems, binary and hexadecimal arithmetic operations, representation of glyphs and characters, ASCII code, UNICODE, representation of integer and real numbers.
Compulsory literature:
Recommended literature:
Additional study materials
Way of continuous check of knowledge in the course of semester
Projects.
Tests.
Activities.
Final exam will be by test and oral exam form.
E-learning
LMS: Kurz: 440-2104/01 Základy digitálních systémů
https://lms.vsb.cz/course/view.php?id=118321
Other requirements
Knowledge of programming language C or C++, design flowchart of program.
Prerequisities
Subject has no prerequisities.
Co-requisities
Subject has no co-requisities.
Subject syllabus:
Lectures:
• Logic, Boolean algebra, Boolean functions and their representation, numeral systems – positional system, conversion of integer numbers.
• Definition of basic forms for two level logic network, canonical forms, minimization based on Boolean algebra and Karnaugh maps, introducing computer algorithm for minimization (McCluskey, Expesso, ...)
• Gates and corresponding operations, logical signals and their active levels, design logical network, realization based on combination AND-OR, OR-AND, NAND-NAND, NOR-NOR.
• Positional numeral systems and conversation between them, integer and real numbers, connection between binary, octal and hexa numeral system.
• Representation integer numbers – sign-and-magnitude method, ones‘ and two’s complement, offset binary, arithmetic operations – addition, subtraction, multiplication and division, flags negate (N), zero (Z), overflow (V) and carry (C).
• Realization of binary arithmetic addition and subtraction, ripple-carry adder, carry-lookahead adder, multiplication, division and their basic hardware realization.
• Representation real numbers, fixed point numbers, Qm.n format, floating point numbers according to IEEE 754-2008, arithmetic operations, program implementation of multiplication and division, flags of operations.
• Representation glyphs, characters, ASCII code, Unicode, UTF algorithms.
• Representation real and integer numbers in BCD code, arithmetic operation – addition.
• Asynchronous RS latch, synchronous D, T, JK flip-flops.
• FSM – finite state machine, automata with finite state, definition of behaviour, possibility of description – graphic and software.
• Digital synchronous system – control and data unit, realization of control unit – D flip-flops, microprogramming control unit, example.
• Technology of digital circuits – bipolar TTL, unipolar CMOS, electric properties of gates, log values 0/1 and levels L/H, open collector, three state logic and buses.
Practical lesson
• Introduction, conversion form decimal to binary and hexa numeral systems, Boolean algebra, entering the first project.
Conditions for subject completion
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction