EE241 - Spring 2000 Advanced Digital Integrated Circuits. Carry-Skip Adder

Similar documents
EE241 - Spring 2005 Advanced Digital Integrated Circuits. Clock Generation. Lecture 22: Adders. Delay-Locked Loop (Delay Line Based) f REF Phase Det

VLSI Arithmetic Adders & Multipliers

Combinational Circuit Design

Homework 4 due today Quiz #4 today In class (80min) final exam on April 29 Project reports due on May 4. Project presentations May 5, 1-4pm

Lecture 4: Adders. Computer Systems Laboratory Stanford University

EE241 - Spring 2003 Advanced Digital Integrated Circuits

Logical Effort of Higher Valency Adders

Adders. Today: Adders. EE M216A.:. Fall Prof. Dejan Marković Lecture 9. Basic terminology. Adder building blocks

ECE 645: Lecture 2. Carry-Lookahead, Carry-Select, & Hybrid Adders

VLSI Design. [Adapted from Rabaey s Digital Integrated Circuits, 2002, J. Rabaey et al.] ECE 4121 VLSI DEsign.1

EE141-Fall 2010 Digital Integrated Circuits. Announcements. An Intel Microprocessor. Bit-Sliced Design. Class Material. Last lecture.

Digital Integrated Circuits A Design Perspective. Arithmetic Circuits. Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic.

EE141- Spring 2004 Digital Integrated Circuits

CMPEN 411 VLSI Digital Circuits Spring Lecture 19: Adder Design

Full Adder Ripple Carry Adder Carry-Look-Ahead Adder Manchester Adders Carry Select Adder

EECS 427 Lecture 8: Adders Readings: EECS 427 F09 Lecture 8 1. Reminders. HW3 project initial proposal: due Wednesday 10/7

Continued..& Multiplier

ISSN (PRINT): , (ONLINE): , VOLUME-4, ISSUE-10,

Part II Addition / Subtraction

Digital Integrated Circuits A Design Perspective. Arithmetic Circuits. Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic.

Part II Addition / Subtraction

VLSI Design Issues. ECE 410, Prof. F. Salem/Prof. A. Mason notes update

Estimating Delays. Gate Delay Model. Gate Delay. Effort Delay. Computing Logical Effort. Logical Effort

Coarse-Grain MTCMOS Sleep

Lecture 4. Adders. Computer Systems Laboratory Stanford University

CSE477 VLSI Digital Circuits Fall Lecture 20: Adder Design

Bit-Sliced Design. EECS 141 F01 Arithmetic Circuits. A Generic Digital Processor. Full-Adder. The Binary Adder

ECE 645: Lecture 3. Conditional-Sum Adders and Parallel Prefix Network Adders. FPGA Optimized Adders

Lecture 11: Adders. Slides courtesy of Deming Chen. Slides based on the initial set from David Harris. 4th Ed.

Week 11: Differential Amplifiers

Where are we? Data Path Design

A Novel Gate-Level NBTI Delay Degradation Model with Stacking Effect

Computer arithmetic. Intensive Computation. Annalisa Massini 2017/2018

A New Design of Multiplier using Modified Booth Algorithm and Reversible Gate Logic

Timing-Driven Placement. Outline

Where are we? Data Path Design. Bit Slice Design. Bit Slice Design. Bit Slice Plan

Effective Power Optimization combining Placement, Sizing, and Multi-Vt techniques

A High-Speed Realization of Chinese Remainder Theorem

Interconnect Optimization for Deep-Submicron and Giga-Hertz ICs

Computer Architecture 10. Fast Adders

Variability-Driven Module Selection with Joint Design Time Optimization and Post-Silicon Tuning

Hw 6 due Thursday, Nov 3, 5pm No lab this week

Dynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)

Transfer Characteristic

Lecture 7: Multistage Logic Networks. Best Number of Stages

Chapter 5 Arithmetic Circuits

