Digital Technique
Digital Technique BD5B32DIT
Credits | 4 |
Semesters | Winter |
Completion | Assessment + Examination |
Language of teaching | Czech |
Extent of teaching | 1P + 1L |
Annotation
The goal of this course is to provide the introduction into designing and realization of digital circuits. First, necessary mathematical apparatus, such as the Boolean algebra, Karnaugh maps, minimization and realization of logical functions is presented, followed by brief introduction into basics of logical circuits, such as the logical gates, flip-flops, TTL and CMOS logic etc. The second part is dedicated mainly to modern designing techniques of digital circuits using programmable FPGA and VHDL language. During these lessons, the basics of VHDL together with numerous examples are evaluated to provide a complex insight into this hardware description language and modern methods of designing and realization of digital circuits.
Study targets
The goal of this course is to provide the introduction into designing and realization of digital circuits. First, necessary mathematical apparatus, such as the Boolean algebra, Karnaugh maps, minimization and realization of logical functions is presented, followed by brief introduction into basics of logical circuits, such as the logical gates, flip-flops, TTL and CMOS logic etc. The second part is dedicated mainly to modern designing techniques of digital circuits using programmable FPGA and VHDL language. During these lessons, the basics of VHDL together with numerous examples are evaluated to provide a complex insight into this hardware description language and modern methods of designing and realization of digital circuits.
Course outlines
Syllabus:
1. Digital technique, basic terms, number systems, codes.
2. Logic functions, Boolean algebra, logic terms, expressions of logic functions.
3. Minimization of logic functions (truth table, Karnaugh maps, algebraic method), minimization of groups of logic functions.
4. Logic gates based on bipolar and unipolar transistors, characteristics, examples of circuits.
5. Realization of logic functions using given types of gates, logic hazards, eliminations of hazards.
6. Bistable memory circuits: S-R, J-K, T, D, Master-Slave.
7. VHDL language.
8. Memories, types, their characteristics.
9. Multiplexors, decoders, counters, registers, shift registers.
10. Sequential circuits - transition and output functions.
11. Sequential circuits - forms of description, finite state machines.
12. Diagnosis of combinational circuits, basic terms, models.
13. Principles of detection tests.
14. Complete tests, test simplification.
1. Digital technique, basic terms, number systems, codes.
2. Logic functions, Boolean algebra, logic terms, expressions of logic functions.
3. Minimization of logic functions (truth table, Karnaugh maps, algebraic method), minimization of groups of logic functions.
4. Logic gates based on bipolar and unipolar transistors, characteristics, examples of circuits.
5. Realization of logic functions using given types of gates, logic hazards, eliminations of hazards.
6. Bistable memory circuits: S-R, J-K, T, D, Master-Slave.
7. VHDL language.
8. Memories, types, their characteristics.
9. Multiplexors, decoders, counters, registers, shift registers.
10. Sequential circuits - transition and output functions.
11. Sequential circuits - forms of description, finite state machines.
12. Diagnosis of combinational circuits, basic terms, models.
13. Principles of detection tests.
14. Complete tests, test simplification.
Exercises outlines
1. Introduction to Digital Engineering, conditions for credits, guidelines for safe work in the laboratory.
2. Numbers with different radices - conversion, basic mathematical operations, calculation of examples.
3. Logical functions, Boolean algebra, minimization of logical functions using Karnaugh maps.
4. Minimization of logical functions using Quine-McCluskey algorithm, conversion between disjunctive and conjunctive function forms.
5. Test.
6. Laboratory task no. 1 - realization of simple logical circuit, hazards in logical circuits, dynamical characteristics of TTL and CMOS.
7. Laboratory task no. 2 - introduction into FPGA and VHDL, realization of code converters using schematic editor in Xilinx iSE.
8. Laboratory task no. 3 - simulations using VHDL, creating testbench in VHDL, simulation of synchronous and asynchronous counters.
9. Laboratory task no. 4 - realization of simple multiplexor in VHDL using conditions.
10. Laboratory task no. 5 - using structural design in VHDL, components, port-mapping.
11. Laboratory task no. 6 - realization of frequency dividers in VHDL.
12. Laboratory task no. 7 - realization of finite state machine in VHDL.
13. Laboratory task - substitutionary lesson.
14. Assessment, credits.
2. Numbers with different radices - conversion, basic mathematical operations, calculation of examples.
3. Logical functions, Boolean algebra, minimization of logical functions using Karnaugh maps.
4. Minimization of logical functions using Quine-McCluskey algorithm, conversion between disjunctive and conjunctive function forms.
5. Test.
6. Laboratory task no. 1 - realization of simple logical circuit, hazards in logical circuits, dynamical characteristics of TTL and CMOS.
7. Laboratory task no. 2 - introduction into FPGA and VHDL, realization of code converters using schematic editor in Xilinx iSE.
8. Laboratory task no. 3 - simulations using VHDL, creating testbench in VHDL, simulation of synchronous and asynchronous counters.
9. Laboratory task no. 4 - realization of simple multiplexor in VHDL using conditions.
10. Laboratory task no. 5 - using structural design in VHDL, components, port-mapping.
11. Laboratory task no. 6 - realization of frequency dividers in VHDL.
12. Laboratory task no. 7 - realization of finite state machine in VHDL.
13. Laboratory task - substitutionary lesson.
14. Assessment, credits.
Literature
[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 Spartan-3 Version, Wiley-Interscience; 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
[2] CHU, PONG P.: FPGA Prototyping by VHDL Examples: Xilinx Spartan-3 Version, Wiley-Interscience; 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
Requirements
The only prerequisite is the knowledge of basics of mathematical logic at the high school degree level.
Responsible for the data validity:
Study Information System (KOS)