Lecture 11: Adder Design
|
|
|
- Preston Tucker
- 5 years ago
- Views:
Transcription
1 Lecture : Adder Design Mark McDermott Electrical and omputer Engineering The University of Texas at Austin /9/8 EE46 lass Notes
2 Single-it Addition Half Adder Full Adder A A S = AÅÅ out out S out = MAJ( A,, ) S A out S A G P K out S Page 2
3 Full Adder Design I rute force implementation from equations S = AÅÅ out = MAJ( A,, ) A A A A A A MAJ S out S A A A out A A A Page 3
4 Full Adder Design II Factor S in terms of out S = A + (A + + )(~out) ritical path is usually to out in ripple adder MINORITY A out S S out Page 4
5 Layout lever layout circumvents usual line of diffusion Use wide transistors on critical path Eliminate output inverters Page 5
6 Full Adder Design III omplementary Pass Transistor Logic (PL) Slightly faster, but more area Requires true and complement signals There is some signal degradation through the pass transistors. ross coupled PMOS devices are used to restore logic levels. A S out A A S out A Page 6
7 Ripple arry Adder Simplest design: cascade full adders ritical path goes from in to out Design full adder to have fast carry delay A 4 4 A 3 3 A 2 2 A out 3 2 S 4 S 3 S 2 S in Page 7
8 Use Inversions to speed up arry Path ritical path passes through majority gate uilt from minority + inverter Eliminate inverter and use inverting full adder A 4 4 A 3 3 A 2 2 A out in 3 2 S 4 S 3 S 2 S Page 8
9 arry Propagate Adders N-bit adder called PA Each sum bit depends on all previous carries How do we compute all these carries quickly? A N... N... out out out + in + + in in carries A S 4... S N... Page 9
10 arry Propagate, Generate, Kill (PGK) For a full adder, define what happens to carries Generate: out = independent of G = A Propagate: out = P = A Å Kill: out = independent of K = ~A ~ (i.e., ~K = A + ) A G P K out S Page
11 Propagate / Generate (PG) Equations often factored into P and G Propagate and generate for groups spanning i:j G i: j = G i:k + P i:k i G k : j P i: j = P i:k i P k : j ase case G i:i G i = A i i i P i:i P i = A i i ::ing G: º G = in P: º P = Sum: Si = Pi Å Gi - : Page
12 Ripple arry Revisited in PG Framework G i: = G i + P i i G i : A 4 4 A 3 3 A 2 2 A in G 4 P 4 G 3 P 3 G 2 P 2 G P G P G 3: G 2: G : G : out S 4 S 3 S 2 S Page 2
13 PG Diagram Notation lack cell Gray cell uffer i:k k-:j i:k k-:j i:j i:j i:j i:j G i:k P i:k G k-:j G i:j G i:k P i:k G i:j G k-:j G i:j G i:j P k-:j P i:j P i:j P i:j Page 3
14 Ripple arry PG Diagram t = t + ( N - ) t + t ripple pg AO xor A 4 4 A 3 3 A 2 2 A in G 4 P 4 G 3 P 3 G 2 P 2 G P G P G 3: G 2: G : G : out S 4 S 3 S 2 S Page 4
15 arry-skip Adder Ripple carry is slow through all N stages arry-skip allows carry to skip over groups of n bits Decision based on n-bit propagate signal A 6:3 6:3 A 2:9 2:9 A 8:5 8:5 A 4: 4: P 6:3 P 2:9 P 8:5 P 4: out in S 6:3 S 2:9 S 8:5 S 4: Page 5
16 Manchester arry-skip Adder Uses dynamic logic and n-channel pass gates an skip across 4 bits /9/8 EE46 lass Notes Page 6
17 arry-skip PG Diagram For k n-bit groups (N = nk) t ( ) skip = tpg + éë2 n- + ( k - ) ùûtao + t Page 7 xor
18 Variable Group Size Delay grows as O(sqrt(N)) Page 8
19 arry-lookahead Adder arry-lookahead adder computes G i: for many bits in parallel Uses higher-valency cells with more than two inputs Page 9
20 Higher-Valency ells i:k k-:l l-:m m-:j i:j G i:k P i:k G k-:l P k-:l G l-:m P l-:m G m-:j P m-:j G i:j P i:j Page 2
21 LA PG diagram using higher valency cells Page 2
22 arry-select Adder Trick for critical paths dependent on late input X Precompute two possible outputs for X =, Select proper output when X arrives arry-select adder precomputes n-bit sums For both possible carries into n-bit group A 6:3 6:3 A 2:9 2:9 A 8:5 8:5 A 4: 4: out in S 6:3 S 2:9 S 8:5 S 4: Page 22
23 arry-increment Adder Factor initial PG and final XOR out of carry-select t ( ) increment = tpg + éë n- + ( k - ) ùûtao + t Page 23 xor
24 Variable Group Size uffer noncritical signals Page 24
25 Tree Adder If look-ahead is good, look-ahead across lookahead! Recursive lookahead gives O(log N) delay Many variations on tree adders Three metrics to worry about: Wiring tracks Levels of logic Fanout Page 25
26 rent-kung :4 3:2 : 9:8 7:6 5:4 3:2 : 5:2 :8 7:4 3: 5:8 7: : 3: 9: 5: 5:4:3: 2: : : 9: 8: 7: 6: 5: 4: 3: 2: : : Page 26
27 Sklansky :4 3:2 : 9:8 7:6 5:4 3:2 : 5:2 4:2 :8 :8 7:4 6:4 3: 2: 5:8 4:8 3:8 2:8 5: 4: 3: 2: : : 9: 8: 7: 6: 5: 4: 3: 2: : : Page 27
28 Kogge-Stone :4 4:3 3:2 2: : :9 9:8 8:7 7:6 6:5 5:4 4:3 3:2 2: : 5:2 4: 3: 2:9 :8 :7 9:6 8:5 7:4 6:3 5:2 4: 3: 2: 5:8 4:7 3:6 2:5 :4 :3 9:2 8: 7: 6: 5: 4: 5: 4: 3: 2: : : 9: 8: 7: 6: 5: 4: 3: 2: : : Page 28
29 Tree Adder Taxonomy Ideal N-bit tree adder would have L = log N logic levels Fanout never exceeds 2 No more than one wiring track between levels We describe adders with 3-D taxonomy (l, f, t) Logic levels: L + l Fanout: 2 f + Wiring tracks: 2 t Known tree adders sit on plane defined by l + f + t = L- Page 29
30 asic Tree Adder Taxonomy l (Logic Levels) 3 (7) f (Fanout) Sklansky 2 (6) rent-kung 3 (9) 2 (5) (5) (3) (2) (4) () (2) 2 (4) 3 (8) Kogge-Stone t (Wire Tracks) /9/8 EE46 lass Notes Page 3
31 Han-arlson :4 3:2 : 9:8 7:6 5:4 3:2 : 5:2 3: :8 9:6 7:4 5:2 3: 5:8 3:6 :4 9:2 7: 5: 5: 4: 3: 2: : : 9: 8: 7: 6: 5: 4: 3: 2: : : Page 3
32 Knowles :4 4:3 3:2 2: : :9 9:8 8:7 7:6 6:5 5:4 4:3 3:2 2: : 5:2 4: 3: 2:9 :8 :7 9:6 8:5 7:4 6:3 5:2 4: 3: 2: 5:8 4:7 3:6 2:5 :4 :3 9:2 8: 7: 6: 5: 4: 5: 4: 3: 2: : : 9: 8: 7: 6: 5: 4: 3: 2: : : Page 32
33 Ladner-Fischer :4 3:2 : 9:8 7:6 5:4 3:2 : 5:2 :8 7:4 3: 5:8 3:8 7: 5: 5:8 3: : 9: 5: 4: 3:2: : : 9: 8: 7: 6: 5: 4: 3: 2: : : Page 33
34 Revised Tree Adder Taxonomy /9/8 EE46 lass Notes Page 34
35 Tree Adder Taxonomy Overview (b) Sklansky (f) Ladner-Fischer :4 3:2 : 9:8 7:6 5:4 3:2 : 5:4 3:2 : 9:8 7:6 5:4 3:2 : 5:2 :8 7:4 3: 5:2 4:2 :8 :8 7:4 6:4 3: 2: 5:8 3:8 7: 5: 5:8 4:8 3:8 2:8 5:8 3: : 9: 5:4:3: 2::: 9: 8: 7: 6: 5: 4: 3: 2: : : f (Fanout) Sklansky Ladner- Fischer Ladner- Fischer 2 (6) rent- Kung l (Logic Levels) 3 (7) (a) rent-kung 5 4 5: 4: 3: 2: : : 9: 8: 7: 6: 5: 4: 3: 2: : : (e) Knowles [2,,,] (9) 2 (5) (3) (2) (4) () (5) Han- arlson 5:4 5:2 5:8 3:2 : :8 9:8 7:6 7:4 7: 5:4 3:2 3: : 5:4 4:3 3:2 2: : :9 5:2 4: 3: 2:9 :8 :7 9:8 9:6 8:7 8:5 7:6 7:4 6:5 6:3 5:4 5:2 4:3 4: 3:2 3: 2: 2: : Knowles [4,2,,] New (,,) : 3: 9: 5: 5:8 4:7 3:6 2:5 :4 :3 9:2 8: 7: 6: 5: 4: (2) 5:4:3:2::: 9: 8: 7: 6: 5: 4: 3: 2: : : Knowles [2,,,] 2 (4) Han- arlson (d) Han-arlson 5:4:3:2::: 9: 8: 7: 6: 5: 4: 3: 2: : : (c) Kogge-Stone Kogge- Stone 3 (8) 5:4 3:2 : 9:8 7:6 5:4 3:2 : 5:4 4:3 3:2 2: : :9 9:8 8:7 7:6 6:5 5:4 4:3 3:2 2: : 5:2 3: :8 9:6 7:4 5:2 3: 5:2 4: 3: 2:9 :8 :7 9:6 8:5 7:4 6:3 5:2 4: 3: 2: t (Wire Tracks) 5:8 3:6 :4 9:2 7: 5: 5:8 4:7 3:6 2:5 :4 :3 9:2 8: 7: 6: 5: 4: 5:4:3:2::: 9: 8: 7: 6: 5: 4: 3: 2: : : 5:4:3:2::: 9: 8: 7: 6: 5: 4: 3: 2: : : Page 35
36 Area vs. delay of synthesized adders /9/8 EE46 lass Notes Page 36
37 Summary Adder architectures offer area / power / delay tradeoffs. hoose the best one for your application. /9/8 EE46 lass Notes Page 37
8. Design of Adders. Jacob Abraham. Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017
8. Design of Adders Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017 September 27, 2017 ECE Department, University of Texas at Austin
High Performance Carry Chains for FPGAs
High Performance Carry Chains for FPGAs Matthew M. Hosler Department of Electrical and Computer Engineering Northwestern University Abstract Carry chains are an important consideration for most computations,
Advanced Devices. Registers Counters Multiplexers Decoders Adders. CSC258 Lecture Slides Steve Engels, 2006 Slide 1 of 20
Advanced Devices Using a combination of gates and flip-flops, we can construct more sophisticated logical devices. These devices, while more complex, are still considered fundamental to basic logic design.
SA4NCCP 4-BIT FULL SERIAL ADDER
SA4NCCP 4-BIT FULL SERIAL ADDER CLAUZEL Nicolas PRUVOST Côme SA4NCCP 4-bit serial full adder Table of contents Deeper inside the SA4NCCP architecture...3 SA4NCCP characterization...9 SA4NCCP capabilities...12
Introduction to Digital Logic Missouri S&T University CPE 2210 Exam 3 Logistics
Introduction to Digital Logic Missouri S&T University CPE 2210 Exam 3 Logistics Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and
An Efficient 64-Bit Carry Select Adder With Less Delay And Reduced Area Application
An Efficient 64-Bit Carry Select Adder With Less Delay And Reduced Area Application K Allipeera, M.Tech Student & S Ahmed Basha, Assitant Professor Department of Electronics & Communication Engineering
Principles of Computer Architecture. Appendix A: Digital Logic
A-1 Appendix A - Digital Logic Principles of Computer Architecture Miles Murdocca and Vincent Heuring Appendix A: Digital Logic A-2 Appendix A - Digital Logic Chapter Contents A.1 Introduction A.2 Combinational
Chapter Contents. Appendix A: Digital Logic. Some Definitions
A- Appendix A - Digital Logic A-2 Appendix A - Digital Logic Chapter Contents Principles of Computer Architecture Miles Murdocca and Vincent Heuring Appendix A: Digital Logic A. Introduction A.2 Combinational
ISSN:
427 AN EFFICIENT 64-BIT CARRY SELECT ADDER WITH REDUCED AREA APPLICATION CH PALLAVI 1, VSWATHI 2 1 II MTech, Chadalawada Ramanamma Engg College, Tirupati 2 Assistant Professor, DeptofECE, CREC, Tirupati
Computer Architecture and Organization
A-1 Appendix A - Digital Logic Computer Architecture and Organization Miles Murdocca and Vincent Heuring Appendix A Digital Logic A-2 Appendix A - Digital Logic Chapter Contents A.1 Introduction A.2 Combinational
Midterm Examination II
Midterm Examination II EE 203 - Digital Systems DESIGN (Fall 2015) MEF University Instructions Assigned: 6:30pm on December 17, 2015. Due: 8:00pm on December 17, 2015. Instructor: Şuayb Ş. Arslan. Name:
Logic Design II (17.342) Spring Lecture Outline
Logic Design II (17.342) Spring 2012 Lecture Outline Class # 03 February 09, 2012 Dohn Bowden 1 Today s Lecture Registers and Counters Chapter 12 2 Course Admin 3 Administrative Admin for tonight Syllabus
MODEL QUESTIONS WITH ANSWERS THIRD SEMESTER B.TECH DEGREE EXAMINATION DECEMBER CS 203: Switching Theory and Logic Design. Time: 3 Hrs Marks: 100
MODEL QUESTIONS WITH ANSWERS THIRD SEMESTER B.TECH DEGREE EXAMINATION DECEMBER 2016 CS 203: Switching Theory and Logic Design Time: 3 Hrs Marks: 100 PART A ( Answer All Questions Each carries 3 Marks )
DIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute
DIGITL TECHNICS Dr. álint Pődör Óbuda University, Microelectronics and Technology Institute 10. LECTURE (LOGIC CIRCUITS, PRT 2): MOS DIGITL CIRCUITS II 2016/2017 10. LECTURE: MOS DIGITL CIRCUITS II 1.
EXPERIMENT 13 ITERATIVE CIRCUITS
EE 2449 Experiment 13 Revised 4/17/2017 CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE-246 Digital Logic Lab EXPERIMENT 13 ITERATIVE CIRCUITS Text: Mano, Digital
CSC Computer Architecture and Organization
S 37 - omputer Architecture and Organization Lecture 6: Registers and ounters Registers A register is a group of flip-flops. Each flip-flop stores one bit of data; n flip-flops are required to store n
6.3 Sequential Circuits (plus a few Combinational)
6.3 Sequential Circuits (plus a few Combinational) Logic Gates: Fundamental Building Blocks Introduction to Computer Science Robert Sedgewick and Kevin Wayne Copyright 2005 http://www.cs.princeton.edu/introcs
Logic Design IS1200, spring 2015 Review Slides
2 I2, spring 25 Review lides ssociate Professor, KTH Royal Institute of Technology ssistant Research ngineer, University of alifornia, erkeley genda I lides version. I 3 umber ystems (/3) ecimal and inary
A HIGH SPEED CMOS INCREMENTER/DECREMENTER CIRCUIT WITH REDUCED POWER DELAY PRODUCT
A HIGH SPEED CMOS INCREMENTER/DECREMENTER CIRCUIT WITH REDUCED POWER DELAY PRODUCT P.BALASUBRAMANIAN DR. R.CHINNADURAI Department of Electronics and Communication Engineering National Institute of Technology,
Half-Adders. Ch.5 Summary. Chapter 5. Thomas L. Floyd
Digital Fundamentals: A Systems Approach Functions of Combinational Logic Chapter 5 Half-Adders Basic rules of binary addition are performed by a half adder, which accepts two binary inputs (A and B) and
A Review on Hybrid Adders in VHDL Payal V. Mawale #1, Swapnil Jain *2, Pravin W. Jaronde #3
A Review on Hybrid Adders in VHDL Payal V. Mawale #1, Swapnil Jain *2, Pravin W. Jaronde #3 #1 Electronics & Communication, RTMNU. *2 Electronics & Telecommunication, RTMNU. #3 Electronics & Telecommunication,
Implementation of Low Power and Area Efficient Carry Select Adder
International Journal of Engineering Science Invention ISSN (Online): 2319 6734, ISSN (Print): 2319 6726 Volume 3 Issue 8 ǁ August 2014 ǁ PP.36-48 Implementation of Low Power and Area Efficient Carry Select
FUNCTIONS OF COMBINATIONAL LOGIC
FUNCTIONS OF COMBINATIONAL LOGIC Agenda Adders Comparators Decoders Encoders Multiplexers Demultiplexers Adders Basic Adders Adders are important in computers other types of digital systems in which numerical
EECS 270 Midterm 1 Exam Closed book portion Winter 2017
EES 270 Midterm 1 Exam losed book portion Winter 2017 Name: unique name: Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. NOTES: 1. This part of
Objectives. Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath
Objectives Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath In the previous chapters we have studied how to develop a specification from a given application, and
problem maximum score 1 28pts 2 10pts 3 10pts 4 15pts 5 14pts 6 12pts 7 11pts total 100pts
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS150 J. Wawrzynek Spring 2002 4/5/02 Midterm Exam II Name: Solutions ID number:
Midterm Exam 15 points total. March 28, 2011
Midterm Exam 15 points total March 28, 2011 Part I Analytical Problems 1. (1.5 points) A. Convert to decimal, compare, and arrange in ascending order the following numbers encoded using various binary
CS 61C: Great Ideas in Computer Architecture
CS 6C: Great Ideas in Computer Architecture Combinational and Sequential Logic, Boolean Algebra Instructor: Alan Christopher 7/23/24 Summer 24 -- Lecture #8 Review of Last Lecture OpenMP as simple parallel
Implementation and Analysis of Area Efficient Architectures for CSLA by using CLA
Volume-6, Issue-3, May-June 2016 International Journal of Engineering and Management Research Page Number: 753-757 Implementation and Analysis of Area Efficient Architectures for CSLA by using CLA Anshu
128 BIT CARRY SELECT ADDER USING BINARY TO EXCESS-ONE CONVERTER FOR DELAY REDUCTION AND AREA EFFICIENCY
128 BIT CARRY SELECT ADDER USING BINARY TO EXCESS-ONE CONVERTER FOR DELAY REDUCTION AND AREA EFFICIENCY 1 Mrs.K.K. Varalaxmi, M.Tech, Assoc. Professor, ECE Department, 1varuhello@Gmail.Com 2 Shaik Shamshad
Introduction Actel Logic Modules Xilinx LCA Altera FLEX, Altera MAX Power Dissipation
Outline CPE 528: Session #12 Department of Electrical and Computer Engineering University of Alabama in Huntsville Introduction Actel Logic Modules Xilinx LCA Altera FLEX, Altera MAX Power Dissipation
Agenda. EE 260: Introduction to Digital Design Counters and Registers. Asynchronous (Ripple) Counters. Asynchronous (Ripple) Counters
EE26: igital esign, Spring 28 4/8/8 EE 26: Introduction to igital esign ounters and Registers Yao Zheng epartment of Electrical Engineering University of Hawaiʻi at Mānoa Agenda ounters Introduction: ounters
An optimized implementation of 128 bit carry select adder using binary to excess-one converter for delay reduction and area efficiency
Journal From the SelectedWorks of Journal December, 2014 An optimized implementation of 128 bit carry select adder using binary to excess-one converter for delay reduction and area efficiency P. Manga
CHAPTER 6 ASYNCHRONOUS QUASI DELAY INSENSITIVE TEMPLATES (QDI) BASED VITERBI DECODER
80 CHAPTER 6 ASYNCHRONOUS QUASI DELAY INSENSITIVE TEMPLATES (QDI) BASED VITERBI DECODER 6.1 INTRODUCTION Asynchronous designs are increasingly used to counter the disadvantages of synchronous designs.
1. True/False Questions (10 x 1p each = 10p) (a) I forgot to write down my name and student ID number.
CprE 281: Digital Logic Midterm 2: Friday Oct 30, 2015 Student Name: Student ID Number: Lab Section: Mon 9-12(N) Mon 12-3(P) Mon 5-8(R) Tue 11-2(U) (circle one) Tue 2-5(M) Wed 8-11(J) Wed 6-9(Y) Thur 11-2(Q)
Design and Analysis of Modified Fast Compressors for MAC Unit
Design and Analysis of Modified Fast Compressors for MAC Unit Anusree T U 1, Bonifus P L 2 1 PG Student & Dept. of ECE & Rajagiri School of Engineering & Technology 2 Assistant Professor & Dept. of ECE
CHAPTER 4: Logic Circuits
CHAPTER 4: Logic Circuits II. Sequential Circuits Combinational circuits o The outputs depend only on the current input values o It uses only logic gates, decoders, multiplexers, ALUs Sequential circuits
Combinational Logic Design
Lab #2 Combinational Logic Design Objective: To introduce the design of some fundamental combinational logic building blocks. Preparation: Read the following experiment and complete the circuits where
Counters
Counters A counter is the most versatile and useful subsystems in the digital system. A counter driven by a clock can be used to count the number of clock cycles. Since clock pulses occur at known intervals,
A High-Speed Low-Power Modulo 2 n +1 Multiplier Design Using Carbon-Nanotube Technology
A High-Speed Low-Power Modulo 2 n +1 Multiplier Design Using Carbon-Nanotube Technology A Thesis Presented by He Qi to The Department of Electrical and Computer Engineering in partial fulfillment of the
Computer Organization & Architecture Lecture #5
Computer Organization & Architecture Lecture #5 Shift Register A shift register is a register in which binary data can be stored and then shifted left or right when a shift signal is applied. Bits shifted
gate symbols will appear in schematic Dierent of a circuit. Standard gate symbols have been diagram Figures 5-3 and 5-4 show standard shapes introduce
chapter is concerned with examples of basic This circuits including decoders, combinational xor gate and parity circuits, multiplexers, comparators, adders. Those basic building circuits frequently and
Why FPGAs? FPGA Overview. Why FPGAs?
Transistor-level Logic Circuits Positive Level-sensitive EECS150 - Digital Design Lecture 3 - Field Programmable Gate Arrays (FPGAs) January 28, 2003 John Wawrzynek Transistor Level clk clk clk Positive
REPEAT EXAMINATIONS 2002
REPEAT EXAMINATIONS 2002 EE101 Digital Electronics Solutions Question 1. An engine has 4 fail-safe sensors. The engine should keep running unless any of the following conditions arise: o If sensor 2 is
nmos transistor Basics of VLSI Design and Test Solution: CMOS pmos transistor CMOS Inverter First-Order DC Analysis CMOS Inverter: Transient Response
nmos transistor asics of VLSI Design and Test If the gate is high, the switch is on If the gate is low, the switch is off Mohammad Tehranipoor Drain ECE495/695: Introduction to Hardware Security & Trust
Combinational vs Sequential
Combinational vs Sequential inputs X Combinational Circuits outputs Z A combinational circuit: At any time, outputs depends only on inputs Changing inputs changes outputs No regard for previous inputs
MODULE 3. Combinational & Sequential logic
MODULE 3 Combinational & Sequential logic Combinational Logic Introduction Logic circuit may be classified into two categories. Combinational logic circuits 2. Sequential logic circuits A combinational
Experiment 8 Introduction to Latches and Flip-Flops and registers
Experiment 8 Introduction to Latches and Flip-Flops and registers Introduction: The logic circuits that have been used until now were combinational logic circuits since the output of the device depends
1. Convert the decimal number to binary, octal, and hexadecimal.
1. Convert the decimal number 435.64 to binary, octal, and hexadecimal. 2. Part A. Convert the circuit below into NAND gates. Insert or remove inverters as necessary. Part B. What is the propagation delay
WINTER 15 EXAMINATION Model Answer
Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model answer and the answer written by candidate
DESIGN AND SIMULATION OF A CIRCUIT TO PREDICT AND COMPENSATE PERFORMANCE VARIABILITY IN SUBMICRON CIRCUIT
DESIGN AND SIMULATION OF A CIRCUIT TO PREDICT AND COMPENSATE PERFORMANCE VARIABILITY IN SUBMICRON CIRCUIT Sripriya. B.R, Student of M.tech, Dept of ECE, SJB Institute of Technology, Bangalore Dr. Nataraj.
COMPUTATIONAL REDUCTION LOGIC FOR ADDERS
COMPUTATIONAL REDUCTION LOGIC FOR ADDERS 1 R. Shanmukha Sandeep, 1 P.V. Anusha Unni, 2 M. Siva Kumar, 2 Syed Inthiyaz 1 shanmuksandeep@gmail.com, 1 anushaunni.auau@gmail.com, 2 siva4580@kluniversity.in,
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Introductory Digital Systems Laboratory
Problem Set Issued: March 3, 2006 Problem Set Due: March 15, 2006 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.111 Introductory Digital Systems Laboratory
Design for Test. Design for test (DFT) refers to those design techniques that make test generation and test application cost-effective.
Design for Test Definition: Design for test (DFT) refers to those design techniques that make test generation and test application cost-effective. Types: Design for Testability Enhanced access Built-In
EEC 116 Fall 2011 Lab #5: Pipelined 32b Adder
EEC 116 Fall 2011 Lab #5: Pipelined 32b Adder Dept. of Electrical and Computer Engineering University of California, Davis Issued: November 2, 2011 Due: November 16, 2011, 4PM Reading: Rabaey Sections
12-bit Wallace Tree Multiplier CMPEN 411 Final Report Matthew Poremba 5/1/2009
12-bit Wallace Tree Multiplier CMPEN 411 Final Report Matthew Poremba 5/1/2009 Project Overview This project was originally titled Fast Fourier Transform Unit, but due to space and time constraints, the
CHAPTER 4: Logic Circuits
CHAPTER 4: Logic Circuits II. Sequential Circuits Combinational circuits o The outputs depend only on the current input values o It uses only logic gates, decoders, multiplexers, ALUs Sequential circuits
Chapter 5 Sequential Circuits
Logic and Computer Design Fundamentals Chapter 5 Sequential Circuits Part 2 Sequential Circuit Design Charles Kime & Thomas Kaminski 28 Pearson Education, Inc. (Hyperlinks are active in View Show mode)
COE 202: Digital Logic Design Sequential Circuits Part 1. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
COE 202: Digital Logic Design Sequential Circuits Part 1 Dr. Ahmad Almulhem Email: ahmadsm AT kfupm Phone: 860-7554 Office: 22-324 Objectives Sequential Circuits Memory Elements Latches Flip-Flops Combinational
GUJARAT TECHNOLOGICAL UNIVERSITY, AHMEDABAD, GUJARAT COURSE CURRICULUM COURSE TITLE: VLSI (COURSE CODE: )
LSI Course Code 3361104 GUJARAT TECHNOLOGICAL UNIERSITY, AHMEDABAD, GUJARAT COURSE CURRICULUM COURSE TITLE: LSI (COURSE CODE:3361103) Diploma Programme in which this course is offered Semester in which
Logic and Computer Design Fundamentals. Chapter 7. Registers and Counters
Logic and Computer Design Fundamentals Chapter 7 Registers and Counters Registers Register a collection of binary storage elements In theory, a register is sequential logic which can be defined by a state
Reconfigurable Architectures. Greg Stitt ECE Department University of Florida
Reconfigurable Architectures Greg Stitt ECE Department University of Florida How can hardware be reconfigurable? Problem: Can t change fabricated chip ASICs are fixed Solution: Create components that can
Computer Systems Architecture
Computer Systems Architecture Fundamentals Of Digital Logic 1 Our Goal Understand Fundamentals and basics Concepts How computers work at the lowest level Avoid whenever possible Complexity Implementation
EECS 270 Midterm Exam Spring 2011
EES 270 Midterm Exam Spring 2011 Name: unique name: Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. Scores: Page # Points 2 /15 3 /10 4 /6 5 /12
Microprocessor Design
Microprocessor Design Principles and Practices With VHDL Enoch O. Hwang Brooks / Cole 2004 To my wife and children Windy, Jonathan and Michelle Contents 1. Designing a Microprocessor... 2 1.1 Overview
Design of a Low Power Four-Bit Binary Counter Using Enhancement Type Mosfet
Design of a Low Power Four-Bit Binary Counter Using Enhancement Type Mosfet Praween Sinha Department of Electronics & Communication Engineering Maharaja Agrasen Institute Of Technology, Rohini sector -22,
Jin-Fu Li Advanced Reliable Systems (ARES) Laboratory. National Central University
Chapter 3 Basics of VLSI Testing (2) Jin-Fu Li Advanced Reliable Systems (ARES) Laboratory Department of Electrical Engineering National Central University Jhongli, Taiwan Outline Testing Process Fault
Sequential Circuits: Latches & Flip-Flops
Sequential Circuits: Latches & Flip-Flops Overview Storage Elements Latches SR, JK, D, and T Characteristic Tables, Characteristic Equations, Eecution Tables, and State Diagrams Standard Symbols Flip-Flops
128 BIT MODIFIED CARRY SELECT ADDER USING BINARY TO EXCESS-ONE CONVERTER
128 BIT MODIFIED CARRY SELECT ADDER USING BINARY TO EXCESS-ONE CONVERTER M.Srinivasaperumal 1, S.Pavithra 2, V.S.Kavya Lekshmi 3, K.MohammedArshad 4 1,2,3,4 Dept. of ECE, SNS College of Technology Coimbatore,(
TYPICAL QUESTIONS & ANSWERS
DIGITALS ELECTRONICS TYPICAL QUESTIONS & ANSWERS OBJECTIVE TYPE QUESTIONS Each Question carries 2 marks. Choose correct or the best alternative in the following: Q.1 The NAND gate output will be low if
IN DIGITAL transmission systems, there are always scramblers
558 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 53, NO. 7, JULY 2006 Parallel Scrambler for High-Speed Applications Chih-Hsien Lin, Chih-Ning Chen, You-Jiun Wang, Ju-Yuan Hsiao,
Chapter 3. Boolean Algebra and Digital Logic
Chapter 3 Boolean Algebra and Digital Logic Chapter 3 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple logic circuits. Understand how
Chapter 6 Registers and Counters
EEA051 - Digital Logic 數位邏輯 Chapter 6 Registers and Counters 吳俊興國立高雄大學資訊工程學系 January 2006 Chapter 6 Registers and Counters 6-1 Registers 6-2 Shift Registers 6-3 Ripple Counters 6-4 Synchronous Counters
Design and Implementation of Low-Power and Area-Efficient for Carry Select Adder (Csla)
Design and Implementation of Low-Power and Area-Efficient for Carry Select Adder (Csla) M.Deepika Department of the Electronics and Communication Engineering, NITS, Hyderabad, AP, India. K.Srinivasa Reddy
Outline. CPE/EE 422/522 Advanced Logic Design L04. Review: 8421 BCD to Excess3 BCD Code Converter. Review: Mealy Sequential Networks
Outline PE/EE 422/522 Advanced Logic Design L4 Electrical and omputer Engineering University of Alabama in Huntsville What we know ombinational Networks Analysis, Synthesis, Simplification, Hazards, Building
11. Sequential Elements
11. Sequential Elements Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017 October 11, 2017 ECE Department, University of Texas at Austin
R13 SET - 1 '' ''' '' ' '''' Code No: RT21053
SET - 1 1. a) What are the characteristics of 2 s complement numbers? b) State the purpose of reducing the switching functions to minimal form. c) Define half adder. d) What are the basic operations in
Digital Circuits I and II Nov. 17, 1999
Physics 623 Digital Circuits I and II Nov. 17, 1999 Digital Circuits I 1 Purpose To introduce the basic principles of digital circuitry. To understand the small signal response of various gates and circuits
Electrical & Computer Engineering ECE 491. Introduction to VLSI. Report 1
Electrical & Computer Engineering ECE 491 Introduction to VLSI Report 1 Marva` Morrow INTRODUCTION Flip-flops are synchronous bistable devices (multivibrator) that operate as memory elements. A bistable
Digital Circuits 4: Sequential Circuits
Digital Circuits 4: Sequential Circuits Created by Dave Astels Last updated on 2018-04-20 07:42:42 PM UTC Guide Contents Guide Contents Overview Sequential Circuits Onward Flip-Flops R-S Flip Flop Level
Decade Counters Mod-5 counter: Decade Counter:
Decade Counters We can design a decade counter using cascade of mod-5 and mod-2 counters. Mod-2 counter is just a single flip-flop with the two stable states as 0 and 1. Mod-5 counter: A typical mod-5
Synchronous Digital Logic Systems. Review of Digital Logic. Philosophy. Combinational Logic. A Full Adder. Combinational Logic
Synchronous igital Logic Systems Review of igital Logic Prof. Stephen. Edwards Raw materials: MOS transistors and wires on Is Wires are excellent conveyors of voltage Little leakage Fast, but not instantaneous
Chapter 8 Functions of Combinational Logic
ETEC 23 Programmable Logic Devices Chapter 8 Functions of Combinational Logic Shawnee State University Department of Industrial and Engineering Technologies Copyright 27 by Janna B. Gallaher Basic Adders
Solution to Digital Logic )What is the magnitude comparator? Design a logic circuit for 4 bit magnitude comparator and explain it,
Solution to Digital Logic -2067 Solution to digital logic 2067 1.)What is the magnitude comparator? Design a logic circuit for 4 bit magnitude comparator and explain it, A Magnitude comparator is a combinational
Long and Fast Up/Down Counters Pushpinder Kaur CHOUHAN 6 th Jan, 2003
1 Introduction Long and Fast Up/Down Counters Pushpinder Kaur CHOUHAN 6 th Jan, 2003 Circuits for counting both forward and backward events are frequently used in computers and other digital systems. Digital
Part 4: Introduction to Sequential Logic. Basic Sequential structure. Positive-edge-triggered D flip-flop. Flip-flops classified by inputs
Part 4: Introduction to Sequential Logic Basic Sequential structure There are two kinds of components in a sequential circuit: () combinational blocks (2) storage elements Combinational blocks provide
Registers and Counters
Registers and Counters A register is a group of flip-flops which share a common clock An n-bit register consists of a group of n flip-flops capable of storing n bits of binary information May have combinational
Pak. J. Biotechnol. Vol. 14 (Special Issue II) Pp (2017) Parjoona V. and P. Manimegalai
ANALYSIS OF AREA DELAY OPTIMIZATION OF IMPROVED SPARSE CHANNEL ADDER Prajoona Valsalan,2 and P. Manimegalai 2 2 Karpagam University, Coimbatore, Tamil Nadu, India. Dhofar University, Salalah, Sultanate
AN INTRODUCTION TO DIGITAL COMPUTER LOGIC
SUPPLEMENTRY HPTER 1 N INTRODUTION TO DIGITL OMPUTER LOGI J K J K FREE OMPUTER HIPS FREE HOOLTE HIPS I keep telling you Gwendolyth, you ll never attract today s kids that way. S1.0 INTRODUTION 1 2 Many
R13. II B. Tech I Semester Regular Examinations, Jan DIGITAL LOGIC DESIGN (Com. to CSE, IT) PART-A
SET - 1 Note: Question Paper consists of two parts (Part-A and Part-B) Answer ALL the question in Part-A Answer any THREE Questions from Part-B a) What are the characteristics of 2 s complement numbers?
A Review of logic design
Chapter 1 A Review of logic design 1.1 Boolean Algebra Despite the complexity of modern-day digital circuits, the fundamental principles upon which they are based are surprisingly simple. Boolean Algebra
Sequential logic. Circuits with feedback. How to control feedback? Sequential circuits. Timing methodologies. Basic registers
equential logic equential circuits simple circuits with feedback latches edge-triggered flip-flops Timing methodologies cascading flip-flops for proper operation clock skew Basic registers shift registers
Notes on Digital Circuits
PHYS 331: Junior Physics Laboratory I Notes on Digital Circuits Digital circuits are collections of devices that perform logical operations on two logical states, represented by voltage levels. Standard
Registers, Register Transfers and Counters Dr. Fethullah Karabiber
36 OMPUTER HARWARE Registers, Register Transfers and ounters r. Fethullah Karabiber Overview 2 Registers, Microoperations and Implementations Registers and load enable Register transfer operations Microoperations
ECE 3401 Lecture 12. Sequential Circuits (II)
EE 34 Lecture 2 Sequential ircuits (II) Overview of Sequential ircuits Storage Elements Sequential circuits Storage elements: Latches & Flip-flops Registers and counters ircuit and System Timing Sequential
EEC 118 Lecture #9: Sequential Logic. Rajeevan Amirtharajah University of California, Davis Jeff Parkhurst Intel Corporation
EEC 118 Lecture #9: Sequential Logic Rajeevan Amirtharajah University of California, Davis Jeff Parkhurst Intel Corporation Outline Review: Static CMOS Logic Finish Static CMOS transient analysis Sequential
Chapter 3 Unit Combinational
EE 200: Digital Logic Circuit Design Dr Radwan E Abdel-Aal, COE Logic and Computer Design Fundamentals Chapter 3 Unit Combinational 5 Registers Logic and Design Counters Part Implementation Technology
DESIGN OF HIGH PERFORMANCE, AREA EFFICIENT FIR FILTER USING CARRY SELECT ADDER
DESIGN OF HIGH PERFORMANCE, AREA EFFICIENT FIR FILTER USING CARRY SELECT ADDER G. Vijayalakshmi, A. Nithyalakshmi, J. Priyadarshini Assistant Professor, ECE, Prince Shri Venkateshwara Padmavathy Engg College,
Chapter 6. sequential logic design. This is the beginning of the second part of this course, sequential logic.
Chapter 6. sequential logic design This is the beginning of the second part of this course, sequential logic. equential logic equential circuits simple circuits with feedback latches edge-triggered flip-flops
Registers & Counters. Logic and Digital System Design - CS 303 Erkay Savaş Sabanci University
Registers & ounters Logic and igital System esign - S 33 Erkay Savaş Sabanci University Registers Registers like counters are clocked sequential circuits A register is a group of flip-flops Each flip-flop