The Decibel and its Usage

COMBINATIONAL CIRCUITS

Boise State University Department of Electrical and Computer Engineering ECE 212L Circuit Analysis and Design Lab

where I = (n x n) diagonal identity matrix with diagonal elements = 1 and off-diagonal elements = 0; and σ 2 e = variance of (Y X).

ELECTRONICS. EE 42/100 Lecture 4: Resistive Networks and Nodal Analysis. Rev B 1/25/2012 (9:49PM) Prof. Ali M. Niknejad

Bit-Parallel Word-Serial Multiplier in GF(2 233 ) and Its VLSI Implementation. Dr. M. Ahmadi

L8/9: Arithmetic Structures

Hydrological statistics. Hydrological statistics and extremes

A Low Error and High Performance Multiplexer-Based Truncated Multiplier

ELCT 503: Semiconductors. Fall 2014

Boise State University Department of Electrical and Computer Engineering ECE 212L Circuit Analysis and Design Lab

Digital Integrated Circuits A Design Perspective

Leakage and Dynamic Glitch Power Minimization Using Integer Linear Programming for V th Assignment and Path Balancing

[ ] λ λ λ. Multicollinearity. multicollinearity Ragnar Frisch (1934) perfect exact. collinearity. multicollinearity. exact

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Priority Queuing with Finite Buffer Size and Randomized Push-out Mechanism

Internet Engineering. Jacek Mazurkiewicz, PhD Softcomputing. Part 3: Recurrent Artificial Neural Networks Self-Organising Artificial Neural Networks

CS 350 Algorithms and Complexity

HIGH-SPEED MULTI OPERAND ADDITION UTILIZING FLAG BITS VIBHUTI DAVE DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING

1.4 Small-signal models of BJT

Pulse Coded Modulation

ELECTRONIC DEVICES. Assist. prof. Laura-Nicoleta IVANCIU, Ph.D. C13 MOSFET operation

ECONOMICS 351*-A Mid-Term Exam -- Fall Term 2000 Page 1 of 13 pages. QUEEN'S UNIVERSITY AT KINGSTON Department of Economics

FEEDBACK AMPLIFIERS. v i or v s v 0

Notes on proof-nets II

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

EE 457 HW 2 Arithmetic Designs Redekopp Puvvada Name: Due: See Website

Scroll Generation with Inductorless Chua s Circuit and Wien Bridge Oscillator

VLSI Design I; A. Milenkovic 1

EFFICIENT MULTIOUTPUT CARRY LOOK-AHEAD ADDERS

Number representation

EE 330 Lecture 24. Small Signal Analysis Small Signal Analysis of BJT Amplifier

Combinational Logic. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C.

CS 140 Lecture 14 Standard Combinational Modules

Using the Minimum Set of Input Combinations to Minimize the Area of Local Routing Networks in Logic Clusters. FPGAs. Andy Ye Ryerson University

SELECTED SOLUTIONS, SECTION (Weak duality) Prove that the primal and dual values p and d defined by equations (4.3.2) and (4.3.3) satisfy p d.

FE REVIEW OPERATIONAL AMPLIFIERS (OP-AMPS)( ) 8/25/2010

Lecture # 02: Pressure measurements and Measurement Uncertainties

Consider the following passband digital communication system model. c t. modulator. t r a n s m i t t e r. signal decoder.

Module #6: Combinational Logic Design with VHDL Part 2 (Arithmetic)

Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model

A Quadratic Cumulative Production Model for the Material Balance of Abnormally-Pressured Gas Reservoirs F.E. Gonzalez M.S.

ANALOG ELECTRONICS I. Transistor Amplifiers DR NORLAILI MOHD NOH

What Independencies does a Bayes Net Model? Bayesian Networks: Independencies and Inference. Quick proof that independence is symmetric

Lesson 16: Basic Control Modes

