OVERVIEW

The course provides the foundations for digital system analisys and design. We start from Boolean algebra and binary arithmetic, arriving to sequential networks design, using the Finite State Machines model and ASM diagrams. 

AIMS AND CONTENT

LEARNING OUTCOMES

Digital Design foundations: Boolean algebra, binary arithmetic, combinatorial and sequential networks. Finite State Machines.

AIMS AND LEARNING OUTCOMES

Aim of the course is to provide the basics for the analisys and the design of digital systems. After introducing Boolean algebra and binary arithmetic, the course covers the methods of analysis and design of combinational and sequential digital networks, using the technique of Finite State Machines model, with the help of the ASM diagrams.

The laboratory, integrated in the times and contents with the lessons, allows the student to apply the acquired knowledge to the simulation, design and prototyping of digital systems.

The teaching is in the direction of forming a professional figure capable of analyzing, understanding and solving problems in the design of digital hardware solutions. In particular, the student will be able to analyze the behavior of digital systems based on combinational and sequential networks, to describe their functionality in terms of finite state machines, and to solve design problems of control systems of networks organized according to the model "Controller - datapath". 

TEACHING METHODS

The course consists of lectures and laboratories. The laboratory sessions are dedicated to the analysis, design, simulation and implementation of digital circuits. 

SYLLABUS/CONTENT

Introduction to the course, information representation, Boolean functions and logic networks, Shannon expansion theorem, standard combinational circuits.

Minimization of Boolean functions, Karnaugh maps, hints of algorithmic methods.

Binary arithmetic, binary codes and operations, complements, conversions, major arithmetic-logical architectures, error detection codes, alphanumeric codes.

Introduction to sequential circuits, timing concepts, Flip-Flops (SR FF, FF D Latch, FF JK, D and E PET), registers, counters, sequential networks analysis.

Introduction to Finite State Machine (FSM) and ASM charts (status block, conditional block, conditioned outputs). Project examples and exercises, state assignment criteria, hint of asynchronous FSM.

RECOMMENDED READING/BIBLIOGRAPHY

Lecture notes and slides provided on AulaWeb.

Text book: G. Donzellini et al.  "Introduction to digital system design", Springer, 2019

TEACHERS AND EXAM BOARD

Exam Board

RICCARDO BERTA (President)

CHRISTIAN GIANOGLIO (President Substitute)

EDOARDO RAGUSA (President Substitute)

LESSONS

LESSONS START

https://corsi.unige.it/9273/p/studenti-orario

Class schedule

The timetable for this course is available here: Portale EasyAcademy

EXAMS

EXAM DESCRIPTION

The examination of the course consists of a written exam and an oral examination. The written parrt consists in the completion of a project of a digital system controlled by MSF.

ASSESSMENT METHODS

The written exams evaluate the ability to analyze, understand and complete digital systems of moderate complexity, based on combinational and sequential networks. In particular, the written test allows to verify the correct use of the finite state machine model in the design of a system organized according to the “controller - datapath” model. 

The final oral exam allows to verify the ability to understand, analyze and program digital systems based on combinational and sequential networks . The evaluation parameters include: understanding the concepts relating to the analysis and design of digital networks, the ability to analyze the specific dates and architectural elements of a digital system, the ability to reasoning of exposure through the correct use of the specialist lexicon.

Exam schedule