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

Digital Integrated Circuits - week six -

  • Upload
    donkor

  • View
    25

  • Download
    1

Embed Size (px)

DESCRIPTION

Digital Integrated Circuits - week six -. Gheorghe M. Ş tefan http://arh.pub.ro/gstefan/ - 2014 -. Non-recursive definition. Size = ? Depth = ? Fan-out = ?. Application: computes min-terms. Example of using DCDs as CLC. Demultiplexors. - PowerPoint PPT Presentation

Citation preview

Page 1: Digital Integrated Circuits - week six -

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

- 2014 -

Page 2: Digital Integrated Circuits - week six -

Non-recursive definition

2014 Digital Integrated Circuits - week five 2

Size = ?Depth = ?Fan-out = ?

Page 3: Digital Integrated Circuits - week six -

Application: computes min-terms

2014 Digital Integrated Circuits - week five 3

Page 4: Digital Integrated Circuits - week six -

Example of using DCDs as CLC

2014 Digital Integrated Circuits - week five 4

Page 5: Digital Integrated Circuits - week six -

Demultiplexors

2014 Digital Integrated Circuits - week five 5

The signal enable is demultiplexed (distributed, scattered) in m = 2n places according to the code xn-1, xn-2, … x0

Page 6: Digital Integrated Circuits - week six -

Formal definition

2014 Digital Integrated Circuits - week five 6

The circuit is simpleThe Verilog description is synthesisable Size = ?Depth = ?Complexity = ?

Page 7: Digital Integrated Circuits - week six -

Recursive definition

2014 Digital Integrated Circuits - week five 7

Size = ? Depth = ? Fan=out = ? Complexity = ?

Page 8: Digital Integrated Circuits - week six -

Multiplexors

2014 Digital Integrated Circuits - week five 8

Gathers data form m=2n placesaccording to the selection code xn-1, xn-2, … x0

Size = ?Depth = ?

Page 9: Digital Integrated Circuits - week six -

Formal definition

The code is ready for synthesis Complexity = ?

2014 Digital Integrated Circuits - week five 9

Page 10: Digital Integrated Circuits - week six -

Recursive definition

2014 Digital Integrated Circuits - week five 10

Page 11: Digital Integrated Circuits - week six -

Recursive definition (cont)

2014 Digital Integrated Circuits - week five 11

Page 12: Digital Integrated Circuits - week six -

Expanding the input size

2014 Digital Integrated Circuits - week five 12

Page 13: Digital Integrated Circuits - week six -

Application: logic function implementation

2014 Digital Integrated Circuits - week five 13

Page 14: Digital Integrated Circuits - week six -

Increment

2014 Digital Integrated Circuits - week five 14

EINC: half-adder Good news: Size O(n)Bad news: Depth O(n)

Page 15: Digital Integrated Circuits - week six -

Adder

2014 Digital Integrated Circuits - week five 15

Good news: Size O(n)Bad news: Depth O(n)

Page 16: Digital Integrated Circuits - week six -

Adder: behavioral description

2014 Digital Integrated Circuits - week five 16

Page 17: Digital Integrated Circuits - week six -

Carry-Look-Ahead

2014 Digital Integrated Circuits - week five 17

Bad news: Size O(n3)Good news: Depth O(log n)

Page 18: Digital Integrated Circuits - week six -

Arithmetic & Logic Unit (ALU)

2014 Digital Integrated Circuits - week five 18

Page 19: Digital Integrated Circuits - week six -

Home work 6 Problema 1: Folositi metoda descrisa in slide-ul 4 pentru a

realiza un scazator complet de un bit (tableul de adevar l-ati definit in prima tema de casa)

Problema 2: Folositi metoda descrisa in slide-ul 13 si proiectati un circuit care semnaleaza cand pe intrare majoritea bitilor au valoarea 1.

Problema 3: Desenati cu porti AND si OR un circuit Carry-Look-Ahead pentru un sumator de numere de 4 biti. Care este size-ul si depth-ul circuitului rezultat?

2014 Digital Integrated Circuits - week five 19