1 / 16

EE 5323 Project 16 Bit Sklansky Adder Phase 1 Report

EE 5323 Project 16 Bit Sklansky Adder Phase 1 Report. Yuan Xu 4139225 xuxxx488@umn.edu. Contents. Literature review Schematic Netlist Design Optimization Waveforms of test cases Power consumption at the maximum operating frequency. Literature Review.

onan
Download Presentation

EE 5323 Project 16 Bit Sklansky Adder Phase 1 Report

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. EE 5323 Project16 Bit Sklansky AdderPhase 1 Report Yuan Xu 4139225 xuxxx488@umn.edu

  2. Contents • Literature review • Schematic • Netlist • Design Optimization • Waveforms of test cases • Power consumption at the maximum operating frequency

  3. Literature Review • Sklansky adder belongs to tree adder family. • The difference between Sklansky adder and other tree adders is prefix network. • Compare to other tree adders, Sklansky adder has minimum logic levels, wiring tracks, but maxinumfanout. Also, it has largest delay at the same condition.

  4. Literature review Structure of 16 bit Sklansky Adder (Black square is dot operator Grey square is empty dot operator White triangle is buffer)

  5. Reference List • D.Harris, “ A Taxonomy of Parallel Prefix Networks, Signals ”, Systems and Computers, 2003. Conference Record of the Thirty-Seventh Asilomar Conference on, 2, 2213-2217 Vol.2,2003 • J. Sklansky, “Conditional-sum addition logic,” IRE Trans. Electronic Computers, vol. EC-9, pp. 226-231, June 1960. • J M. Rabaey, A. Chandrakasan, B. Nikolic, “ Digital Integrated Circuits-A Design Perspective (Second Edition)”, Prentice Hall, 2003

  6. Schematic of adder • Precomputation (Generating Propagate value P and Generate value G). • Gi:i=Ai·Bi • Pi:i=Ai⊕Bi

  7. Schematic of adder • Bubble shifted Dot operator

  8. Schematic of adder • Empty empty dot operator

  9. Schematic of adder • Bubble shifted empty dot operator

  10. Schematic of adder • Overall view of adder

  11. HSPICE netlist see attached file • Sizing: • NMOS: L=50nm, W=90nm • PMOS: L=50nm, W=135nm • Temperature: 25°C

  12. Design Optimization • Sizing the gate to minimum size (90nm) can reduce area and power • By using bubble shifting, we save totally 28 inverters, and 4 inverters on the critical path • Adding the buffer can effectively reduce delay. Setting stage=1, fanout=4

  13. Waveforms of test cases • Worst case: For Sklansky adder, the worst case happens when inputs are 7FFF+0001. Since G will propagate from A_0 to S_15 which is the critical path.

  14. Waveforms of test cases • Worst case 7FFF+0001 • A_0-A_15 B_0-B_15 Cout,S_0-S_15,

  15. Waveforms of test cases • Other cases( FFFF+0001, 7FFF+0001, 3FFF+0001, 1FFF+0001, 0FFF+0001, 07FF+0001, • 03FF+0001 • A_0-A_15 B_0-B_15 Cout,S_0-S_15

  16. Power consumption at the maxinum operating frequency, V=1.1V • Worst case Delay= 4.11E-10 S • Ptotal=4.50E-05W • Pmax=1.64E-03W

More Related