Digital Design

Learning Outcome

This course aims to equip undergraduate students with ALL the fundamental knowledge that will enable them to follow the developments taking place in the field of Logic Design of Digital Circuits. It combines extensive reference to the theoretical foundation of Boolean Algebra with a broad introduction to concepts from Algebraic Structures. The material then focuses on the study of combinational circuits without memory elements and covers design and minimization of circuits of two or more variables as well as design issues of programmable combinational circuits. This is followed by an extensive introduction to the design of sequential circuits containing memory elements accompanied by the study of many characteristic cases. In addition, the students’ laboratory training focuses on learning the VERILOG language and using programs for the synthesis (Synopsys Design Compiler) and checking of the correct circuit design (SAT Solvers, BDDs).

Upon successful completion of the course, the student will have acquired the knowledge to:

• Basic Concepts of Boolean Algebra
• Basic logic gates and sequence elements
• Logic functions (truth tables, state tables, BDD, CNF)
• Simple digital circuit design methods and related techniques (Karnaugh maps, discrete gate design)
• The methods of designing more complex digital circuits (Verilog, Design Compiler, Quine-McCluskey method)

Indicative Module Content

• Boole algebra, logic gates.
• Combinational logic, logic functions.
• Digital combinational circuits.
• Karnaugh Maps.
• Sequential logic.
• Basic elements of sequential logic (flip-flops).
• Registers, counters, shift registers, memories.
• Design of sequential logic circuits.

Module’s Address in eClass

• https://eclass.uth.gr/courses/DS_U_105/