Logical Effort of Higher Valency Adders
|
|
- Bertha King
- 6 years ago
- Views:
Transcription
1 Logcal Effort of gher Valency Adders Davd arrs arvey Mudd College E. Twelfth St. Claremont, CA Abstract gher valency parallel prefx adders reduce the number of logc levels at the expense of greater fan-n at each level. Ths paper uses the method of logcal effort to evaluate the tradeoffs of hgher valency for statc and dynamc mplementatons of varous adder archtectures. A G B P A G Fg Adder block dagram B A B A B C n Precomputaton P G P G P G P I. INTRODUCTION gher valency parallel prefx adders are popular for hgh performance applcatons such as mcroprocessor ALUs [,,, ]. A valency-v N-bt adder requres O(log v N) logc levels, so a bt addton requres as few as three levels of valency propagate-generate gates as opposed to sx levels of valency. owever, the hgher valency gates have greater logcal effort and parastc delay, are more complex to desgn, and are not always avalable n standard cell lbrares. Is hgher valency addton really faster? Domno gates have lower logcal efforts than ther statc counterparts and hence can use greater fan-ns. Does ths mean hgher valences are better suted to domno than statc logc? Ths paper uses the method of logcal effort to try to answer these questons. Accordng to the logcal effort model, the delays of valency-,, and desgns are all approxmately the same for a gven archtecture, crcut famly, and wre load model. Ths paper closely follows the methodology of []. It frst descrbes the statc and domno gates used to compute generate and propagate sgnals for the varous valences and tabulates the estmated logcal effort and parastc delay of each gate. It then shows the prefx networks and the crtcal paths that were examned. Fnally, t calculates the delays for valency,, and for each archtecture and crcut famly usng the method of logcal effort. II. LOGICAL EFFORT OF CIRCUIT BUILDING BLOCKS The three basc buldng blocks for an adder are the btwse Propagate/Generate (PG) cells, the group PG cells n the prefx network, and the sum XORs, as shown n Fg. gh performance datapath adders often buld these cells from domno gates whle statc s preferable when desgn smplcty and power consumpton take precedence over utmost performance. Fg shows mplementatons of the btwse PG cells and the sum XOR gates usng statc and domno gates. The statc desgns use propagate and generate (PG) whle the domno add kll (K) for monotonc sum computaton. The transstor wdths are specfed n arbtrary unts to delver unt drve. Nonnvertng statc gates add an nverter after Btwse PG Sum XOR C out A C P : S G : P : G : P : G : P : G : P : G : C S Invertng Statc G : C B A G B B A A B P P G -: G -: G -: G -: G -: G -: P P S G : C S G : C Fg Btwse PG and sm XOR gates P S A _h P ' A _l B _h P G -: Footless Domno A _h B _l P Prefx Network Postcomputaton Table Btwse PG and sum XOR delay estmates Cell Term Nonnvertng Invertng Footed Domno Footless Domno Btwse LEbt / / / * / / * / PDbt / + / / + / / + / Sum XOR LExor / / / * / / * / PDxor / + / / + / / + / / + / each nvertng stage. Footed domno gates requre an extra clocked evaluaton transstor. The logcal efforts (LE) and parastc delays (PD) are gven n Table. Prefx networks consst of black cells, gray cells, and buffers. Black cells compute both propagate and generate sgnals. Gray cells compute only generate, and buffers reduce the loadng presented by noncrtcal paths. Fg shows crcut mplementatons of propagate and generate gates for valency. Invertng statc desgns requre alternatng stages of the gates shown and ther DeMorgan complements that accept nverted nputs and produce true outputs. [] found that the dfference n delay of the complementary stages s nsgnfcant, so t wll be gnored. K -: A _l P ' tny G P K P ' S _h S _l
2 Fg Valency statc and dynamc generate/propagate gates Fg Valency adder archtectures G P G G G P G :j P P P : P P G G P P K K G : P : K : (c) Brent-Kung : : : : : : : : P G P G G Fg Valency statc and dynamc generate/propagate gates G G P G P G P P P P P P G P : Valency Term Cell Invertng G G : G P G P / P G P K K K / K Table Gray and black cell delay estmates Nonnvertng Footed Domno Footless Domno PDg / / + / + / / + / PDp + / + / / + / LEg / / * / / * / LEg / / * / / * / LEp Gray / / * / / * / LEp Black / / * / / * / LEp Black / / * / / * / PDg / / + / + / / + / PDp + / + / / + / LEg / / * / / * / LEg / / * / ½ * / LEg / / * / / * / LEp Gray / / * / / * / LEp Gray / / * / / * / LEp Black / / * / / * / LEp Black / / * / / * / LEp Black / / * / / * / PDg / / + / + / / + / PDp + / + / / + / LEg / / * / / * / LEg / / * / / * / LEg / / * / / * / LEg / / * / / * / LEp Gray / / * / / * / LEp Gray / / * / / * / LEp Gray / / * / / * / LEp Black / / * / / * / LEp Black / / * / / * / LEp Black / / * / / * / LEp Black / / * / / * / Smlarly, Fg shows the crcut desgns for valency. Table gves the logcal efforts and parastc delays for the varous nputs to black and gray cells n each crcut famly. III. ADDER ARCITECTURES Adders are dstngushed by the arrangement of cells n the group PG logc. Fg shows typcal parallel prefx archtectures for valency gates []. One of several paths may be most crtcal dependng on the cell delays; the black hghlghted lnes ndcate the path that was assumed to be crtcal n ths study. Smlarly, Fg shows the analogous archtectures for hgher valency. gher valency adders offer a number of hybrd tree / select archtectures such as the spannng tree and sparse tree that reduce the number of cells n the parallel prefx network n exchange for addng short rpple networks; these varants are not consdered n ths study. G : P : K : : : : : : : : : : : ::: : : : : : : : : : : : : : (d) Sklansky : : : : : : : : : : : : : : : : : : : : ::: : : : : : : : : : : : : : (e) Kogge-Stone : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : ::: : : : : : : : : : : : : : (f) an-carlson : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : (g) Knowles [,,,] : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : (h) Ladner-Fscher : : : : : : : : : : : : : : : : : : : : :: : : : : : : : : : : : : : :
3 IV. LOGICAL EFFORT DELAY MODEL The method of Logcal Effort provdes a smple method for determnng a lower bound on crtcal path delay n crcuts wth neglgble wre capactance. If the path has M stages, a path effort of F, and a parastc delay of PD, the delay (n τ) acheved wth best transstor szes s /M D DF PD MF PD = + = + () where D s measured n unts of τ, the delay of an deal nverter wth no parastc capactance drvng an dentcal nverter. Delay s normalzed to that of a fanout-of- nverter wth the converson FO τ. In general, achevng least delay requres usng dfferent transstor szes n each gate (although ths delay model has assumed that all transstors n a branch scale unformly). A regular layout wth consstent transstor szes n each type of cell s easer to buld but may sacrfce performance. Consder desgnng all cells to have an arbtrary unt drve (.e. output conductance). Defne an nverter wth unt drve to have unt nput capactance. For crcuts wth a sngle stage per cell (e.g. nvertng statc ), the path effort delay s smply the sum of the effort delays of each stage: D F M = f () = The total delay s stll the sum of the path effort and parastc delays. In a crcut wth two stages per cell (e.g. nonnvertng statc or domno), let us desgn the frst stage to have unt drve. Choose the sze of the second stage for least delay. If the path has C = M/ cells and the effort of the th cell s F, the path effort delay s D F C = F () = [] showed that the delay wth unform szes s only slghtly longer than the delay wth arbtray szes except on archtectures lke Sklansky that have unusually large fanouts on certan nodes. The unform sze desgns are also easer to layout and permt closed-form results when wre capactance s consdered, so we focus on them n ths paper. orzontal wres add capactance to the load of each stage. Let the wre capactance be w unts per column spanned. w depends on the wdth of each column, the wdth and spacng between wres, and the sze of a unt transstor; n a tral layout n a nm process, w.. Whle there s no closed-form soluton for the mnmum-delay problem wth wre capactance, the delay assumng fxed cell szes s readly calculated by addng the wre capactance to the stage effort f or F n EQ () or (). V. RESULTS The adder delays were evaluated usng a MATLAB scrpt. Fg plots delay (n FO nverter delays) vs. number of bts for varous adder archtectures, and crcut famles assumng w =.. The three curves on each set of axes ndcate valency,, and delays. The delay s nearly ndependent of the valency for both statc and domno desgns of most archtectures. Brent-Kung archtectures are an excepton that beneft from hgher valency for nonnvertng crcuts because the stage effort s too low wth valency, but Brent-Kung s not the fastest archtecture n any case. Domno gates are consstently faster than statc and footless domno s faster than footed. The desgns wth two gates per stage (all but nvertng ) are better at drvng the heavy wre loads and hence perform better for wde adders. VI. CONCLUSIONS The logcal effort model facltates rapd comparson of a wde varety of adder archtectures usng multple crcut famles whle accountng for the costs of fanout and nterconnect. Under the assumptons made n ths paper, the delay s nearly ndependent of the valency for both statc and domno desgns of most archtectures. Brent-Kung archtectures are an excepton that beneft from hgher valency for nonnvertng crcuts because the stage effort s too low wth valency, but Brent-Kung s not the fastest archtecture n any case. Valency desgns are the smplest to mplement. Ths paper has not consdered the area, power, or wrng tradeoffs of hgher valency adders. In practce, the logcal efforts of gates are lkely to be lower on account of velocty saturaton, but the parastc delays are lkely to be hgher when nternal nodes are consdered. Smulatons of extracted layouts could answer these questons. REFERENCES A. Beaumont-Smth and C. Lm, Parallel prefx adder desgn, Proc. th IEEE Symp. Comp. Arth, pp. -, June. D. arrs and I. Sutherland, Logcal effort of carry propagate adders, Proc. th Aslomar Conf. Sgnals, Systems, and Computers, pp. -,. T. Lynch and E. Swartzlander, A spannng tree carry lookahead adder, IEEE Trans. Computers, vol., no., Aug., pp. -. S. Mathew, M. Anders, R. Krshnamurthy, and S. Borkar, "A -Gz -nm address generaton unt wth -bt sparse-tree adder core," J. Sold-State Crcut, vol., no., May, pp. -. S. Naffzger, A subnanosecond. µm b adder desgn, Intl. Sold-state Crcuts Conf.,, pp. -. N. Weste and D. arrs, VLSI Desgn, Addson-Wesley,.
4 Fg Valency adder archtectures (a) Brent-Kung : : : : : : : : : : : : : : : : : : : : : : : : : : : (b) Sklansky : : : : : : : : : : : : : : : : : : : : : : : : : : : (c) Kogge-Stone : : : : : : : : : : : : : : : : : : : : : : : : : : : (d) an-carlson : : : : : : : : : : : : : : : : : : : : : : : : : : : (e) Ladner-Fscher : :
5 Fg Adder delay vs. # of bts (logcal effort model results) Brent-Kung Delay (FO) Ladner-Fscher Sklansky Kogge-Stone an-carlson Invertng Nonnvertng # of bts Footed Domno Valency Valency Valency Footless Domno
Lecture 4: Adders. Computer Systems Laboratory Stanford University
Lecture 4: Adders Computer Systems Laboratory Stanford Unversty horowtz@stanford.edu Copyrght 2004 by Mark Horowtz (w/ Fgures from Hgh-Performance Mcroprocessor Desgn IEEE And Fgures from Bora Nkolc 1
More informationLogic effort and gate sizing
EEN454 Dgtal Integrated rcut Desgn Logc effort and gate szng EEN 454 Introducton hp desgners face a bewlderng arra of choces What s the best crcut topolog for a functon? How man stages of logc gve least
More informationEstimating Delays. Gate Delay Model. Gate Delay. Effort Delay. Computing Logical Effort. Logical Effort
Estmatng Delas Would be nce to have a back of the envelope method for szng gates for speed Logcal Effort ook b Sutherland, Sproull, Harrs Chapter s on our web page Gate Dela Model Frst, normalze a model
More informationAdders. Today: Adders. EE M216A.:. Fall Prof. Dejan Marković Lecture 9. Basic terminology. Adder building blocks
EE M216.:. Fall 21 Lecture 9 dders Prof. Dejan Markovć ee216a@gmal.com Today: dders asc termnology dder buldng blocks asc adder topologes Lnear adders (n < 16) Fast parallel adders (n > 16) Some examples
More informationLecture 7: Multistage Logic Networks. Best Number of Stages
Lecture 7: Multstage Logc Networks Multstage Logc Networks (cont. from Lec 06) Examples Readng: Ch. Best Number of Stages How many stages should a path use? Mnmzng number of stages s not always fastest
More informationTOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION
1 2 MULTIPLIERLESS FILTER DESIGN Realzaton of flters wthout full-fledged multplers Some sldes based on support materal by W. Wolf for hs book Modern VLSI Desgn, 3 rd edton. Partly based on followng papers:
More informationDUE: WEDS FEB 21ST 2018
HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant
More informationInterconnect Optimization for Deep-Submicron and Giga-Hertz ICs
Interconnect Optmzaton for Deep-Submcron and Gga-Hertz ICs Le He http://cadlab.cs.ucla.edu/~hele UCLA Computer Scence Department Los Angeles, CA 90095 Outlne Background and overvew LR-based STIS optmzaton
More informationEE241 - Spring 2000 Advanced Digital Integrated Circuits. Carry-Skip Adder
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,
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More information( ) = ( ) + ( 0) ) ( )
EETOMAGNETI OMPATIBIITY HANDBOOK 1 hapter 9: Transent Behavor n the Tme Doman 9.1 Desgn a crcut usng reasonable values for the components that s capable of provdng a tme delay of 100 ms to a dgtal sgnal.
More informationI = α I I. Bipolar Junction Transistors (BJTs) 2.15 The Emitter-Coupled Pair. By using KVL: V
Bpolar Juncton ransstors (BJs).5 he Emtter-oupled Par By usng KL: + + 0 Wth the transstors based n the forward-acte mode, the reerse saturaton current of the collector-base juncton s neglgble. / α F ES
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationPolynomial Regression Models
LINEAR REGRESSION ANALYSIS MODULE XII Lecture - 6 Polynomal Regresson Models Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Test of sgnfcance To test the sgnfcance
More information9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set
More informationFE REVIEW OPERATIONAL AMPLIFIERS (OP-AMPS)( ) 8/25/2010
FE REVEW OPERATONAL AMPLFERS (OP-AMPS)( ) 1 The Op-amp 2 An op-amp has two nputs and one output. Note the op-amp below. The termnal labeled l wth the (-) sgn s the nvertng nput and the nput labeled wth
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 informationEE241 - Spring 2005 Advanced Digital Integrated Circuits. Clock Generation. Lecture 22: Adders. Delay-Locked Loop (Delay Line Based) f REF Phase Det
EE24 - Srng 2005 dvanced Dgtal Integrated Crcuts Lecture 22: dders Clock Generaton Delay-Locked Loo (Delay Lne Based) f REF Phase Det U D Charge Pum Flter DL f O Phase-Locked Loo (VCO-Based) f REF U N
More informationA Novel, Low-Power Array Multiplier Architecture
A Noel, Low-Power Array Multpler Archtecture by Ronak Bajaj, Saransh Chhabra, Sreehar Veeramachanen, MB Srnas n 9th Internatonal Symposum on Communcaton and Informaton Technology 29 (ISCIT 29) Songdo -
More informationDepartment of Electrical & Electronic Engineeing Imperial College London. E4.20 Digital IC Design. Median Filter Project Specification
Desgn Project Specfcaton Medan Flter Department of Electrcal & Electronc Engneeng Imperal College London E4.20 Dgtal IC Desgn Medan Flter Project Specfcaton A medan flter s used to remove nose from a sampled
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationHIGH-SPEED MULTI OPERAND ADDITION UTILIZING FLAG BITS VIBHUTI DAVE DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING
HIGH-SPEED MULTI OPERAND ADDITION UTILIZING FLAG BITS BY VIBHUTI DAVE DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING Submtted n partal fulfllment of the requrements for the degree of Doctor of Phlosophy
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationAbstract. The assumptions made for rank computation are as follows. (see Figure 1)
A Novel Metrc for Interconnect Archtecture Performance Parthasarath Dasgupta, Andrew B. Kahng, and Swamy Muddu CSE Department, UCSD, La Jolla, CA 92093-0114 ECE Department, UCSD, La Jolla, CA 92093-0407
More information1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys
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 informationUsing the Minimum Set of Input Combinations to Minimize the Area of Local Routing Networks in Logic Clusters. FPGAs. Andy Ye Ryerson University
Usng the Mnmum Set of Input Combnatons to Mnmze the Area of Local Routng Networks n Logc Clusters Contanng Logcally Equvalent I/Os n FPGAs Andy Ye Ryerson Unversty Mnmum-area IIBs how to mnmze the area
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 informationCoarse-Grain MTCMOS Sleep
Coarse-Gran MTCMOS Sleep Transstor Szng Usng Delay Budgetng Ehsan Pakbazna and Massoud Pedram Unversty of Southern Calforna Dept. of Electrcal Engneerng DATE-08 Munch, Germany Leakage n CMOS Technology
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationUnit 1. Current and Voltage U 1 VOLTAGE AND CURRENT. Circuit Basics KVL, KCL, Ohm's Law LED Outputs Buttons/Switch Inputs. Current / Voltage Analogy
..2 nt Crcut Bascs KVL, KCL, Ohm's Law LED Outputs Buttons/Swtch Inputs VOLTAGE AND CRRENT..4 Current and Voltage Current / Voltage Analogy Charge s measured n unts of Coulombs Current Amount of charge
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationFE REVIEW OPERATIONAL AMPLIFIERS (OP-AMPS)
FE EIEW OPEATIONAL AMPLIFIES (OPAMPS) 1 The Opamp An opamp has two nputs and one output. Note the opamp below. The termnal labeled wth the () sgn s the nvertng nput and the nput labeled wth the () sgn
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationNegative Binomial Regression
STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationCSE4210 Architecture and Hardware for DSP
4210 Archtecture and Hardware for DSP Lecture 1 Introducton & Number systems Admnstratve Stuff 4210 Archtecture and Hardware for DSP Text: VLSI Dgtal Sgnal Processng Systems: Desgn and Implementaton. K.
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationModule #6: Combinational Logic Design with VHDL Part 2 (Arithmetic)
ECOM4311 Dgtal Systems Desgn : Combnatonal Logc Desgn wth VHDL Part 2 (Arthmetc) - A crcut that compares dgtal values (.e., Equal, Greater Than, Less Than) Agenda 1. 2. Adders (Rpple Carry, Carry-Look-Ahead)
More informationContinued..& Multiplier
CS222: Computer Arthmetc : Adder Contnued..& Multpler Dr. A. Sahu Dept of Comp. Sc. & Engg. Indan Insttute of Technology Guwahat 1 Outlne Adder Unversal Use (N bt addton) RppleCarry Adder, Full Adder,
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 informationImplementation and Study of Reversible Binary Comparators
Implementaton and Study of Reversble Bnary Comparators Harth M, C Vasanthanayak Abstract Reversble logc contans a feature of recoverng bt loss from unque nput-output mappng. Usng tradtonal (rreversble)
More informationClock-Gating and Its Application to Low Power Design of Sequential Circuits
Clock-Gatng and Its Applcaton to Low Power Desgn of Sequental Crcuts ng WU Department of Electrcal Engneerng-Systems, Unversty of Southern Calforna Los Angeles, CA 989, USA, Phone: (23)74-448 Massoud PEDRAM
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationCollege of Engineering Department of Electronics and Communication Engineering. Test 1 With Model Answer
Name: Student D Number: Secton Number: 01/0/03/04 A/B Lecturer: Dr Jamaludn/ Dr Jehana Ermy/ Dr Azn Wat Table Number: College of Engneerng Department of Electroncs and Communcaton Engneerng Test 1 Wth
More informationA Low Error and High Performance Multiplexer-Based Truncated Multiplier
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 18, NO. 1, DECEMBER 010 1767 A Low Error and Hgh Performance Multplexer-Based Truncated Multpler Chp-Hong Chang and Rav Kumar Satzoda
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More informationDesign and Implementation of Carry Tree Adders using Low Power FPGAs
1 Design and Implementation of Carry Tree Adders using Low Power FPGAs Sivannarayana G 1, Raveendra babu Maddasani 2 and Padmasri Ch 3. Department of Electronics & Communication Engineering 1,2&3, Al-Ameer
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationI. INTRODUCTION. 1.1 Circuit Theory Fundamentals
I. INTRODUCTION 1.1 Crcut Theory Fundamentals Crcut theory s an approxmaton to Maxwell s electromagnetc equatons n order to smplfy analyss of complcated crcuts. A crcut s made of seeral elements (boxes
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More information1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands
Content. Inference on Regresson Parameters a. Fndng Mean, s.d and covarance amongst estmates.. Confdence Intervals and Workng Hotellng Bands 3. Cochran s Theorem 4. General Lnear Testng 5. Measures of
More informationReal-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling
Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationA New Design of Multiplier using Modified Booth Algorithm and Reversible Gate Logic
Internatonal Journal of Computer Applcatons Technology and Research A New Desgn of Multpler usng Modfed Booth Algorthm and Reversble Gate Logc K.Nagarjun Department of ECE Vardhaman College of Engneerng,
More informationChapter 15 Student Lecture Notes 15-1
Chapter 15 Student Lecture Notes 15-1 Basc Busness Statstcs (9 th Edton) Chapter 15 Multple Regresson Model Buldng 004 Prentce-Hall, Inc. Chap 15-1 Chapter Topcs The Quadratc Regresson Model Usng Transformatons
More informationCHAPTER 13. Exercises. E13.1 The emitter current is given by the Shockley equation:
HPT 3 xercses 3. The emtter current s gen by the Shockley equaton: S exp VT For operaton wth, we hae exp >> S >>, and we can wrte VT S exp VT Solng for, we hae 3. 0 6ln 78.4 mv 0 0.784 5 4.86 V VT ln 4
More informationAGC Introduction
. Introducton AGC 3 The prmary controller response to a load/generaton mbalance results n generaton adjustment so as to mantan load/generaton balance. However, due to droop, t also results n a non-zero
More informationUsing the estimated penetrances to determine the range of the underlying genetic model in casecontrol
Georgetown Unversty From the SelectedWorks of Mark J Meyer 8 Usng the estmated penetrances to determne the range of the underlyng genetc model n casecontrol desgn Mark J Meyer Neal Jeffres Gang Zheng Avalable
More informationLecture 8: Time & Clocks. CDK: Sections TVS: Sections
Lecture 8: Tme & Clocks CDK: Sectons 11.1 11.4 TVS: Sectons 6.1 6.2 Topcs Synchronzaton Logcal tme (Lamport) Vector clocks We assume there are benefts from havng dfferent systems n a network able to agree
More informationStanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7
Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationIntroduction to information theory and data compression
Introducton to nformaton theory and data compresson Adel Magra, Emma Gouné, Irène Woo March 8, 207 Ths s the augmented transcrpt of a lecture gven by Luc Devroye on March 9th 207 for a Data Structures
More informationCHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER. In real environmental conditions the speech signal may be
55 CHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER 4.1 Introducton In real envronmental condtons the speech sgnal may be supermposed by the envronmental nterference. In general, the spectrum
More informationExperience with Automatic Generation Control (AGC) Dynamic Simulation in PSS E
Semens Industry, Inc. Power Technology Issue 113 Experence wth Automatc Generaton Control (AGC) Dynamc Smulaton n PSS E Lu Wang, Ph.D. Staff Software Engneer lu_wang@semens.com Dngguo Chen, Ph.D. Staff
More informationDepartment of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution
Department of Statstcs Unversty of Toronto STA35HS / HS Desgn and Analyss of Experments Term Test - Wnter - Soluton February, Last Name: Frst Name: Student Number: Instructons: Tme: hours. Ads: a non-programmable
More informationOptimum Prefix Adders in a Comprehensive Area, Timing and Power Design Space
Optimum Prefix Adders in a Comprehensive Area, Timing and Power Design Space Jianhua Liu, Yi Zhu, Haikun Zhu, Chung-Kuan Cheng Department of Computer Science and Engineering University of California, San
More informationMultiline Overview. Karl Bois, PhD Lead SI Engineer Servers & Blades. December 5th, 2016
Multlne Overvew Karl Bos, PhD Lead SI Engneer Servers & Blades December 5th, 216 Why are we here? Orgnal Equpment Manufacturers (OEMs) and Orgnal Desgn Manufacturers (ODMs) have desgns that requre that
More informationRun-time Active Leakage Reduction By Power Gating And Reverse Body Biasing: An Energy View
Run-tme Actve Leakage Reducton By Power Gatng And Reverse Body Basng: An Energy Vew Hao Xu, Ranga Vemur and Wen-Ben Jone Department of Electrcal and Computer Engneerng, Unversty of Cncnnat Cncnnat, Oho
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
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 information8 Derivation of Network Rate Equations from Single- Cell Conductance Equations
Physcs 178/278 - Davd Klenfeld - Wnter 2015 8 Dervaton of Network Rate Equatons from Sngle- Cell Conductance Equatons We consder a network of many neurons, each of whch obeys a set of conductancebased,
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationCombinational Circuit Design
Combnatonal Crcut Desgn Part I: Desgn Procedure and Examles Part II : Arthmetc Crcuts Part III : Multlexer, Decoder, Encoder, Hammng Code Combnatonal Crcuts n nuts Combnatonal Crcuts m oututs A combnatonal
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationRT Level Power Analysis y. Jianwen Zhu, Poonam Agrawal, Daniel D. Gajski. components [La94]. its simplicity.
RT Level Power Analyss y Janwen Zhu, Poonam Agrawal, Danel D. Gajsk Department of Informaton and omputer Scence Unversty of alforna, Irvne, A 92717-3425 Abstract Elevatng power estmaton to archtectural
More informationarxiv:quant-ph/ Jul 2002
Lnear optcs mplementaton of general two-photon proectve measurement Andrze Grudka* and Anton Wóck** Faculty of Physcs, Adam Mckewcz Unversty, arxv:quant-ph/ 9 Jul PXOWRZVNDR]QDRODQG Abstract We wll present
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationSimultaneous Device and Interconnect Optimization
Smultaneous Devce and Interconnect Optmaton Smultaneous devce and wre sng Smultaneous buffer nserton and wre sng Smultaneous topology constructon, buffer nserton and wre sng WBA tree (student presentaton)
More informationLow Complexity Soft-Input Soft-Output Hamming Decoder
Low Complexty Soft-Input Soft-Output Hammng Der Benjamn Müller, Martn Holters, Udo Zölzer Helmut Schmdt Unversty Unversty of the Federal Armed Forces Department of Sgnal Processng and Communcatons Holstenhofweg
More informationAN EFFICIENT TECHNIQUE FOR DEVICE AND INTERCONNECT OPTIMIZATION IN DEEP SUBMICRON DESIGNS. Jason Cong Lei He
AN EFFICIENT TECHNIQUE FOR DEVICE AND INTERCONNECT OPTIMIZATION IN DEEP SUBMICRON DESIGNS Jason Cong Le He Department of Computer Scence Unversty of Calforna, Los Angeles, CA 90095 cong@cs.ucla.edu, hele@cs.ucla.edu
More informationDetermining Transmission Losses Penalty Factor Using Adaptive Neuro Fuzzy Inference System (ANFIS) For Economic Dispatch Application
7 Determnng Transmsson Losses Penalty Factor Usng Adaptve Neuro Fuzzy Inference System (ANFIS) For Economc Dspatch Applcaton Rony Seto Wbowo Maurdh Hery Purnomo Dod Prastanto Electrcal Engneerng Department,
More informationInterconnect Modeling
Interconnect Modelng Modelng of Interconnects Interconnect R, C and computaton Interconnect models umped RC model Dstrbuted crcut models Hgher-order waveform n dstrbuted RC trees Accuracy and fdelty Prepared
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationGasometric Determination of NaHCO 3 in a Mixture
60 50 40 0 0 5 15 25 35 40 Temperature ( o C) 9/28/16 Gasometrc Determnaton of NaHCO 3 n a Mxture apor Pressure (mm Hg) apor Pressure of Water 1 NaHCO 3 (s) + H + (aq) Na + (aq) + H 2 O (l) + CO 2 (g)
More informationOn balancing multiple video streams with distributed QoS control in mobile communications
On balancng multple vdeo streams wth dstrbuted QoS control n moble communcatons Arjen van der Schaaf, José Angel Lso Arellano, and R. (Inald) L. Lagendjk TU Delft, Mekelweg 4, 68 CD Delft, The Netherlands
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More information8.1 Arc Length. What is the length of a curve? How can we approximate it? We could do it following the pattern we ve used before
.1 Arc Length hat s the length of a curve? How can we approxmate t? e could do t followng the pattern we ve used before Use a sequence of ncreasngly short segments to approxmate the curve: As the segments
More informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More informationLab 2e Thermal System Response and Effective Heat Transfer Coefficient
58:080 Expermental Engneerng 1 OBJECTIVE Lab 2e Thermal System Response and Effectve Heat Transfer Coeffcent Warnng: though the experment has educatonal objectves (to learn about bolng heat transfer, etc.),
More informationLecture 4. Macrostates and Microstates (Ch. 2 )
Lecture 4. Macrostates and Mcrostates (Ch. ) The past three lectures: we have learned about thermal energy, how t s stored at the mcroscopc level, and how t can be transferred from one system to another.
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationSuppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl
RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com
More information18.1 Introduction and Recap
CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationELE B7 Power Systems Engineering. Power Flow- Introduction
ELE B7 Power Systems Engneerng Power Flow- Introducton Introducton to Load Flow Analyss The power flow s the backbone of the power system operaton, analyss and desgn. It s necessary for plannng, operaton,
More informationLecture 14: Forces and Stresses
The Nuts and Bolts of Frst-Prncples Smulaton Lecture 14: Forces and Stresses Durham, 6th-13th December 2001 CASTEP Developers Group wth support from the ESF ψ k Network Overvew of Lecture Why bother? Theoretcal
More information