A Quadratic Cumulative Production Model for the Material Balance of Abnormally-Pressured Gas Reservoirs F.E. Gonzalez M.S.

Module 9. Lecture 6. Duality in Assignment Problems

The Dirac Equation for a One-electron atom. In this section we will derive the Dirac equation for a one-electron atom.

Logic effort and gate sizing

Area-Time Optimal Adder with Relative Placement Generator

3. MODELING OF PARALLEL THREE-PHASE CURRENT-UNIDIRECTIONAL CONVERTERS 3. MODELING OF PARALLEL THREE-PHASE CURRENT-

Logistic regression with one predictor. STK4900/ Lecture 7. Program

Common loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule:

Economics 130. Lecture 4 Simple Linear Regression Continued

Transcription:

EE4 - Srng 000 Advanced Dgtal Integrated Crcuts Lecture 6 Adders B. Nkolc Carry-Sk Adder 0 G 0 G G G C,0 C o,0 C o, C o, FA FA FA FA C o, 0 G 0 G G G B= o C,0 C o,0 C o, C o, FA FA FA FA Multlexer Co, Idea: If (0 and and and = ) then C o = C 0, else kll or generate. MacSorley, roc IRE /6 Lehman, Burla, IRE Trans on Com, /6 Byass B. Nkolc

Carry-Sk Adder Bt 0- Bt 4-7 Bt 8- Bt -5 Setu Setu Setu Setu C,0 Carry roagaton Carry roagaton Carry roagaton Carry roagaton Sum Sum Sum Sum Crtcal ath For N-bt adder wth k-bt grous N t d = k ( k ) t RCA t SKI ( k ) t RCA B. Nkolc t d Carry-Sk Adder Crtcal ath delay wth constant grous N = k ( k ) trca tski t rle adder byass adder 4..8 N B. Nkolc

Carry-Sk Adder Varable Grou Length t d = c cn c Oklobdza, Barnes, Arth 85 B. Nkolc Carry-Sk Adder Varable Block Lengths B. Nkolc

Manchester Carry Chan Imlement wth ass-transstors Imlement G wth ull-u, kll (delete) wth ull-down Use dynamc logc to reduce the comlexty and seed u V DD φ 0 4 C,0 G 0 G G G G 4 φ Klburn, et al, IEE roc, 959. B. Nkolc Szng Manchester Carry Chan Dscharge Transstor R R R R 4 R 5 4 5 6 R 6 Out M C C M 0 M M M M 4 C C C 4 C 5 C 6 Seed 5 0 5 0 N t = 0.69 C R = = 400 00 Area 00 00 5.5.0.5.0 k Seed (normalzed by 0.69RC) 0.5.0.5.0 k Area (n mnmum sze devces) B. Nkolc 4

Manchester Chan wth Carry-Sk 0 C,0 G 0 G G G B C o, B Delay model: B. Nkolc TL wth SA-F/F Imlementaton Matsu, JSSC /94 B. Nkolc 5

roagate and Generate Sgnals Defne new varable whch ONLY deend on A, B Generate (G) = AB roagate () = A B Delete = A B Can also derve exressons for S and C o based on D and B. Nkolc Carry Lookahead Adder A 0,B 0 A,B A N-,B N-... C,0 0 C, C,N- N-... Wenberger, Smth, 958. B. Nkolc 6

Lookahead Adder Looakahead Equatons oston : oston : c c = g c = g = g = g ( g c ) g c c Carry exsts f: - generated n stage - generated n stage and roagated through - roagated through both and B. Nkolc Lookahead Adder Unrollng of carry recurrence can be contnued If unrolled to level k, resultng n two-level AND-OR structure AND Fan-In = k, OR Fan-In = k k transstors n the MOS stack Lmts k to -4 B. Nkolc 7

8 B. Nkolc Lookahead Adder VDD 0 G G G G 0 C,0 Co, B. Nkolc Block Lookahead 4 = c g g g g c Fourth bt carry: g g g g G, =, =,, 4 = c G c Block generate and block roagate:

