SYNTHESIS AND ANALYSIS OF DIGITAL SYSTEMS
Academic year and teacher
If you can't find the course description that you're looking for in the above list,
please see the following instructions >>
- Versione italiana
- Academic year
- 2016/2017
- Teacher
- MICHELE FAVALLI
- Credits
- 6
- Didactic period
- Secondo Semestre
- SSD
- ING-INF/05
Training objectives
- The course provides the knowledge of theoretical essentials in the logic level design of digital systems and some application to simple problems.
Knowlegde
The course provides the theoretical basis of the synthesis of combinational networks and some example of algorithms in such a field. In addition it will present also some relevant combinational networks such as arihmetic ones. In the case of sequential circuits, the course provide a theoretical essentials and simple algorithms to be used in the synthesis and optimization of finite state machines.
Capabilities
Design and analysis of small combinational and sequential digital circuits using a top-down approach. Use of basic modules implementing standard functions such as the arithmetic ones to build circuits in a bottom-up way. Prerequisites
- Basics of algebra and computer science.
Course programme
- Introduction to digital systems
1) digital and binary signals: technology and motivations
2) binary information encoding
3) numeric informations encoding: natural and integer numbers
4) error detection and correction codes
Boolean algebras and switching algebra
1) axioms and properties
2) functions and expressions
Switch and gate level circuits: analysis algorithms
Synthesis and analysis of combinational circuits
1) circuit models and cost metrics
2) Shannon expansion theorem and canonical SOP and POS forms
3) synthesis and minimization of two-level networks:
3.1) graphical methods
3.2) algebraic methods
3.3) Quine-McCluskey and Espresso
4) synthesis and minimization of multilevel networks by means of heuristics
Basic combinational modules (decoder e multiplexer)
Arithmetic circuits
1) serial adder and carry-look ahead adder
2) multiplier
3) ALU
Digital memories: basic structures and performance characterization of latches and flip-flops
Sequential circuits: modelli strutturali (Huffman)
Finite State Machines
1) definitions and properties
2) state minimization algorithm
Sequential circuits synthesis from finite state machines
1) state encoding
2) clock sizing
Sequential modules of common use (counters, registers) Didactic methods
- Frontal lessons and exercises.
Learning assessment procedures
- Written exam concering both the capabilities to solve simple exercises of analysis and synthesis of small sequential and combinational circuits and the knowledge of the theory related to logic level circuits.
Such a written exam consists of 4 exercises whose evaluation ranges from 0 to 14 points for the first exercise (the longest to be drawn out) and from 0 to 5-7 points for the other 3 exercises. The exact range for the exercises of a given exam has small variations used to account for the different difficulties of exercises. The sum is 31 points (30 cum laude).
The evaluation of each exercise is based on specific criteria depending on the balance between theoretical and practical issues.
Different kinds of exercises are used to evaluate theoric and practical knowledges. In the first case, we evaluate the knowledge and capability to apply basic principles and properties (for instance those of error detecting and correcting codes) to simple problems (that, in the same example, may regard the analysis of the error detection and correction properties). As regards practical skills, another kind of exercises verifies the capability to apply the algorithms for the synthesis of combinational and sequntial circuits.
The final evaluation is given by the sum of the points achieved in the 4 exercises and it is positive if larger or equal to 18/32 points, thus proving the acquisition of the basic knowledges amd abilities specified in the targets of the course. Reference texts
- Handouts provided by the teacher on the course website and the textbook
Salice, Bolchini, Sciuto
Reti Logiche
ed. Apogeo
