Cs 121 Ch 4-2 Combinational Logic

Slides:



Advertisements
Similar presentations
Abdullah Said Alkalbani University of Buraimi
Advertisements

Discrete Mathematical Structures: Theory and Applications
Topics Adders Half Adder Full Adder Subtracter Half Subtracter
ADDER, HALF ADDER & FULL ADDER
Adders and Subtractors
Adders Module M8.1 Section 6.2. Adders Half Adder Full Adder TTL Adder.
1 The 2-to-4 decoder is a block which decodes the 2-bit binary inputs and produces four output All but one outputs are zero One output corresponding to.
Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.
Cs 1110 Ch 4-1 Combinational Logic. ° Introduction Logic circuits for digital systems may be: °2°2 combinational sequential OR A combinational circuit.
Combinational Circuits. Analysis Diagram Designing Combinational Circuits In general we have to do following steps: 1. Problem description 2. Input/output.
DPSD This PPT Credits to : Ms. Elakya - AP / ECE.
Subtractors Module M8.2 Section 6.2. Subtractors Half Subtractor Full Subtractor Adder/Subtractor - 1 Adder/Subtractor - 2.
Binary Subtraction Section 3-9 Mano & Kime. Binary Subtraction Review from CSE 171 Two’s Complement Negative Numbers Binary Adder-Subtractors 4-bit Adder/Subtractor.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
Design of Arithmetic Circuits – Adders, Subtractors, BCD adders
XMLDTD Transparency No. 1 Java Programming assignment 1 Cheng-Chia Chen.
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
ENGIN112 L14: Binary Adder Subtractor October 3, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 14 Binary Adders and Subtractors.
Adders.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Adders, subtractors, ALUs
©2008 The McGraw-Hill Companies, Inc. All rights reserved. Digital Electronics Principles & Applications Seventh Edition Chapter 10 Arithmetic Circuits.
 Arithmetic circuit  Addition  Subtraction  Division  Multiplication.
CS 105 Digital Logic Design
CENG 241 Digital Design 1 Lecture 5
XOR, XNOR, and Binary Adders
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
Combinational and Sequential Logic Circuits.
+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.
Chapter 3 Combinational Design Digital Logic Design III
ADDERS Half Adders Recall that the basic rules of binary addition are as indicated below in Table 2-9. A circuit known as the half-adder carries out these.
1 Adders & Subtractors Adders –An adder is a combinational logic circuit that performs the addition of 2 binary numbers (A & B) to generate the sum (S)
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Adders, subtractors, ALUs.
Logic Gates Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding.
COE 202: Digital Logic Design Combinational Circuits Part 2 KFUPM Courtesy of Dr. Ahmad Almulhem.
Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.
ARITHMETIC MICRO OPERATIONS
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
ECE 320 Homework #4 1. Using 8 data input selector logic (MUX), implement the following two functions: a) F(A,B,C)=S 0 S 2 S 3 S 5 b) F(A,B,C,D)=P 0 +P.
1 Lecture 14 Binary Adders and Subtractors. 2 Overview °Addition and subtraction of binary data is fundamental Need to determine hardware implementation.
Multiplexers & Decoders By: Jason Pitts CS 147 Spring 2010.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices Adders,subtractors, ALUs.
Designing Combinational Logic Circuits in Verilog - 1
Combinational Circuits
ECE 4110– Sequential Logic Design
Multiplexer.
Part 4 Combinational Logic.
Combinational Circuit Design
Combinational Circuits
Reference: Moris Mano 4th Edition Chapter 4
Principles & Applications
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
Combinational Circuits
FIGURE 4.1 Block diagram of combinational circuit
Digital Logic.
Number Systems and Circuits for Addition
Adders and Subtractors
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
Chapter 10.3 and 10.4: Combinatorial Circuits
Chapter-4 Combinational Logic
XOR Function Logic Symbol  Description  Truth Table 
LOGIC Circuits.
Adder Circuits By: Asst Lec. Basma Nazar
Adder and Subtractors Discussion D4.1. Adder and Subtractor Circuits Objective: (i) To construct half and full adder circuit and verify its working (ii)
Half & Full Subtractor Half Subtractor Full Subtractor.
Carryout bit? Carryout bit is ‘1’ also on four cases. When a, b and carryin are 110, 101, 011, 111. Does it mean that we need a similar circuit as sum?
Half & Full Subtractor Half Subtractor Full Subtractor.
Unit IV Adders Subtractors Flip Flops Counters Multiplexes and De multiplexes. Integrated circuits-Op. amp – Characteristics Inverting amplifier - Non-inverting.
Presentation transcript:

Cs 121 Ch 4-2 Combinational Logic Give qualifications of instructors: DAP teaching computer architecture at Berkeley since 1977 Co-athor of textbook used in class Best known for being one of pioneers of RISC currently author of article on future of microprocessors in SciAm Sept 1995 RY took 152 as student, TAed 152,instructor in 152 undergrad and grad work at Berkeley joined NextGen to design fact 80x86 microprocessors one of architects of UltraSPARC fastest SPARC mper shipping this Fall

