Combinational Circuits

Slides:



Advertisements
Similar presentations
Part 4: combinational devices
Advertisements

Kuliah Rangkaian Digital Kuliah 7: Unit Aritmatika
Modular Combinational Logic
Lab 10 : Arithmetic Systems : Adder System Layout: Slide #2 Slide #3 Slide #4 Slide #5 Arithmetic Overflow: 2’s Complement Conversions: 8 Bit Adder/Subtractor.
Mohamed Younis CMCS 411, Computer Architecture 1 CMCS Computer Architecture Lecture 7 Arithmetic Logic Unit February 19,
1 ALUs. 2 Topics: ALU Overview - core of the integer datapath - 2 operands, 32-bits wide, plus control signals Exercise: A simple multiplier.
Computer Structure - The ALU Goal: Build an ALU  The Arithmetic Logic Unit or ALU is the device that performs arithmetic and logical operations in the.
Lecture 8 Arithmetic Logic Circuits
Homework Reading Machine Projects Labs
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
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.
CS1Q Computer Systems Lecture 9 Simon Gay. Lecture 9CS1Q Computer Systems - Simon Gay2 Addition We want to be able to do arithmetic on computers and therefore.
Using building blocks to make bigger circuits
Copyright 1995 by Coherence LTD., all rights reserved (Revised: Oct 97 by Rafi Lohev, Oct 99 by Yair Wiseman, Sep 04 Oren Kapah) IBM י ב מ 10-1 The ALU.
Computer Organization & Programming Chapter4 Combinatorial Components.
Chapter 6-1 ALU, Adder and Subtractor
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Adders, subtractors, ALUs.
HCL and ALU תרגול 10. Overview of Logic Design Fundamental Hardware Requirements – Communication: How to get values from one place to another – Computation.
ECEN 248 Lab 4: Multiplexer Based Arithmetic Logic Unit
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices X-OR gates and Parity circuits Comparators Adders, subtractors,
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
CDA 3101 Fall 2013 Introduction to Computer Organization The Arithmetic Logic Unit (ALU) and MIPS ALU Support 20 September 2013.
Lecture 18: Hardware for Arithmetic Today’s topic –Intro to Boolean functions (Continued) –Designing an ALU 1.
Half Adder & Full Adder Patrick Marshall. Intro Adding binary digits Half adder Full adder Parallel adder (ripple carry) Arithmetic overflow.
Universal college of engineering & technology. .By Harsh Patel)
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
B1000 ALU ENGR xD52 Eric VanWyk Fall Today Review Timing with Adders Construct Adder/Subtractor Construct ALU.
1 Fundamentals of Computer Science Combinational Circuits.
Gates AND, OR, NOT NAND, NOR Combinational logic No memory A set of inputs uniquely and unambiguously specifies.
Lecture #23: Arithmetic Circuits-1 Arithmetic Circuits (Part I) Randy H. Katz University of California, Berkeley Fall 2005.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices Adders,subtractors, ALUs.
President UniversityErwin SitompulDigital Systems 7/1 Lecture 7 Digital Systems Dr.-Ing. Erwin Sitompul President University
Discrete Systems I Lecture 10 Adder and ALU Profs. Koike and Yukita.
1 The ALU l ALU includes combinational logic. –Combinational logic  a change in inputs directly causes a change in output, after a characteristic delay.
Explain Half Adder and Full Adder with Truth Table.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
B0111 ALU ENGR xD52 Eric VanWyk Fall Today Review Timing with Adders Construct Adder/Subtractor Compare Growth Characteristics Construct ALU.
B0110 ALU ENGR xD52 Eric VanWyk Fall Today Back to Gates! Review Timing with Adders Compare Growth Characteristics Construct Adder/Subtractor Construct.
Combinational Circuits
Prof. Sin-Min Lee Department of Computer Science
ECE 3130 Digital Electronics and Design
Lecture 11: Hardware for Arithmetic
Computer Science 210 Computer Organization
Homework Reading Machine Projects Labs
Digital Systems Section 8 Multiplexers. Digital Systems Section 8 Multiplexers.
Combinational Logic Circuits
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.
EEL 3705 / 3705L Digital Logic Design
Basics Combinational Circuits Sequential Circuits Ahmad Jawdat
5. Combinational circuits
CSE Winter 2001 – Arithmetic Unit - 1
minecraft.gamepedia.com/Tutorials/Basic_Logic_Gates
Arithmetic Circuits (Part I) Randy H
Lecture 11: Hardware for Arithmetic
COSC 2021: Computer Organization Instructor: Dr. Amir Asif
robosavvy.com/forum/viewtopic.php?p=32542
By: A. H. Abdul Hafez CAO, by Dr. A.H. Abdul Hafez, CE Dept. HKU
Homework Reading Machine Projects Labs
Part III The Arithmetic/Logic Unit
COMS 361 Computer Organization
Instructor: Mozafar Bag-Mohammadi University of Ilam
Logic Circuits I Lecture 3.
ECE 352 Digital System Fundamentals
Instruction execution and ALU
Lecture 3 Combinational units. Adders
Presentation transcript:

Combinational Circuits

Decoder Decoder : Takes n inputs Selects one of 2n output lines

Truth Table Expression for each output has one term O0 = I1' I0' O1 = I1 I0' O2 = I1' I0 O3 = I1 I0

Decoder Implementation O0 = I1' I0' O1 = I1 I0' O2 = I1' I0 O3 = I1 I0

Sample Use 3  8 decoder used to pick instruction

Multiplexer Multiplexer : 2 input multiplexer 4 input multiplexer N data lines lines Log2(N) select lines 2 input multiplexer 4 input multiplexer

Decode to Mux Multiplexer selection logic = decoder 4 input multiplexer

Shifter 1 bit shifter D4 goes to either S3 or S5

Shifter 1 bit shifter If C = 1, goes to S5

Shifter 1 bit shifter If C = 0, goes to S3

Shifter S = direction 0: left, 1: right Logical shift: Left bit always 0 on right shift

Multibit Shift 4 bit wide 0-3bit shift S selects direction Multiplexers select correct pattern

Half Adder Half Adder : adds A + B, produce sum + carry 1 1 1

Half Adder Truth Table Inputs a & b Carry : c Sum : s

First Pass

XOR Function XOR gate : exclusive OR Notation: A  B OR A ^ B AB' + A'B Notation: A  B OR A ^ B

Using XOR Half Adder Final

Full Adder 1 1 1 Full Adder handles carry in Three inputs: Cin, A, B Two out: Cout, S 1 1 1

Full Adder Circuit Made from two half adders Add A & B Add sum to carry

Full Adder Abstracted

Ripple Carry Adder Multibit adder : string of 1 bit full adders

Ripple Carry Adder Implemented with carry out & signed overflow:

Ripple Carry Adder Adding subtraction to adder Select line 0 : Normal 1 : Invert one pattern, add extra 1 via carry

Ripple Carry Adder Fun Fact Carry signal needs to propagate from one adder to next 3 gates delay per bit

Carry Select Fun Fact Cary Select Adder Calculate second block with both 0 and 1 carry Work in parallel with first Pick right answer when carry available

ALU ALU : Arithmetic Logic Unit In: Out: 2 Operands Control signal Result based on select operation

ALU Harware to implement each desired op Multiplexor to select desired one

1-Bit Simple ALU Processes two 1-bit inputs A, B 3 functions: AND (0), OR (1), Add (2) Selected with function select bits

1-Bit Simple ALU With selector to invert B input Can now also compute: A OR ~B A AND ~B A + ~B

4-Bit Simple ALU Four 1-bit ALU's chained together

4-Bit Simple ALU AddOne allows for A + (~B) + 1 == A + (~B + 1) == A + (-B) == A - B