Introduction to basic digital electronic circuits. Notions put into practice during supervised study sessions. Providing the basics of combinatorial logic, sequential with the application of classic digital functions and circuits used in the majority of integrated circuits. (registers, arithmetic operators, FSM).
| On completion of the unit, the student will be capable of: | Classification level | Priority |
|---|
| Percentage ratio of individual assessment | Percentage ratio of group assessment | ||||
|---|---|---|---|---|---|
| Written exam: | 100 | % | Project submission: | % | |
| Individual oral exam: | % | Group presentation: | % | ||
| Individual presentation: | % | Group practical exercise: | % | ||
| Individual practical exercise: | % | Group report: | % | ||
| Individual report: | % | ||||
| Other(s): % | |||||
| Type of teaching activity | Content, sequencing and organisation |
|---|---|
| Course | Representation of numbers, Coding, Boolean algebra (representation of logic functions, simplification methods). |
| Course | Boolean systems, (elementary logic gates, logical equations synthesis), arithmetic operators, - Application to combinatory logic |
| Course | Sequential logic: (notions of sequential circuits, memory points), scales, registers, sequential circuit synthesis: Huffman method. |
| Course | Machine synthesis with finite state numbers : Moore and Mealy methods |
| Course | Combinatory logic and simplification of Boolean systems |
| Supervised study | Contd. Combinatory logic and simplification of Boolean systems |
| Supervised study | Contd. Combinatory logic and simplification of Boolean systems |
| Supervised study | C |
| Supervised study | Moore and Mealy machines |