Subtractors Half Subtractor Full Subtractor credential: bring a computer die photo wafer : This can be an hidden slide. I just want to use this to do my own planning. I have rearranged Culler’s lecture slides slightly and add more slides. This covers everything he covers in his first lecture (and more) but may We will save the fun part, “ Levels of Organization,” at the end (so student can stay awake): I will show the internal stricture of the SS10/20. Notes to Patterson: You may want to edit the slides in your section or add extra slides to taylor your needs.

QUIZ Subtract binary number 11 from 1010 01 10 1 1 1 0 1 0 - 1 1 1 1 1

1 2 -1 1 Half Subtractor Subtract two binary numbers 0 0 0 0 0 1 1 1 Half-Subtractor (HS), a 2-input bit-wise Subtractor functional block. Subtract two binary numbers A0 , B0 -> single bit inputs D0 -> single bit difference Bo -> Borrow out A B D B Block diagram o 0 0 0 0 0 1 1 1 1 0 1 0 1 1 0 0 A B D o (difference) 1 2 (borrow out) -1 1 Circuit diagram

Logic Simplification: Half Subtractor The K-Map for Do, Bo is: B A 1 3 2 Do Bo B A Do Å = × + A B A Bo × = A B D o (difference) (borrow out)

QUIZ ? Q#1- What is the difference and borrow outputs from This half-subtractor circuit? Q#2- What is the difference and borrow outputs from this half-subtractor circuit? Q#3- What is the difference and borrow outputs from this half-subtractor circuit? Q#4- What is the difference and borrow outputs from this half-subtractor circuit? ANS: Di= 0, Bo= 0 ANS: Di= 1, Bo= 0 ANS: Di= 0, Bo= 0 ANS: Di= 1, Bo= 1 (A – B) A = 0 B = 0 (A – B) A = 1 B = 0 (A – B) A = 1 B = 1 (A – B) A = 0 B = 1 ?

Di Same as Si in full adder Full Subtractor Bin Ai Bi Di Bo Bin AiBi Full-Subtractor (FS), a 3-input bit-wise Subtractor functional block Bin Ai Bi Di Bo Bin AiBi 00 01 11 10 1 0 0 0 0 0 0 0 1 1 1 0 1 0 1 0 0 1 1 0 0 1 0 0 1 1 1 0 1 0 1 1 1 0 0 0 1 1 1 1 1 1 1 1 1 Di We going to use Ci as Bin Ci+1 as Bo Di = Ci Å (Ai Å Bi) Same as Si in full adder Note: 3 inputs

Ci+1 Full Subtractor Ci AiBi 00 01 11 10 1 Ci Ai Bi Di Ci+1 0 0 0 0 0 Now consider implementation of Borrow out Ci+1 Remember Two outputs per full Subtractor bit (Ci+1, Si) Ci AiBi 00 01 11 10 1 Ci Ai Bi Di Ci+1 0 0 0 0 0 0 0 1 1 1 0 1 0 1 0 0 1 1 0 0 1 0 0 1 1 1 0 1 0 1 1 1 0 0 0 1 1 1 1 1 1 1 1 1 Ci+1 Ci+1 = !Ai Bi + !Ai !Bi + Ci Ai Bi Note: 3 inputs Note: 2 out- puts

Recall: Full Subtractor Ci+1 = !Ai Bi +Ci !Ai !Bi +Ci Ai Bi + Ci(!Ai !Bi + Ai Bi) Ci+1 = !Ai Bi + Ci !(Ai Å Bi) Recall: Di = Ci Å (Ai Å Bi) Ci+1 = !Ai Bi +Ci !(Ai Å Bi)

half subtractor Full Subtractor Di = Ci Å (Ai Å Bi) Ci+1 = !Ai Bi + Ci !(Ai Å Bi) half subtractor

QUIZ ? Q#1- What are the Difference and Borrow out output from this full-subtractor circuit? Q#2- What are the Difference and Borrow out output from this full-subtractor circuit? Q#3- What are the Difference and Borrow out output from this full-subtractor circuit? Q#4- What are the Difference and Borrow out output from this full-subtractor circuit? Q#5- What are the Difference and Borrow out output from this full-subtractor circuit? Q#6- What are the Difference and Borrow out output from this full-subtractor circuit? ANSWER: Di = 0, Bo = 0 ANSWER: Di = 1, Bo = 1 ANSWER: Di = 1, Bo = 1 ANSWER: Di = 0, Bo = 1 ANSWER: Di = 1, Bo = 0 ANSWER: Di = 0, Bo = 0 (A – B - Bin) Bin = 0 A = 0 B = 0 (A – B - Bin) Bin = 1 A = 0 B = 0 ? (A – B - Bin) Bin = 1 A = 1 B = 1 (A – B - Bin) Bin = 1 A = 0 B = 1 (A – B - Bin) Bin = 0 A = 1 B = 0 (A – B - Bin) Bin = 0 A = 1 B = 1