Professional Documents
Culture Documents
D. W. Parent
The sums are broken up into 4 bits each. This will help with LVS later.
Higher order adders are too complex to draw at the circuit level
i:k
4 input
i:k 3 input
k-1:j
i:k
i:j Buffer
10
i:j
11
The Manchester Carry Chain can be greatly simplifies in multiple output domino logic
12
3:0
2:0
1:0
0:0
G=C
15:0 14:0 13:0 12:0 11:0 10:0 9:0 8:0 7:0 6:0 5:0 4:0 3:0 2:0 1:0 0:0
13
Example: Find the Delay of the 16bit MCC adder. Assume the MCC domino vs Static
15 14 13 12 11 10 9 8 7 6 5 4 3 2 1
15:0 14:0 13:0 12:0 11:0 10:0 9:0 8:0 7:0 6:0 5:0 4:0 3:0 2:0 1:0 0:0
14
This example shows how the logic was verified ifi d of f a Kogge K St Stone Adder Add
The Major Steps were:
Convert grey and black cells to schematics Convert tree tree diagrams into a schematic Create a trusted adder Compare trusted adder to new adder
15
Black Cell
When doing a completely new logic just use the th di digital it l parts t i in th the NCSU kit!
Schematic
Symbol
Make sure to edit the labels so that they can be seen in a large Schematic Schematic.
16
Grey Cell
Once could use AOI or NAND NAND to implement these cells.
Schematic
Symbol
17
18
19
20
21
22
23
KS ADDER
Create a test bench that will feed the same test vectors into both adders and compare their outputs.
24
26
Summary
This technique was used to finally verify a KS adder structure. There is a reason the adder was labeled adder3 This was not an efficient method of verification
Program g adder! Use Boolean logic! It still worked.
27