
【英文资料】16 BIT KOGGESTONE TREE ADDER.ppt
17页116 BIT KOGGE-STONE TREE ADDER2Agenda•Abstract•Introduction–Why Tree Adder?–Theory•Project Details•Summary of Results•Lessons Learned•Cost Analysis•Conclusion3Abstract•We designed 16 bit Kogge-Stone Tree Adder - the most commonly used parallel prefix carry-lookahead adder topology.•200MHz clock frequency•Area 1000*600 um^2•Power density •AMI06 Technology4Introduction•Why? - minimum logic depth, wide wiring channels, regular structure and large fanout points. •Prefix Adder Structure5PROJECT DETAILS•17 pin outs •33 input D-flip flops and 17 output D-flip flops•Create schematic and layout for 16 bit tree adder•Test schematic using test bench•Run DRC and LVS to verify the design6 BLOCK DIAGRAM7Longest path calculationTphl = 5ns/(14+3) = .29ns8Table of actual Wn & Wp9Schematic10Layout11DRC Report12Extraction report13LVS Report14Cost Analysis•Estimate amount of time spent on project:- Verifying NC Verilog5 hrs- Verifying Timing10 hrs- Layout40 hrs- Post Extracted Timing10 hrs15Lessons Learned•Start early•Work in group•Study previous projects•Seek advice from Dr. Parent and previous students•Save time for debugging error 16Conclusions•We designed and implemented a 16 bit Kogge-Stone Tree Adder that operates at 200MHz in an area of 1000*600 um^217Acknowledgements•Thanks to Cadence Design Systems for the VLSI lab•Thanks to Dr. David Parent•Thanks to all 166, 167, and 224 students。
