OVERVIEW

The course aims at providing the basic concepts of binary logic and arithmetic for the analysis and design of digital systems.

AIMS AND CONTENT

LEARNING OUTCOMES

The course introduces notions and methodologies for the study and design of digital systems.

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.

During the course the following skills will be developed
- personal competence
- social competence
- ability to learn to learn

PREREQUISITES

None.

TEACHING METHODS

- Frontal lesson (approx. 70% to develop ability to learn to learn)
- Laboratories in pairs (approx. 30% to develop personal competence and social competence)

For working students and students with certification of Specific Learning Disabilities (SLD), disabilities, or other special educational needs are advised to contact the instructor at the beginning of the course to arrange teaching and examination methods that, while respecting the teaching objectives, take into account individual learning styles.

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.

TEACHERS AND EXAM BOARD

Exam Board

LUCA ONETO (President)

DAVIDE ANGUITA (President Substitute)

PIERPAOLO BAGLIETTO (President Substitute)

LESSONS

LESSONS START

https://easyacademy.unige.it/portalestudenti/index.php?view=easycourse&_lang=it&include=corso​

Class schedule

The timetable for this course is available here: Portale EasyAcademy

EXAMS

EXAM DESCRIPTION

Written exam plus oral discussion.

ASSESSMENT METHODS

The purpose of the written exam is to verify the ability of the student to design simple digital systems and the oral exam has the purpose to verify both the knowledge level and the ability to exploit the instruments for the design and the analysis of combinatorial and sequential networks.

Exam schedule