9 B. Nkolc Block Lookahead Can create grous of grous, or suer-grous : G G G G G * = * = Delay s N c t d log = B. Nkolc Block Lookahead From Oklobdza

Lookahead Examle Generate roagate Multle Outut Domno (MODL) B. Nkolc Lookahead Examle 4-bt grou generate 4-bt grou roagate B. Nkolc 0

64-b Lookahead Examle B. Nkolc Lookahead Examle B. Nkolc

Modfed CLA Nan, CICC 9 B. Nkolc Modfed CLA B. Nkolc

Condtonal Sum Adders s0 = x y s = x y c0 = x y c = x y Sklansky, Trans on Com 6/60 B. Nkolc Condtonal Sum Adders B. Nkolc

TG Condtonal Sum Condtonal Sum Adder Condtonal Cell -way MUXes Rothermel, JSSC 89 B. Nkolc TG Condtonal Sum Seral connecton of transmsson gates Chan length = log n Sgnal roagaton B. Nkolc 4

DL Condtonal Sum CLA Condtonal carry select B. Nkolc DL Condtonal Sum Block Condtonal Sums B. Nkolc 5

Carry-Select Adder Setu,G Carry roagaton "" "" Carry roagaton C o,k- Multlexer C o,k Sum Generaton Carry Vector B. Nkolc Carry Select Adder: Crtcal ath Bt 0- Bt 4-7 Bt 8- Bt -5 Setu Setu Setu Setu Carry Carry Carry Carry "" "" Carry "" "" Carry "" "" Carry "" "" Carry C,0 Multlexer C o, Multlexer C o,7 Multlexer C o, Multlexer C o,5 Sum Generaton Sum Generaton Sum Generaton Sum Generaton S 0- S 4-7 S 8- S -5 B. Nkolc 6

Lnear Carry Select Bt 0- Bt 4-7 Bt 8- Bt -5 Setu Setu Setu Setu () () Carry Carry Carry Carry "" Carry "" (5) (5) Multlexer C,0 "" Carry "" Carry "" Carry "" "" "" (5) (5) (5) (6) (7) (8) Multlexer Multlexer Multlexer (9) Sum Generaton Sum Generaton Sum Generaton Sum Generaton S 0- S 4-7 S 8- S -5 (0) B. Nkolc Square Root Carry Select Bt 0- Bt -4 Bt 5-8 Bt 9- Bt 4-9 Setu () Setu Setu Setu Carry () Carry Carry Carry "" "" Carry "" "" Carry "" "" Carry "" "" Carry () () (4) (5) (6) (4) (5) (6) (7) Multlexer Multlexer Multlexer Multlexer C,0 Sum Generaton Sum Generaton Sum Generaton Sum Generaton S 0- S-4 S5-8 S 9- (7) Mux (8) Sum S 4-9 (9) B. Nkolc 7

Logarthmc Lookahead Adders A 0 F A A A A 4 A 5 A 6 A 7 A 0 t N A A A A 4 A 5 A 6 A 7 F t log (N) B. Nkolc Tree Adders G G G = = g m m l m g l m more sgnfcant l less sgnfcant Start from the nut, G, and contnue u the tree -bt grous, then 4-bt grous, ( g, ) ( g, ) = ( g g ) ( g, ) =, m m l l m m l m l Kogge, Stone, Trans on Com, 7 B. Nkolc 8

Brent-Kung Adder (G 0, 0 ) (G, ) C o,0 Co, C o, C o,4 (G, ) C o, C o,5 (G, ) (G 4, 4 ) (G 5, 5 ) C o,6 (G 6, 6 ) (G 7, 7 ) C o,7 t add log (N) Brent, Kung, Trans on Com, /8 B. Nkolc Tree Adders B. Nkolc 9