Students will gain fundamental knowledge on the structure of digital systems, based on levels of characteristic logic circuits and subsystems, as well as on applying basic methods of digital systems analysis and design, both combinational and sequential. Students will be qualified to carry out basic design procedures using standard and programmable modules, under physical constraints imposed by both dynamic and electrical characteristics of circuits and their interconnections.
- choose the appropriate level of standard combinational and sequential components to design simple digital circuits
- design simple combinational and sequential digital circuits
- analyze simple combinational and sequential digital circuits
- apply Boolean algebra as a formalism for describing of combinational and sequential digital circuits
- apply the VHDL hardware description language in modeling and simulation of simple combinational and sequential digital circuits
- identify and classify standard and programmable combinational and sequential digital circuits
- recognize the limitations represented by dynamic and electrical properties of digital circuits and their interconnections
Forms of Teaching
|Type||Threshold||Percent of Grade||Threshold||Percent of Grade|
|Laboratory Exercises||50 %||15 %||50 %||15 %|
|Homeworks||0 %||10 %||0 %||0 %|
|Quizzes||0 %||5 %||0 %||0 %|
|Class participation||0 %||10 %||0 %||0 %|
|Mid Term Exam: Written||0 %||30 %||0 %|
|Final Exam: Written||40 %||40 %|
|Exam: Written||50 %||85 %|
Short evaluations will be in principle performed by assigning short tests during the lectures.
Week by Week Schedule
- Introduction and course overview. Analog values and their digital representation. Binary system, binary arithmetic, basic operations: addition, subtraction, multiplication.
- Binary codes and coding. Error detecting and error correcting codes.
- Propositional logic, Boolean algebra, Boolean functions, canonical forms for Boolean functions. Minimization of Boolean functions: algebraic, Karnaugh maps.
- Quine-McCluskey method for minimization of Boolean terms. Incompletely specified functions. Delay and hazard.
- Basic logic circuits: AND, OR, NOT, NAND, NOR, EX-OR. Transistor (CMOS) level implementation of Boolean functions. Integrated digital circuits. Electrical characteristics.
- Standard combinational modules: decoders, demultiplexors, multiplexors, ROMs, priority encoders, comparators. VHDL models of combinational modules. Standard combinational module implementation of Boolean functions.
- Arithmetic circuits: adders, carry look-ahead generators, subtractors, multipliers, shifters.
- Midterm examination.
- Programmable modules: PLDs and FPGAs. Programmable module implementation of Boolean functions.
- Flip-flops: basic latch, flip-flop, flip-flop types, triggering, dynamic parameters.
- Sequential circuits, finite state machines, Moore and Mealy automata, state diagram and table. Design of synchronous sequential circuits, state minimization, state coding. Analysis of synchronous sequential circuits.
- Standard sequential modules: registers, shift registers, counters - ripple and synchronous.
- Memories: characteristic parameters; static and dynamic memories; memory modules organization.
- Interfacing digital systems with the analog environment, D/A and A/D conversion.
- Final examination.