Академический Документы
Профессиональный Документы
Культура Документы
Amir M. Sodagar
Spring 2003
Amir M. Sodagar K.N.Toosi University of Technology 1
Full Adders, Conv. Static CMOS
q Conventional Static CMOS Implementation
[Martin, 2000]
Amir M. Sodagar K.N.Toosi University of Technology 2
Full Adders, TG
q TransmissionGate Implementation
[Martin, 2000]
Amir M. Sodagar K.N.Toosi University of Technology 3
Full Adders, FullyDiff.
q A fullydifferential implementation
[Martin, 2000]
Amir M. Sodagar K.N.Toosi University of Technology 4
Full Adders, FullyDiff.
q A fully differential full adder in which the
carryin is known to be a “0”.
[Martin, 2000]
Amir M. Sodagar K.N.Toosi University of Technology 5
Full Adders, Manchester
q Manchestertype Full Adder
o To be effectively used in CarrySkip Adders
With noncomplemented carry With complemented carry
[The VLSI Handbook’2000]
Amir M. Sodagar K.N.Toosi University of Technology 6
Adders
q Adders
Ø Serial Adder
Ø Ripple Carry Adder
Ø Carry Skip Adder
Ø Carry Select Adder
Ø Carry Save Adder
Ø Carry LookAhead Adder
Ø Conditional Carry Adder
Amir M. Sodagar K.N.Toosi University of Technology 7
Adders
q Possible symbols for full adders used in the
proceeding adder architectures.
[Martin, 2000]
Amir M. Sodagar K.N.Toosi University of Technology 8
Adders, Serial
q A Serial Adder
[Martin, 2000]
Amir M. Sodagar K.N.Toosi University of Technology 9
Adders, RippleCarry
q A fast 4bit ripplecarry adder based on
using complemented inputs
[Martin, 2000]
p i =XOR(x i , y i )
[The VLSI Handbook’2000]
[Uyemura, 99]
[Martin, 2000]
The multiplexor The logic required for generating C out
[Martin, 2000]
[Martin, 2000]
[Martin, 2000]
[Martin, 2000]
[Martin, 2000]
q A simplified latch
with hysteresis
[Martin, 2000]
[Martin, 2000]
q A CMOS realization
[Martin, 2000]
q A compromise
biphase latch
[Martin, 2000]
Nblock latch Pblock latch
[Uyemura, 99]
Ø An inverterbased
realization
[Martin, 2000]
Ø Masterslave architecture
[Martin, 2000]
[Martin, 2000]
[Martin, 2000]
[Martin, 2000]
[Martin, 2000]
JKFF using a DFF JKFF based on crosscoupled
NOR gates
[Martin, 2000]
[Martin, 2000]
[Martin, 2000]
q A ripple counter
Ø The maximum input frequency of this counter is constrained only by how
fast the first flipflop can toggle. This makes the ripple counter one of the
fastest available, particularly if a biphase flipflop is used for the first
stage.
Ø However, the time from when the first flipflop changes to when the last
flipflop has settled can be quite large.
o This is because the changes ripple through from flipflop to flipflop.
o This makes the counter a poor choice for use in synchronous circuits.
[Martin, 2000]
[Martin, 2000]
[Martin, 2000]
Ø Signed
o BaughWooley
o Booth
o Array
o …
0 1 1 1 0 1 multiplicand (29)
x 1 0 1 0 1 1 multiplier (43)
0 1 1 1 0 1 partial product
0 1 1 1 0 1
• product = 0
0 0 0 0 0 0
• for i = 0 to n-1
0 1 1 1 0 1 – compute partial product
0 0 0 0 0 0 (AND operation)
0 1 1 1 0 1 – leftshift partial product by i
– product += partial product
1 0 0 1 1 0 1 1 1 1 1 product
[U of Alabama, 2003]
pp
adder
product P
A
multiplier
[U of Alabama, 2003]
Critical Path 1
Critical Path 2
[Martin, 2000]
Y1
P1
Y2
+ + + + +
P2
Y3
+ + + + +
P3
Y4
+ + + + +
P4
Y5
+ + + + +
P5
Y6
+ + + + +
P6
+ + + + +
C in C out
FA FA FA
S
Amir M. Sodagar K.N.Toosi University of Technology 42
Pipelining
q Basic Concept A 2 B 2
Ø Pipelined Adder
A 1 B 1 D D
A 0 B 0 D D D D
C in C out
FA D FA D FA D
D D D
D D S 2
D S 1
S 0
Amir M. Sodagar K.N.Toosi University of Technology 43
Pipelining
q Basic Concept 0 0
A 2 1 B 2 0
1
0
Ø Pipelined Adder 1 1
A 1 0 B 1 1 D D
1 1
0 0
A 0 0 B 0 1 D D D D
1 0
0 1 0 0
C in FA D FA D FA D C
1 out
D D D
S 2
D D
S 1 A=110, 001, 010
D T1 T2 T3 T4 T5 T6 T7
B=011, 110, 010
S 0 f
C in =0, 1, 0
Amir M. Sodagar K.N.Toosi University of Technology 44
Pipelining
q Basic Concept
A 2 0 B 2 0
0
1
Ø Pipelined Adder
A 1 1 B 1 D D
0 1 1 0 1
A 0 0 B 0 D D D D
0 0 1 1 1
0 1 1 0 1
C in FA D FA D FA D C
0 0 out
D D D
1
S 2
D D
S 1 A=110, 001, 010
D T1 T2 T3 T4 T5 T6 T7
B=011, 110, 010
S 0 f
C in =0, 1, 0
Amir M. Sodagar K.N.Toosi University of Technology 45
Pipelining
q Basic Concept
A 2 B 2 0
0
Ø Pipelined Adder
A 1 1 B 1 1 D D
1 0
A 0 0 B 0 0 D D D D
0 1 0 1
0 0 1 1
C in FA D FA D 1 FA 1
D C
0 0 0 out
D D D
0 0
S 2
D D
1
S 1 A=110, 001, 010
D T1 T2 T3 T4 T5 T6 T7
B=011, 110, 010
S 0 f
C in =0, 1, 0
Amir M. Sodagar K.N.Toosi University of Technology 46
Pipelining
q Basic Concept
A 2 B 2
Ø Pipelined Adder
A 1 B 1 D D
0 0
A 0 B 0 D D D D
1 1 1 0
0 1 1 1
C in FA D FA D FA D 1 C
0 0 out
D D D
0 0
S 2 0
D D
0
S 1 0 A=110, 001, 010
D T1 T2 T3 T4 T5 T6 T7
1 B=011, 110, 010
S 0 f
C in =0, 1, 0
Amir M. Sodagar K.N.Toosi University of Technology 47
Pipelining
q Basic Concept
A 2 B 2
Ø Pipelined Adder
A 1 B 1 D D
A 0 B 0 D D D D
0 0
1 0 1 1
C in FA D FA D FA D C
1 out
D D D
0 0
S 2 0
D D
0 0
S 1 0 A=110, 001, 010
D T1 T2 T3 T4 T5 T6 T7
0 B=011, 110, 010
S 0 1 f
C in =0, 1, 0
Amir M. Sodagar K.N.Toosi University of Technology 48
Pipelining
q Basic Concept
A 2 B 2
Ø Pipelined Adder
A 1 B 1 D D
A 0 B 0 D D D D
0 1 1
C in FA D FA D FA D C
out
D D D
1
S 2 0
D D 0
0
S 1 0 A=110, 001, 010
D 0
T1 T2 T3 T4 T5 T6 T7
0 B=011, 110, 010
S 0 0 f
1 C in =0, 1, 0
Amir M. Sodagar K.N.Toosi University of Technology 49
Multipliers, Pipelined Array Mult.
x4 x3
Pipelined
y4 y3 y2 y1 x2 x1
q
Array
Multiplier
+ 0
+ + 0
+ + + 0
+ +
+
0
+
+
+
[The VLSI Handbook’2000]
OR AND
Program Program
Cell Cell
[Geiger, Allen, Stradr, 1990]
[Martin, 2000]
[Martin, 2000]
[Martin, 2000]
This circuit can be laid out very densely
using a programmable logic array (PLA)
like layout.
[Martin, 2000]
[Martin, 2000]
[Martin, 2000]
[Martin, 2000]
[Martin, 2000]
A 4input inverting decoder
[Martin, 2000]
A i B i
A i1 B i1
BitSlice i
...
(MSB)
(MSB)
(LSB)
(LSB)
[Martin, 2000]
1 0 0 0
(MSB)
(MSB)
0 1 0 0
0 0 1 0
0 0 0 1
(LSB)
(LSB)
[Martin, 2000]
Sh1
A 2
B 2
Sh2 : Data Wire
A 1
B 1 : Control Wire
Sh3
A 0
B 0
A 3
A 2
A 1
A 0
[Martin, 2000]