1. Gheorghe M. Ştefan http://arh.pub.ro/gstefan/ - 2014 -

2. Featuring by looping 2014Digital Integrated Circuits - week five2

3. Loops & autonomy 2014Digital Integrated Circuits - week five3

4. The taxonomy of digital systems 2014Digital Integrated Circuits - week five4 Included loops:

5. From order 0 to order 3 2014Digital Integrated Circuits - week five5

6. Order 4 & order n systems 2014Digital Integrated Circuits - week five6

7. Our final target: toyMachine 2014Digital Integrated Circuits - week five7

8. toyMachine: architectural description 2014Digital Integrated Circuits - week five8

9. Instruction format 2014Digital Integrated Circuits - week five9

10. Control instructions 2014Digital Integrated Circuits - week five10

11. Data instructions 2014Digital Integrated Circuits - week five11

12. Input-output instructions 2014Digital Integrated Circuits - week five12

13. 2014Digital Integrated Circuits - week five13

14. instructionStructure.v 2014Digital Integrated Circuits - week five14

15. controlFunction.v 2014Digital Integrated Circuits - week five15

16. 2014Digital Integrated Circuits - week five16

17. interpol circuit 2014Digital Integrated Circuits - week five17

18. The main routine 2014Digital Integrated Circuits - week five18

19. Pseudo-macros 2014Digital Integrated Circuits - week five19

20. Binary form 2014Digital Integrated Circuits - week five20

21. Gates: 0-order systems Simple, recursively defined circuits: Decoders Demultiplexers Multiplexers Arithmetic circuits Arithmetic and logic unit (ALU) Comparator Complex, patternless circuits 2014Digital Integrated Circuits - week five21

22. Decoders 2014Digital Integrated Circuits - week five22

23. Decoder: recursive definition 2014Digital Integrated Circuits - week five23

24. Home work 5 Problem 1: rezolvati problema corectiei pixelilor folosind toyMachine cu regula mai precisa: s’(t) = if (s(t)= 0) then (3×s(t-1)+5×s(t-1)+5×s(t+1)+3×s(t+1))/16 else s(t) Problem 2: desenati cu porti logice cu doua intrari si inversoare structura unui decodificator cu 4 intrari pornind de la definitia recursiva a DCD-ului (vezi slide 23). Problem 3: proiectati un circuit care calculeaza 2 m unde m=2 n. Comparati size-ul circuitului rezultat cu cel al circuitului care calculeaza valoarea lui 2 n. 2014Digital Integrated Circuits - week five24