You are on page 1of 27

Kogge Stone Adder Logic Verification

D. W. Parent

This is a very efficient 1 bit full adder.

Carry Look Ahead

generate propagate carry sum

Derive the schematic.

It is easier to manage the design if you partition items into blocks

The Generate Propagate Block (4 bits seemed easier to do.)

The look ahead carry generate block

Very y similar to 4 bit CLA but note there is a P and G t term.


6

The sums are broken up into 4 bits each. This will help with LVS later.

WN/WP for a 16 bit CLA Adder in Static

Did not take into account Fan out or wiring capacitance.

WN/WP for a 16 bit CLA Adder in dynamic

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

Note: Two ij i:j output vectors Black Cell Gi:j, Pi:j

i:j i j Gray Cell Gi:j

i:j Buffer

10

Higher order diagrams can be made as well

i:k k-1:l l-1:m m-1:j

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

MCC PG Group P and d G for f Each E h line li inside i id


15 14 13 12 11 10 9 8 7 6 5 4 3 2 1

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

Final Sum XOR inside

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

A Grey cell is a Black cell without the group propagate

17

Tree Diagram of KS adder from D id H David Harris i

18

8 bit KS adder schematic with carry in and carry out

19

Does this adder work properly?


Boolean logic analysis would be great to try and show the equivalence of a ripple, or carry look ahead adder to a KS Not my strong suit.

20

Create and verify a 1 bit full adder

21

Create C eate a 8b 8bit tt trusted usted adde adder

22

Create a 9 bit bit-wise bit wise XOR


This will be used to compare the carry out and sum signals of both adders.

23

KS ADDER

Create a test bench that will feed the same test vectors into both adders and compare their outputs.
24

Run KS adder against Trusted adder dd


Search for 1. If signals g are different then XOR will g give one.

Can not really see if there is a 1 value at this time scale.


25

Export Data Into Text


NC verilog tracks the changes only. WE can see that no signal was a 1 and since we did all test vectors the adders are logically equivalent.
This is all the data.

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