VLSI Design I; A. Milenkovic 1
|
|
- Oliver Logan
- 5 years ago
- Views:
Transcription
1 The -bit inary dder CPE/EE 427, CPE 527 VLI Design I L2: dder Design Department of Electrical and Computer Engineering University of labama in Huntsville leksandar Milenkovic ( www. ece.uah.edu/~milenka ) www. ece.uah.edu/~milenka/cpe527-3f [dapted from Rabaey s Digital Integrated Circuits, 22, J. Rabaey et al. and Mary Jane Irwin ( www. cse. psu.edu/~mji ) ] -bit Full dder (F) How can we modify it easily to build an adder/subtractor? How can we make it better (faster, lower power, smaller)? carry status kill kill propagate propagate propagate propagate generate generate G = & P = = = P K =! &! = & & & (majority function) = G P& How can we use it to build a 64-bit adder? /7/23 VLI Design I;. Milenkovic 4 Course dministration Instructor: leksandar Milenkovic milenka@ece.uah.edu E 27-L Office Hrs: MW 7:3-8:3 T: Fathima Tareen Project pr.: For schedule Follow conventions for ppt file names Timing, content,... HW#3: Due 2//3 Project: Reports due 2/2/3 Design submission due /2/3 (arrange with instructor & lab instructor) /7/23 VLI Design I;. Milenkovic 2 F Gate Level Implementations The way you learned to design in EE2 and CPE422 t /7/23 VLI Design I;. Milenkovic 5 t t2 t2 t t Review: asic uilding locks Datapath Execution units dder, multiplier, divider, shifter, etc. Register file and pipeline registers Multiplexers, decoders Control Finite state machines (PL, ROM, random logic) Interconnect witches, arbiters, buses Memory Caches (RMs), TLs, DRMs, buffers /7/23 VLI Design I;. Milenkovic 3 Carry-Look -head dder CL () Idea: speed up carry computation C i+ = G i + P i* C i Propagate: P i = i + i if P i =, then carry from (i-)th stage is propagated Generate: G i = i * i if G i = there is carry out Pi = i + i Gi = i i i = i i Ci Ci+ = Gi Ci = Gi (Gi Ci ) = Gi Gi Ci = Gi Gi (Gi 2 2 Ci 2) = Gi Gi Gi 2 2 Ci 2 /7/23 VLI Design I;. Milenkovic 6 VLI Design I;. Milenkovic
2 Carry-Look -head dder CL (2) Review: XOR F C = G + P C C2 = G + P G + P P C 3 3 C3 = G2 G P G P P C C4 = G3 G2 G+ P3 P G + P3 P P C 2 P 2 C C P2 G P P3 G3 P2 G2 P C3 C2 C 3 2 P G C P2 P G P2 C3 P G C G G2 PG Generator Carry Generate lock um Generator 6 transistors /7/23 VLI Design I;. Milenkovic 7 /7/23 VLI Design I;. Milenkovic Carry-Look -head dder CL (4) Review: CPL F C = G + P C C2 = G + P G + P P C C3 = G 2 G P G P P C C4 = G 3 G2 G P2 P G P P C C4 = G3 G2 G P G P P C!!!! C4 = G 3+ P 3 C C8 = G7 4 + P7 4 C4 = G7 4 + P7 4 (G3 C) = G7 4 + P7 4 G3 + P7 4 P3 C C2 = G 8 + P 8 C8 = G 8 + P 8 (G7 4 + P7 4 G3 + P7 4 P3 C ) = G 8 + P 8 G7 4 + P 8 P7 4 G3 + P 8 P7 4 P3 C C6 = G5 2 + P5 2 C2 = G5 2 + P5 2 ( G 8 + P 8 G7 4 + P 8 P7 4 G3 + P 8 P7 4 P3 C) = G5 2 + P5 2 G 8 + P5 2 P 8 G7 4 + P5 2 P 8 P7 4 G3 + P5 2 P 8 P7 4 P3 C /7/23 VLI Design I;. Milenkovic 8!!!!!! 2+8 transistors, dual rail beware of threshold drops /7/23 VLI Design I;. Milenkovic Carry-Look -head dder CL (5) Delay alanced F : 3:!!P Identical Delays for Carry and um p P P! P :!!P G 5-2P 5-2 G 5- P 5- C 2 G -8 P -8 C 8 G 7-4 P 7-4 C 4 G 3- P 3- CG C C P!P!P eration ignal set-up 2+2 transistors Carry generation /7/23 VLI Design I;. Milenkovic 9 /7/23 VLI Design I;. Milenkovic 2 VLI Design I;. Milenkovic 2
3 Review: Mirror dder 24+4 transistors propagate kill ! 6! -propagate 4 4 generate = & & & UM = && C OUT &( ) izing: Each input in the carry circuit has a logical effort of 2 so the optimal fan-out for each is also 2. ince! drives 2 internal and 2 inverter transistor gates (to form for the nms bit adder) should oversize the carry circuit. PMO/NMO ratio of 2. /7/23 VLI Design I;. Milenkovic 3 Ripple Carry dder (RC) =C 4 F F F F C = 3 2 T adder T F (, ) +(N-2)T F ( ) + T F ( ) T = O(N) worst case delay Real Goal: Make the fastest possible carry path /7/23 VLI Design I;. Milenkovic 6 Mirror dder Features The NMO and PMO chains are completely symmetrical with a maximum of two series transistors in the carry circuitry,guaranteeing identical rise and fall transitions if the NMO and PMO devices are properly sized. When laying out the cell, the most critical issue is the minimization of the capacitances at node! (four diffusion capacitances, two internal gate capacitances, and two inverter gate capacitances). hared diffusions can reduce the stack node capacitances. The transistors connected to are placed closest to the output. Only the transistors in the carry stage have to be optimized for optimal speed. ll transistors in the sum stage can be minimal size. /7/23 VLI Design I;. Milenkovic 4 Inversion Property Inverting all inputs to a F results in inverted values for all outputs F F! (,, ) = (!,!,! )! (,, ) = (!,!,! ) /7/23 VLI Design I;. Milenkovic 7 64-bit dder/ubtractor Exploiting the Inversion Property Ripple Carry dder (RC) built out of 64 Fs ubtraction complement all subtrahend bits (xor gates) and set the low order carry-in RC advantage: simple logic, so small (low cost) disadvantage: slow (O(N) for N bits) and lots of glitching (so lots of energy consumption) add/subt C = -bit F C -bit F C 2 -bit F 2 C 3 -bit F 63 C 64 = /7/23 VLI Design I;. Milenkovic C 63 =C F F 2 F F inverted cell regular cell C = Minimizes the critical path (the carry chain) by eliminating inverters between the Fs (will need to increase the transistor sizing on the carry chain portion of the mirror adder). Now need two flavors of Fs /7/23 VLI Design I;. Milenkovic 8 VLI Design I;. Milenkovic 3
4 Fast Carry Chain Design 4-bit liced MCC dder The key to fast addition is a low latency carry network What matters is whether in a given position a carry is generated G i = i & i = i i propagated P i = i i (sometimes use i i ) annihilated (killed) K i =! i &! i 3 3 & G P 2 2 & G P & G P & G P clk Giving a carry recurrence of C i+ = G i P i C i!c 4!C C = C 2 = C 3 = C 4 = 3!C 3 2!C 2!C /7/23 VLI Design I;. Milenkovic 9 /7/23 VLI Design I;. Milenkovic 22 Fast Carry Chain Design The key to fast addition is a low latency carry network What matters is whether in a given position a carry is generated G i = i & i = i i propagated P i = i i (sometimes use i i ) annihilated (killed) K i =! i &! i Giving a carry recurrence of C i+ = G i P i C i C = G P C C 2 = G P G P P C C 3 = G 2 P 2 G P 2 P G P 2 P P C C 4 = G 3 P 3 G 2 P 3 P 2 G P 3 P 2 P G P 3 P 2 P P C /7/23 VLI Design I;. Milenkovic 2 Domino Manchester Carry Chain Circuit P 3 C i, G 3 2 P 2 G clk!(g P C i, )!(G 2 P 2 G P 2 P G P 2 P P C i, )!(G P G P P C i, )!(G 3 P 3 G 2 P 3 P 2 G P 3 P 2 P G P 3 P 2 P P C i, ) /7/23 VLI Design I;. Milenkovic 23 3 P G 4 P G 5 clk C i, Manchester Carry Chain witches controlled by G i and P i inary dder Landscape synchronous word parallel adders!c i+ clk G i Pi!C i Total delay of time to form the switch control signals G i and P i setup time for the switches signal propagation delay through N switches in the worst case /7/23 VLI Design I;. Milenkovic 2 ripple carry adders (RC) T = O(N), = O(N) carry prop min adders signed-digit fast carry prop residue adders adders adders T = O(), = O(N) Manchester carry parallel conditional carry carry chain select prefix sum skip T = O(N) = O(N) T = O(log N) = O(N log N) T = O( N), = O(N) /7/23 VLI Design I;. Milenkovic 24 VLI Design I;. Milenkovic 4
5 C o,3 Carry-kip (Carry-ypass) dder C o,3 3 3 F 3 P = P P P 2 P F 2 F lock Propagate F If (P & P & P 2 & P 3 = ) then C o,3 = C i, otherwise the block itself kills or generates the carry internally C i, Optimal lock ize and Time ssuming one stage of ripple (t carry ) has the same delay as one skip logic stage (t skip ) and both are T Ck = + + (N/-) + + t setup ripple in skips ripple in t sum block last block = 2 + N/ + o the optimal block size,, is dt Ck /d = (N/2) = opt nd the optimal time is Optimal T Ck = 2( (2N)) + /7/23 VLI Design I;. Milenkovic 25 /7/23 VLI Design I;. Milenkovic 28 Carry-kip Chain Implementation Carry-kip dder Extensions carry-out block carry-out P block carry-in Variable block sizes carry that is generated in, or absorbed by, one of the inner blocks travels a shorter distance through the skip blocks, so can have bigger blocks for the inner carries without increasing the overall delay P 3 P 2 P P Multiple levels of skip logic! P G 3 G 2 G G /7/23 VLI Design I;. Milenkovic 26 skip level skip level 2 ND of the first level skip signals (P s) /7/23 VLI Design I;. Milenkovic 29 4-bit lock Carry-kip dder Carry-kip dder Comparisons bits 2 to 5 bits 8 to bits 4 to 7 bits to Carry Propagation Carry Propagation Carry Propagation Carry Propagation 5 um um um um Worst-case delay carry from bit to bit 5 = carry generated in bit, ripples through bits, 2, and 3, skips the middle two groups ( is the group size in bits), ripples in the last group from bit 2 to bit 5 C i, =2 =3 =4 =5 =6 RC Ck Vk T add = t setup + t carry + ((N/) -) t skip + t carry + t sum 8 bits 6 bits 32 bits 48 bits 64 bits /7/23 VLI Design I;. Milenkovic 27 /7/23 VLI Design I;. Milenkovic 3 VLI Design I;. Milenkovic 5
6 Carry elect dder s s s bits 4 to s 9 quare Root Carry elect dder bits 9 to 3 bits 5 to 8 bits 2 to 4 bits to s s s s s s s s Precompute the carry out of each block for both carry_in = and carry_in = (can be done for all blocks in parallel) and then select the correct one 4-b carry propagation carry propagation multiplexer eration carry carry C out carry carry carry carry P sg s carry carry P sg s carry carry Cin /7/23 VLI Design I;. Milenkovic 3 /7/23 VLI Design I;. Milenkovic 34 Carry elect dder: Critical Path bits 2 to 5 bits 8 to bits 4 to 7 bits to 3 s s s s s s s s s bits 4 to s 9 quare Root Carry elect dder bits 9 to 3 bits 5 to 8 bits 2 to 4 bits to s s s s s s s s carry carry carry carry carry carry carry carry carry +6 carry carry +5 carry carry +4 carry P sg s carry +3 carry P sg s carry +2 carry C + out um + gen Cin /7/23 VLI Design I;. Milenkovic 32 T add = t setup + 2 t carry + vn t + t sum /7/23 VLI Design I;. Milenkovic 35 Carry elect dder: Critical Path bits 2 to 5 s s bits 8 to s s bits 4 to 7 s s bits to 3 s s carry carry carry carry +4 carry carry carry carry um +gen T add = t setup + t carry + N/ t + t sum /7/23 VLI Design I;. Milenkovic 33 Parallel Prefix dders (PPs) Define carry operator on (G,P) signal pairs (G,P ) (G,P ) (G,P) where G = G P G P = P P is associative, i.e., [(g,p ) (g,p )] (g,p ) = (g,p ) [(g,p ) (g,p )] G!G /7/23 VLI Design I;. Milenkovic 36 P G VLI Design I;. Milenkovic 6
7 Parallel Prefix Computation T = log 2 N - 2 = 2log 2 N T = log 2 N Parallel Prefix Computation T = log 2 N - 2 = 2log 2 N T = log 2 N Parallel Prefix Computation T = log 2 N = log 2 N PP General tructure Kogge-tone PPF dder Given P and G terms for each bit position, computing all the carries is equal to finding all the prefixes in parallel (G,P ) (G,P ) (G 2,P 2 ) (G N- 2,P N-2 ) (G N-,P N- ) ince is associative, we can group them in any order but note that it is not commutative P i, G i logic ( unit delay) C i parallel prefix logic tree ( unit delay per level) i logic ( unit delay) Measures to consider number of cells tree cell depth (time) tree cell area cell fan-in and fan-out max wiring length wiring congestion delay path variation (glitching) /7/23 VLI Design I;. Milenkovic 37 G 5 G 4 G 3 G 2 P 5 P 4 P 3 P 2 G G G 9 P P P 9 G 8 P 8 G 7 P 7 /7/23 VLI Design I;. Milenkovic 4 G 6 P 6 G 5 P 5 G 4 P 4 G 3 P 3 C 6 C 5 C 4 C 3 C 2 C C C 9 C 8 = N C 7 C 6 C 5 T add = t setup + log 2 N t + t sum C 4 G 2 G P 2 P C 3 C 2 G P C rent-kung PP More dder Comparisons G 5 G 4 G 3 G 2 p 5 p 4 p 3 P 2 G G G 9 p P p 9 G 8 P 8 G 7 P 7 G 6 G 5 P 6 P 5 G 4 G 3 P 4 P 3 G 2 p 2 G P G P RC Ck Vk K PP C 6 C 5 C 4 C 3 C 2 C C C 9 C 8 = N/2 C 7 C 6 C 5 C 4 C 3 C 2 C 8 bits 6 bits 32 bits 48 bits 64 bits /7/23 VLI Design I;. Milenkovic 38 /7/23 VLI Design I;. Milenkovic 4 rent-kung PP dder peed Comparisons G 5 G 4 G 3 G 2 p 5 p 4 p 3 P 2 G G G 9 p P p 9 G 8 P 8 G 7 P 7 G 6 G 5 P 6 P 5 G 4 G 3 P 4 P 3 G 2 p 2 G P G P RC MCC CCk VCk CCl &K 2 C 6 C 5 C 4 C 3 C 2 C C C 9 C 8 C 7 C 6 C 5 C 4 C 3 = N/2 C 2 C 6 bits 32 bits 64 bits /7/23 VLI Design I;. Milenkovic 39 /7/23 VLI Design I;. Milenkovic 42 VLI Design I;. Milenkovic 7
8 35 dder verage Power Comparisons RC MCC CCk VCk CCl &K 5 6 bits 32 bits 64 bits /7/23 VLI Design I;. Milenkovic 43 PDP of dder Comparisons RC MCC CCk VCk CCl K 8 bits 6 bits 32 bits 48 bits 64 bits From Nagendra, 996 /7/23 VLI Design I;. Milenkovic 44 VLI Design I;. Milenkovic 8
CSE477 VLSI Digital Circuits Fall Lecture 20: Adder Design
CSE477 VLSI Digital Circuits Fall 22 Lecture 2: Adder Design Mary Jane Irwin ( www.cse.psu.edu/~mji ) www.cse.psu.edu/~cg477 [Adapted from Rabaey s Digital Integrated Circuits, 22, J. Rabaey et al.] CSE477
More informationVLSI Design. [Adapted from Rabaey s Digital Integrated Circuits, 2002, J. Rabaey et al.] ECE 4121 VLSI DEsign.1
VLSI Design Adder Design [Adapted from Rabaey s Digital Integrated Circuits, 2002, J. Rabaey et al.] ECE 4121 VLSI DEsign.1 Major Components of a Computer Processor Devices Control Memory Input Datapath
More informationCMPEN 411 VLSI Digital Circuits Spring Lecture 19: Adder Design
CMPEN 411 VLSI Digital Circuits Spring 2011 Lecture 19: Adder Design [Adapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey, A. Chandrakasan, B. Nikolic] Sp11 CMPEN 411 L19
More informationBit-Sliced Design. EECS 141 F01 Arithmetic Circuits. A Generic Digital Processor. Full-Adder. The Binary Adder
it-liced Design Control EEC 141 F01 rithmetic Circuits Data-In Register dder hifter it 3 it 2 it 1 it 0 Data-Out Tile identical processing elements Generic Digital Processor Full-dder MEMORY Cin Full adder
More informationArithmetic Building Blocks
rithmetic uilding locks Datapath elements dder design Static adder Dynamic adder Multiplier design rray multipliers Shifters, Parity circuits ECE 261 Krish Chakrabarty 1 Generic Digital Processor Input-Output
More informationDigital Integrated Circuits A Design Perspective
rithmetic ircuitsss dapted from hapter 11 of Digital Integrated ircuits Design Perspective Jan M. Rabaey et al. opyright 2003 Prentice Hall/Pearson 1 Generic Digital Processor MEMORY INPUT-OUTPUT ONTROL
More informationDigital Integrated Circuits A Design Perspective. Arithmetic Circuits
Digital Integrated Circuits Design Perspective rithmetic Circuits Reference: Digital Integrated Circuits, 2nd edition, Jan M. Rabaey, nantha Chandrakasan and orivoje Nikolic Disclaimer: slides adapted
More informationEECS 427 Lecture 8: Adders Readings: EECS 427 F09 Lecture 8 1. Reminders. HW3 project initial proposal: due Wednesday 10/7
EECS 427 Lecture 8: dders Readings: 11.1-11.3.3 3 EECS 427 F09 Lecture 8 1 Reminders HW3 project initial proposal: due Wednesday 10/7 You can schedule a half-hour hour appointment with me to discuss your
More informationEE141-Fall 2010 Digital Integrated Circuits. Announcements. An Intel Microprocessor. Bit-Sliced Design. Class Material. Last lecture.
EE4-Fall 2 Digital Integrated ircuits dders Lecture 2 dders 4 4 nnouncements Midterm 2: Thurs. Nov. 4 th, 6:3-8:pm Exam starts at 6:3pm sharp Review session: Wed., Nov. 3 rd, 6pm n Intel Microprocessor
More informationDigital Integrated Circuits A Design Perspective. Arithmetic Circuits. Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic.
Digital Integrated Circuits A Design Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic Arithmetic Circuits January, 2003 1 A Generic Digital Processor MEM ORY INPUT-OUTPUT CONTROL DATAPATH
More informationHw 6 due Thursday, Nov 3, 5pm No lab this week
EE141 Fall 2005 Lecture 18 dders nnouncements Hw 6 due Thursday, Nov 3, 5pm No lab this week Midterm 2 Review: Tue Nov 8, North Gate Hall, Room 105, 6:30-8:30pm Exam: Thu Nov 10, Morgan, Room 101, 6:30-8:00pm
More informationDigital Integrated Circuits A Design Perspective. Arithmetic Circuits. Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic.
Digital Integrated Circuits A Design Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic Arithmetic Circuits January, 2003 1 A Generic Digital Processor MEMORY INPUT-OUTPUT CONTROL DATAPATH
More informationVLSI Design I; A. Milenkovic 1
ourse dministration PE/EE 47, PE 57 VLI esign I L6: tatic MO Logic epartment of Electrical and omputer Engineering University of labama in Huntsville leksandar Milenkovic ( www. ece.uah.edu/~milenka )
More informationVLSI Design I; A. Milenkovic 1
PE/EE 47, PE 57 VLI esign I L6: tatic MO Logic epartment of Electrical and omputer Engineering University of labama in Huntsville leksandar Milenkovic ( www. ece.uah.edu/~milenka ) www. ece.uah.edu/~milenka/cpe57-3f
More informationCPE/EE 427, CPE 527 VLSI Design I L06: CMOS Inverter, CMOS Logic Gates. Course Administration. CMOS Inverter: A First Look
CPE/EE 47, CPE 57 VLSI esign I L6: CMOS Inverter, CMOS Logic Gates epartment of Electrical and Computer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka )
More informationFull Adder Ripple Carry Adder Carry-Look-Ahead Adder Manchester Adders Carry Select Adder
Outline E 66 U Resources: dders & Multipliers Full dder Ripple arry dder arry-look-head dder Manchester dders arry Select dder arry Skip dder onditional Sum dder Hybrid Designs leksandar Milenkovic E-mail:
More informationWhere are we? Data Path Design
Where are we? Subsystem Design Registers and Register Files dders and LUs Simple ripple carry addition Transistor schematics Faster addition Logic generation How it fits into the datapath Data Path Design
More informationCMOS Inverter: CPE/EE 427, CPE 527 VLSI Design I L06: CMOS Inverter, CMOS Logic Gates. Course Administration. CMOS Properties.
CMOS Inverter: Steady State Response CPE/EE 47, CPE 57 VLSI esign I L6: CMOS Inverter, CMOS Logic Gates R p V OL = V OH = V M = f(r n, R p ) epartment of Electrical and Computer Engineering University
More informationWhere are we? Data Path Design. Bit Slice Design. Bit Slice Design. Bit Slice Plan
Where are we? Data Path Design Subsystem Design Registers and Register Files dders and LUs Simple ripple carry addition Transistor schematics Faster addition Logic generation How it fits into the datapath
More informationHomework 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
EE241 - Spring 2010 Advanced Digital Integrated Circuits Lecture 25: Digital Arithmetic Adders Announcements Homework 4 due today Quiz #4 today In class (80min) final exam on April 29 Project reports due
More informationCPE/EE 427, CPE 527 VLSI Design I L18: Circuit Families. Outline
CPE/EE 47, CPE 57 VLI Design I L8: Circuit Families Department of Electrical and Computer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka ) www.ece.uah.edu/~milenka/cpe57-05f
More informationVLSI Design I; A. Milenkovic 1
Review Voltage wing of PT Driving an Inverter PE/EE 47, PE 57 VLI Design I L9: MO & Wire apacitances Department of Electrical and omputer Engineering University of labama in Huntsville leksandar Milenkovic
More informationCSE140: Components and Design Techniques for Digital Systems. Logic minimization algorithm summary. Instructor: Mohsen Imani UC San Diego
CSE4: Components and Design Techniques for Digital Systems Logic minimization algorithm summary Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing & Dr.Pietro Mercati Definition
More informationCPE/EE 427, CPE 527 VLSI Design I Pass Transistor Logic. Review: CMOS Circuit Styles
PE/EE 427, PE 527 VLI Design I Pass Transistor Logic Department of Electrical and omputer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka ) Review: MO ircuit
More informationCMOS Digital Integrated Circuits Lec 10 Combinational CMOS Logic Circuits
Lec 10 Combinational CMOS Logic Circuits 1 Combinational vs. Sequential Logic In Combinational Logic circuit Out In Combinational Logic circuit Out State Combinational The output is determined only by
More informationCPE/EE 427, CPE 527 VLSI Design I Delay Estimation. Department of Electrical and Computer Engineering University of Alabama in Huntsville
CPE/EE 47, CPE 57 VLSI Design I Delay Estimation Department of Electrical and Computer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka ) Review: CMOS Circuit
More informationLecture 11: Adders. Slides courtesy of Deming Chen. Slides based on the initial set from David Harris. 4th Ed.
Lecture : dders Slides courtesy of Deming hen Slides based on the initial set from David Harris MOS VLSI Design Outline Single-bit ddition arry-ripple dder arry-skip dder arry-lookahead dder arry-select
More informationEE141- Spring 2004 Digital Integrated Circuits
EE141- pring 2004 Digital Integrated ircuits Lecture 19 Dynamic Logic - Adders (that is wrap-up) 1 Administrative tuff Hw 6 due on Th No lab this week Midterm 2 next week Project 2 to be launched week
More informationLecture 4. Adders. Computer Systems Laboratory Stanford University
Lecture 4 Adders Computer Systems Laboratory Stanford University horowitz@stanford.edu Copyright 2006 Mark Horowitz Some figures from High-Performance Microprocessor Design IEEE 1 Overview Readings Today
More informationVLSI Design I; A. Milenkovic 1
ourse dministration PE/EE 47, PE 57 VLI esign I L6: omplementary MO Logic Gates epartment of Electrical and omputer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka
More informationCPE/EE 427, CPE 527 VLSI Design I L07: CMOS Logic Gates, Pass Transistor Logic. Review: CMOS Circuit Styles
PE/EE 427, PE 527 VLI esign I L07: MO Logic Gates, Pass Transistor Logic epartment of Electrical and omputer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka
More informationECE 2300 Digital Logic & Computer Organization
ECE 2300 Digital Logic & Computer Organization pring 201 More inary rithmetic LU 1 nnouncements Lab 4 prelab () due tomorrow Lab 5 to be released tonight 2 Example: Fixed ize 2 C ddition White stone =
More informationCSE140: Components and Design Techniques for Digital Systems. Decoders, adders, comparators, multipliers and other ALU elements. Tajana Simunic Rosing
CSE4: Components and Design Techniques for Digital Systems Decoders, adders, comparators, multipliers and other ALU elements Tajana Simunic Rosing Mux, Demux Encoder, Decoder 2 Transmission Gate: Mux/Tristate
More informationCMPEN 411 VLSI Digital Circuits Spring Lecture 21: Shifters, Decoders, Muxes
CMPEN 411 VLSI Digital Circuits Spring 2011 Lecture 21: Shifters, Decoders, Muxes [Adapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey, A. Chandrakasan, B. Nikolic] Sp11 CMPEN
More informationArithmetic Circuits Didn t I learn how to do addition in the second grade? UNC courses aren t what they used to be...
rithmetic Circuits Didn t I learn how to do addition in the second grade? UNC courses aren t what they used to be... + Finally; time to build some serious functional blocks We ll need a lot of boxes The
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Adders 2 Circuit Delay Transistors have instrinsic resistance and capacitance
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences Analysis and Design of Digital Integrated Circuits (6.374) - Fall 2003 Quiz #2 Prof. Anantha Chandrakasan
More informationChapter 5. Digital Design and Computer Architecture, 2 nd Edition. David Money Harris and Sarah L. Harris. Chapter 5 <1>
Chapter 5 Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris Chapter 5 Chapter 5 :: Topics Introduction Arithmetic Circuits umber Systems Sequential Building
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing
More informationLecture 7: Logic design. Combinational logic circuits
/24/28 Lecture 7: Logic design Binary digital circuits: Two voltage levels: and (ground and supply voltage) Built from transistors used as on/off switches Analog circuits not very suitable for generic
More informationCMPEN 411 VLSI Digital Circuits Spring 2011 Lecture 07: Pass Transistor Logic
CMPEN 411 VLSI Digital Circuits Spring 2011 Lecture 07: Pass Transistor Logic [dapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey,. Chandrakasan,. Nikolic] Sp11 CMPEN 411
More informationISSN (PRINT): , (ONLINE): , VOLUME-4, ISSUE-10,
A NOVEL DOMINO LOGIC DESIGN FOR EMBEDDED APPLICATION Dr.K.Sujatha Associate Professor, Department of Computer science and Engineering, Sri Krishna College of Engineering and Technology, Coimbatore, Tamilnadu,
More informationHardware Design I Chap. 4 Representative combinational logic
Hardware Design I Chap. 4 Representative combinational logic E-mail: shimada@is.naist.jp Already optimized circuits There are many optimized circuits which are well used You can reduce your design workload
More informationOverview. Arithmetic circuits. Binary half adder. Binary full adder. Last lecture PLDs ROMs Tristates Design examples
Overview rithmetic circuits Last lecture PLDs ROMs Tristates Design examples Today dders Ripple-carry Carry-lookahead Carry-select The conclusion of combinational logic!!! General-purpose building blocks
More informationReview. EECS Components and Design Techniques for Digital Systems. Lec 18 Arithmetic II (Multiplication) Computer Number Systems
Review EE 5 - omponents and Design Techniques for Digital ystems Lec 8 rithmetic II (Multiplication) David uller Electrical Engineering and omputer ciences University of alifornia, Berkeley http://www.eecs.berkeley.edu/~culler
More informationEFFICIENT MULTIOUTPUT CARRY LOOK-AHEAD ADDERS
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 EFFICIENT MULTIOUTPUT CARRY LOOK-AHEAD ADDERS B. Venkata Sreecharan 1, C. Venkata Sudhakar 2 1 M.TECH (VLSI DESIGN)
More informationEE141. Administrative Stuff
-Spring 2004 Digital Integrated ircuits Lecture 15 Logical Effort Pass Transistor Logic 1 dministrative Stuff First (short) project to be launched next Th. Overall span: 1 week Hardware lab this week Hw
More informationEECS 141 F01 Lecture 17
EECS 4 F0 Lecture 7 With major inputs/improvements From Mary-Jane Irwin (Penn State) Dynamic CMOS In static circuits at every point in time (except when switching) the output is connected to either GND
More informationC.K. Ken Yang UCLA Courtesy of MAH EE 215B
Decoders: Logical Effort Applied C.K. Ken Yang UCLA yang@ee.ucla.edu Courtesy of MAH 1 Overview Reading Rabaey 6.2.2 (Ratio-ed logic) W&H 6.2.2 Overview We have now gone through the basics of decoders,
More informationChapter 5 CMOS Logic Gate Design
Chapter 5 CMOS Logic Gate Design Section 5. -To achieve correct operation of integrated logic gates, we need to satisfy 1. Functional specification. Temporal (timing) constraint. (1) In CMOS, incorrect
More informationDigital Integrated Circuits A Design Perspective
Digital Integrated Circuits Design Perspective Jan M. Rabaey nantha Chandrakasan orivoje Nikolić Designing Combinational Logic Circuits November 2002. 1 Combinational vs. Sequential Logic In Combinational
More informationCOMP 103. Lecture 16. Dynamic Logic
COMP 03 Lecture 6 Dynamic Logic Reading: 6.3, 6.4 [ll lecture notes are adapted from Mary Jane Irwin, Penn State, which were adapted from Rabaey s Digital Integrated Circuits, 2002, J. Rabaey et al.] COMP03
More informationLecture 6: Circuit design part 1
Lecture 6: Circuit design part 6. Combinational circuit design 6. Sequential circuit design 6.3 Circuit simulation 6.4. Hardware description language Combinational Circuit Design. Combinational circuit
More informationUniversity of Toronto. Final Exam
University of Toronto Final Exam Date - Apr 18, 011 Duration:.5 hrs ECE334 Digital Electronics Lecturer - D. Johns ANSWER QUESTIONS ON THESE SHEETS USING BACKS IF NECESSARY 1. Equation sheet is on last
More informationVLSI Design I; A. Milenkovic 1
Why Power Matters PE/EE 47, PE 57 VLSI Design I L5: Power and Designing for Low Power Department of Electrical and omputer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka
More informationName: Answers. Mean: 83, Standard Deviation: 12 Q1 Q2 Q3 Q4 Q5 Q6 Total. ESE370 Fall 2015
University of Pennsylvania Department of Electrical and System Engineering Circuit-Level Modeling, Design, and Optimization for Digital Systems ESE370, Fall 2015 Final Tuesday, December 15 Problem weightings
More informationComputer Architecture 10. Fast Adders
Computer Architecture 10 Fast s Ma d e wi t h Op e n Of f i c e. o r g 1 Carry Problem Addition is primary mechanism in implementing arithmetic operations Slow addition directly affects the total performance
More informationDigital Integrated Circuits A Design Perspective
Designing ombinational Logic ircuits dapted from hapter 6 of Digital Integrated ircuits Design Perspective Jan M. Rabaey et al. opyright 2003 Prentice Hall/Pearson 1 ombinational vs. Sequential Logic In
More informationCPE/EE 427, CPE 527 VLSI Design I L13: Wires, Design for Speed. Course Administration
CPE/EE 427, CPE 527 VLSI Design I L3: Wires, Design for Speed Department of Electrical and Computer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka ) www.ece.uah.edu/~milenka/cpe527-05f
More informationPass-Transistor Logic
-all 26 Digital tegrated ircuits nnouncements No new homework this week roject phase one due on Monday Midterm 2 next Thursday Review session on Tuesday Lecture 8 Logic Dynamic Logic EE4 EE4 2 lass Material
More informationCMPEN 411 VLSI Digital Circuits Spring Lecture 14: Designing for Low Power
CMPEN 411 VLSI Digital Circuits Spring 2012 Lecture 14: Designing for Low Power [Adapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey, A. Chandrakasan, B. Nikolic] Sp12 CMPEN
More informationFloating Point Representation and Digital Logic. Lecture 11 CS301
Floating Point Representation and Digital Logic Lecture 11 CS301 Administrative Daily Review of today s lecture w Due tomorrow (10/4) at 8am Lab #3 due Friday (9/7) 1:29pm HW #5 assigned w Due Monday 10/8
More informationVLSI Design I; A. Milenkovic 1
Review: implified CMO Inverter Process CPE/EE 7, CPE 7 VLI esign I L: MO Transistor cut line epartment of Electrical and Computer Engineering University of Alabama in Huntsville Aleksandar Milenkovic (
More informationUNSIGNED BINARY NUMBERS DIGITAL ELECTRONICS SYSTEM DESIGN WHAT ABOUT NEGATIVE NUMBERS? BINARY ADDITION 11/9/2018
DIGITAL ELECTRONICS SYSTEM DESIGN LL 2018 PROFS. IRIS BAHAR & ROD BERESFORD NOVEMBER 9, 2018 LECTURE 19: BINARY ADDITION, UNSIGNED BINARY NUMBERS For the binary number b n-1 b n-2 b 1 b 0. b -1 b -2 b
More informationArea-Time Optimal Adder with Relative Placement Generator
Area-Time Optimal Adder with Relative Placement Generator Abstract: This paper presents the design of a generator, for the production of area-time-optimal adders. A unique feature of this generator is
More informationCprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Simple Processor CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Digital
More informationEEC 118 Lecture #6: CMOS Logic. Rajeevan Amirtharajah University of California, Davis Jeff Parkhurst Intel Corporation
EEC 118 Lecture #6: CMOS Logic Rajeevan mirtharajah University of California, Davis Jeff Parkhurst Intel Corporation nnouncements Quiz 1 today! Lab 2 reports due this week Lab 3 this week HW 3 due this
More informationModule 2. Basic Digital Building Blocks. Binary Arithmetic & Arithmetic Circuits Comparators, Decoders, Encoders, Multiplexors Flip-Flops
Module 2 asic Digital uilding locks Lecturer: Dr. Yongsheng Gao Office: Tech 3.25 Email: Web: Structure: Textbook: yongsheng.gao@griffith.edu.au maxwell.me.gu.edu.au 6 lecturers 1 tutorial 1 laboratory
More informationWhere Does Power Go in CMOS?
Power Dissipation Where Does Power Go in CMOS? Dynamic Power Consumption Charging and Discharging Capacitors Short Circuit Currents Short Circuit Path between Supply Rails during Switching Leakage Leaking
More informationLecture 8: Combinational Circuit Design
Lecture 8: Combinational Circuit Design Mark McDermott Electrical and Computer Engineering The University of Texas at ustin 9/5/8 Verilog to Gates module mux(input s, d0, d, output y); assign y = s? d
More informationCMSC 313 Lecture 16 Announcement: no office hours today. Good-bye Assembly Language Programming Overview of second half on Digital Logic DigSim Demo
CMSC 33 Lecture 6 nnouncement: no office hours today. Good-bye ssembly Language Programming Overview of second half on Digital Logic DigSim Demo UMC, CMSC33, Richard Chang Good-bye ssembly
More informationPart II Addition / Subtraction
Part II Addition / Subtraction Parts Chapters I. Number Representation 1. 2. 3. 4. Numbers and Arithmetic Representing Signed Numbers Redundant Number Systems Residue Number Systems Elementary Operations
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences
MSSCHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences nalysis and Design of Digital Integrated Circuits (6.374) - Fall 2003 Quiz #1 Prof. nantha Chandrakasan Student
More informationLooking at a two binary digit sum shows what we need to extend addition to multiple binary digits.
A Full Adder The half-adder is extremely useful until you want to add more that one binary digit quantities. The slow way to develop a two binary digit adders would be to make a truth table and reduce
More informationLecture 9: Clocking, Clock Skew, Clock Jitter, Clock Distribution and some FM
Lecture 9: Clocking, Clock Skew, Clock Jitter, Clock Distribution and some FM Mark McDermott Electrical and Computer Engineering The University of Texas at Austin 9/27/18 VLSI-1 Class Notes Why Clocking?
More information9/18/2008 GMU, ECE 680 Physical VLSI Design
ECE680: Physical VLSI Design Chapter III CMOS Device, Inverter, Combinational circuit Logic and Layout Part 3 Combinational Logic Gates (textbook chapter 6) 9/18/2008 GMU, ECE 680 Physical VLSI Design
More informationPart II Addition / Subtraction
Part II Addition / Subtraction Parts Chapters I. Number Representation 1. 2. 3. 4. Numbers and Arithmetic Representing Signed Numbers Redundant Number Systems Residue Number Systems Elementary Operations
More informationAddition and Subtraction
ddition and Subtraction Philipp Koehn 9 February 2018 1 addition 1-it dder 2 Let s start simple: dding two 1-it numbers Truth table + 0 0 0 0 1 1 1 0 1 1 1 10 Really 2 Operations 3 Truth table for "position
More informationVLSI Design, Fall Logical Effort. Jacob Abraham
6. Logical Effort 6. Logical Effort Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 207 September 20, 207 ECE Department, University of
More informationEEC 116 Lecture #5: CMOS Logic. Rajeevan Amirtharajah Bevan Baas University of California, Davis Jeff Parkhurst Intel Corporation
EEC 116 Lecture #5: CMOS Logic Rajeevan mirtharajah Bevan Baas University of California, Davis Jeff Parkhurst Intel Corporation nnouncements Quiz 1 today! Lab 2 reports due this week Lab 3 this week HW
More informationAdders allow computers to add numbers 2-bit ripple-carry adder
Lecture 12 Logistics HW was due yesterday HW5 was out yesterday (due next Wednesday) Feedback: thank you! Things to work on: ig picture, ook chapters, Exam comments Last lecture dders Today Clarification
More informationStatic CMOS Circuits. Example 1
Static CMOS Circuits Conventional (ratio-less) static CMOS Covered so far Ratio-ed logic (depletion load, pseudo nmos) Pass transistor logic ECE 261 Krish Chakrabarty 1 Example 1 module mux(input s, d0,
More informationΗΜΥ 307 ΨΗΦΙΑΚΑ ΟΛΟΚΛΗΡΩΜΕΝΑ ΚΥΚΛΩΜΑΤΑ Εαρινό Εξάμηνο 2018
ΗΜΥ 307 ΨΗΦΙΑΚΑ ΟΛΟΚΛΗΡΩΜΕΝΑ ΚΥΚΛΩΜΑΤΑ Εαρινό Εξάμηνο 2018 ΔΙΑΛΕΞΗ 11: Dynamic CMOS Circuits ΧΑΡΗΣ ΘΕΟΧΑΡΙΔΗΣ (ttheocharides@ucy.ac.cy) (ack: Prof. Mary Jane Irwin and Vijay Narayanan) [Προσαρμογή από
More informationArithmetic Circuits How to add and subtract using combinational logic Setting flags Adding faster
rithmetic Circuits Didn t I learn how to do addition in second grade? UNC courses aren t what they used to be... 01011 +00101 10000 Finally; time to build some serious functional blocks We ll need a lot
More informationECE/Comp Sci 352 Digital Systems Fundamentals. Charles R. Kime Section 2 Fall Logic and Computer Design Fundamentals
University of Wisconsin - Madison ECE/Comp Sci 352 Digital Systems Fundamentals Charles R. Kime Section 2 Fall 2001 Lecture 5 Registers & Counters Part 2 Charles Kime Counters Counters are sequential circuits
More informationLecture 6 Power Zhuo Feng. Z. Feng MTU EE4800 CMOS Digital IC Design & Analysis 2010
EE4800 CMOS Digital IC Design & Analysis Lecture 6 Power Zhuo Feng 6.1 Outline Power and Energy Dynamic Power Static Power 6.2 Power and Energy Power is drawn from a voltage source attached to the V DD
More informationEE241 - Spring 2001 Advanced Digital Integrated Circuits
EE241 - Spring 21 Advanced Digital Integrated Circuits Lecture 12 Low Power Design Self-Resetting Logic Signals are pulses, not levels 1 Self-Resetting Logic Sense-Amplifying Logic Matsui, JSSC 12/94 2
More informationDigital Integrated Circuits A Design Perspective
Digital Integrated Circuits Design Perspective Designing Combinational Logic Circuits Fuyuzhuo School of Microelectronics,SJTU Introduction Digital IC Dynamic Logic Introduction Digital IC 2 EE141 Dynamic
More informationECE 645: Lecture 3. Conditional-Sum Adders and Parallel Prefix Network Adders. FPGA Optimized Adders
ECE 645: Lecture 3 Conditional-Sum Adders and Parallel Prefix Network Adders FPGA Optimized Adders Required Reading Behrooz Parhami, Computer Arithmetic: Algorithms and Hardware Design Chapter 7.4, Conditional-Sum
More informationChapter 2. Review of Digital Systems Design
x 2-4 = 42.625. Chapter 2 Review of Digital Systems Design Numbering Systems Decimal number may be expressed as powers of 10. For example, consider a six digit decimal number 987654, which can be represented
More informationComputer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic
Computer Science 324 Computer Architecture Mount Holyoke College Fall 2007 Topic Notes: Digital Logic Our goal for the next few weeks is to paint a a reasonably complete picture of how we can go from transistor
More informationCOMP 103. Lecture 10. Inverter Dynamics: The Quest for Performance. Section 5.4.2, What is this lecture+ about? PERFORMANCE
COMP 103 Lecture 10 Inverter Dynamics: The Quest for Performance Section 5.4.2, 5.4.3 [All lecture notes are adapted from Mary Jane Irwin, Penn State, which were adapted from Rabaey s Digital Integrated
More informationCS 140 Lecture 14 Standard Combinational Modules
CS 14 Lecture 14 Standard Combinational Modules Professor CK Cheng CSE Dept. UC San Diego Some slides from Harris and Harris 1 Part III. Standard Modules A. Interconnect B. Operators. Adders Multiplier
More informationCOMBINATIONAL LOGIC. Combinational Logic
COMINTIONL LOGIC Overview Static CMOS Conventional Static CMOS Logic Ratioed Logic Pass Transistor/Transmission Gate Logic Dynamic CMOS Logic Domino np-cmos Combinational vs. Sequential Logic In Logic
More informationCMOS logic gates. João Canas Ferreira. March University of Porto Faculty of Engineering
CMOS logic gates João Canas Ferreira University of Porto Faculty of Engineering March 2016 Topics 1 General structure 2 General properties 3 Cell layout João Canas Ferreira (FEUP) CMOS logic gates March
More informationDynamic operation 20
Dynamic operation 20 A simple model for the propagation delay Symmetric inverter (rise and fall delays are identical) otal capacitance is linear t p Minimum length devices R W C L t = 0.69R C = p W L 0.69
More informationDynamic Combinational Circuits. Dynamic Logic
Dynamic Combinational Circuits Dynamic circuits Charge sharing, charge redistribution Domino logic np-cmos (zipper CMOS) Krish Chakrabarty 1 Dynamic Logic Dynamic gates use a clocked pmos pullup Two modes:
More information7. Combinational Circuits
7. Combinational Circuits Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017 September 25, 2017 ECE Department, University of Texas
More informationEECS 312: Digital Integrated Circuits Final Exam Solutions 23 April 2009
Signature: EECS 312: Digital Integrated Circuits Final Exam Solutions 23 April 2009 Robert Dick Show your work. Derivations are required for credit; end results are insufficient. Closed book. You may use
More informationE40M. Binary Numbers. M. Horowitz, J. Plummer, R. Howe 1
E40M Binary Numbers M. Horowitz, J. Plummer, R. Howe 1 Reading Chapter 5 in the reader A&L 5.6 M. Horowitz, J. Plummer, R. Howe 2 Useless Box Lab Project #2 Adding a computer to the Useless Box alows us
More information