LEARNING OUTCOMES

The course introduces the methodologies for the study and design of digital systems. Contents: Boolean algebra, description, synthesis and optimization of combinational networks, design of finite state machines asynchronous and synchronous, analysis and synthesis of complex subsystems (counters, adders, arithmetic units, memories, ..). The digital systems will be descibed using the VHDL language.

AIMS AND LEARNING OUTCOMES

At the end of the course the student will be able to understand, analyze, and design (at a functional level) simple digital systems based on Finite State Machines.

PREREQUISITES

None.

TEACHING METHODS

The course alternates between lectures and lab sessions.

SYLLABUS/CONTENT

1. Boolean algebra and combinational logic
- Classic approach that does not require preliminary knowledge.
2. Combinational Network Design
- Synthesis and minimization with Karnaugh maps.
- Standard combinational logic.
- Propagation delays.
3. Numeral Systems and Binary Arithmetic
- Classic approach.
- Arithmetic networks.
4. Introduction to Sequential Networks
- Intuitive transition from combinational to sequential logic.
- Structure and operation of principal flip-flop types.
- Dynamic flip-flop characteristics.
5. Flip-flop Based Synchronous Networks
- Introduction to synchronous flip-flop networks.
- Sequential networks: registers and counters.
- Techniques for timing analysis of synchronous networks.
6. Sequential Networks as Finite State Machines
- FSM pro ject, realized through ASM diagrams.
- Solved exercises of ASM diagrams.
- FSM synthesis with state tables and maps.
7. The Finite State Machine as System Controller
- Design of Controller-Datapath systems.
- Solved exercises on Controller-Datapath systems.

RECOMMENDED READING/BIBLIOGRAPHY

Donzellini, G. and Oneto, L. and Ponta, D. and Anguita. D., Springer, Introduzione al Progetto di Sistemi Digitali, 2018.

Donzellini, G. and Oneto, L. and Ponta, D. and Anguita. D., Springer, Introduction to Digital Systems Design, 2019.