Digital Engineering
Code  Completion  Credits  Range  Language 

BE2B32DIT  Z,ZK  4  2+2l 
 Lecturer:
 Michal Lucki (guarantor), Pavel Lafata
 Tutor:
 Michal Lucki (guarantor), Petr Hampl, Pavel Lafata, Tomáš Pehnelt
 Supervisor:
 Department of Telecommunications Engineering
 Synopsis:

In this course, students will learn design principles for combinational and sequential digital circuits, using TTL components as well as field programmable gate arrays. The functional design using standard mathematical description and VHDL will be used for designing and realization of various digital circuits. The laboratory classes will be arranged as a set of laboratory tasks and practical examples. Some laboratory lessons will be focused on VHDL and its application for realization of basic digital circuits using FPGAs, their simulations and emulations as well as creating more advanced digital blocks.
 Requirements:

The prerequisite is the knowledge on basic mathematic operations at the high school level.
 Syllabus of lectures:

1. Number systems (binary, hexadecimal). Unsigned and signed binary numbers. Binary addition, subtraction, and multiplication. Binary codes  BCD, Gray code.
2. Digital circuits. Boolean Algebra, logic functions. Algebraic minimization of logical functions. De Morgan Transformations. Truth tables. Logic gates.
3. Minimization of logic functions, de Morgan transformations, Karnaugh maps, implementation of logic functions using gates. Static and dynamic hazard.
4. Combinational logic circuits. Design stages. Possibilities to solve sequential logic as combinational circuit with the feedback loop.
5. Multiplexer, demultiplexer. Using 4bit and 8bit multiplexers from the TTL series.
6. Equality comparator, priority encoder. 3state function. Decoder using a „3state function“.
7. Basic features of VHDL syntax  program structure, ports, architecture, processes, sensitivity lists, objects, and signals.
8. Sequential circuits. Finite state machine. Synchronous Moore machine. Transient and output functions. State diagram and transitions table. Hardware implementation.
9. Latching, switching and memory components. Asynchronous and synchronous operation. RS latch NOR and NAND implementation. Dlatch, Dtype flipflop, JK and T flipflops. Output and transient functions for the memory components.
10. Asynchronous sequential Mealy machine. Automatic regulation. Minimization of transition tables using triangle table. Noncontradicting states.
11. More advanced sequential logics  binary counters, modulo counters, shift registers  design stages.
12. Technologies for HW realization of logic gates and circuits  TTL, CMOS
13. VHDL  simulations, behavioral design, implementation of combinational and sequential machines in Xilinx environment.
14. Summary for the examination.
 Syllabus of tutorials:

1. Introduction, introduction into laboratory tasks, conditions for credits.
2. Number systems, arithmetical operations in number systems.
3. Boolean algebra, logic functions, expression of logic functions.
4. Karnaugh maps. Minimization and implementation of logic functions.
5. Combinational logic circuits  design and implementation on FPGA (Schematics).
6. Multiplexers  design and implementation.
7. Test 1. Designing combinational logic circuits.
8. Sequential logic circuits, case studies.
9. Basic blocks in VHDL, modules, ports, signals.
10. RSlatch, Dtype flipflop. Binary adders.
11. Simulation of combinational circuits using VHDL.
12. Simulation of sequential circuits using VHDL.
13. Test II. Designing sequential logic circuits.
14. Assessment, credits.
 Study Objective:

The goal of this course is to introduce combinational and sequential logic circuits implemented on TTL compoments as well as modern field programmable gate arrays programmed in VHDL.
 Study materials:

[1] GREGG, J.: Ones and Zeros: Understanding Boolean Algebra, Digital Circuits, and the Logic of Sets (IEEE Press Understanding Science & Technology Series), 1998
[2] CHU, PONG P.: FPGA Prototyping by VHDL Examples: Xilinx Spartan3 Version, WileyInterscience; 1 edition, 2008
[3] PEDRONI, V.: Circuit Design and Simulation with VHDL, MIT Press, 2010
[4] STANKOVIC, R., ASTOLA, J.: From Boolean Logic to Switching Circuits and Automata: Towards Modern Information Technology (Studies in Computational Intelligence), Springer, 2011
[5] WHITESITT, J.: Boolean Algebra and Its Applications (Dover Books on Computer Science), 2010
[6] FABRICIUS, E.: Digital Design and Switching Theory CRC Press; 1 edition, 1992
 Note:
 Further information:
 https://moodle.fel.cvut.cz/BE2B99DIT
 Timetable for winter semester 2018/2019:

06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon Tue Fri Thu Fri  Timetable for summer semester 2018/2019:

06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon Tue Fri Thu Fri  The course is a part of the following study plans: