Computer Organization & Programming Chapter4 Combinatorial Components.

Slides:



Advertisements
Similar presentations
ADDER, HALF ADDER & FULL ADDER
Advertisements

Modular Combinational Logic
Combinational Circuits
Decoders/DeMUXs CS370 – Spring Decoder: single data input, n control inputs, 2 outputs control inputs (called select S) represent Binary index of.
Chapter 9 Computer Design Basics. 9-2 Datapaths Reminding A digital system (or a simple computer) contains datapath unit and control unit. Datapath: A.
1 Tutorial: ITI1100 Dewan Tanvir Ahmed SITE, UofO.
Fall 2005 L15: Combinational Circuits Lecture 15: Combinational Circuits Complete logic functions Some combinational logic functions –Half adders –Adders.
Fall 2007 L15: Combinational Circuits Lecture 15: Combinational Circuits Complete logic functions Some combinational logic functions –Half adders –Adders.
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Combinatorial Logic Design Process. Example: Three 1s pattern detector Detect whether a pattern of at least three adjacent 1s occurs anywhere in an 8-bit.
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.
Comparators  A comparator compares two input words.  The following slide shows a simple comparator which takes two inputs, A, and B, each of length 4.
CS 105 Digital Logic Design
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Building Functions.
9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexers.
CPSC 171 Introduction to Computer Science Boolean Logic, Gates, & Circuits.
CS 1308 – Computer Literacy and the Internet. It’s Not Magic  The goal of the next series of lectures is to show you exactly how a computer works. 
Outline Analysis of Combinational Circuits Signed Number Arithmetic
Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
ECE 3130 – Digital Electronics and Design
School of Computer Science G51CSA 1 Computer Systems Architecture Fundamentals Of Digital Logic.
Digital Components and Combinational Circuits Sachin Kharady.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
ECEN 248 Lab 4: Multiplexer Based Arithmetic Logic Unit
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
Computer Science 101 Circuit Design - Examples. Sum of Products Algorithm Identify each row of the output that has a 1. Identify each row of the output.
מבנה מחשב תרגול 2. 2 Boolean AND Operation Truth Table Equivalent Gate Different notations:
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
Universal college of engineering & technology. .By Harsh Patel)
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Computer Science 210 Computer Organization Control Circuits Decoders and Multiplexers.
CS 1308 – Computer Literacy and the Internet Building the CPU.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Complex Combinational Logic Blocks ECE/CS 252, Fall 2010 Prof.
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 Fundamentals of Computer Science Combinational Circuits.
Combinational Circuit Design. Digital Circuits Combinational CircuitsSequential Circuits Output is determined by current values of inputs only. Output.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Multiplexers.
Arithmetic Logic Unit (ALU) Introduction to Computer Yung-Yu Chuang with slides by Sedgewick & Wayne ( introcs.cs.princeton.edu ), Nisan & Schocken (
Chapter 3 Digital Logic Structures
Appendix B: Digital Logic
Digital Design Lecture 8 Combinatorial Logic (Continued)
Simple ALU  Half adder  Full adder  Constructing 4 bits adder  ALU does several operations  General ALU structure  Timing diagram of adder  Overflow.
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
Mu.com.lec 11.  Used not only to perform addition but also to perform subtraction, multiplication and division  The most basic of the adders is the.
Arithmetic Circuits I. 2 Iterative Combinational Circuits Like a hierachy, except functional blocks per bit.
Combinational Circuits
ECE 3130 Digital Electronics and Design
ECE 3130 Digital Electronics and Design
Computer Science 210 Computer Organization
More Devices: Control (Making Choices)
Homework Reading Machine Projects Labs
Computer Science 210 Computer Organization
5. Combinational circuits
CSE Winter 2001 – Arithmetic Unit - 1
FIGURE 4.1 Block diagram of combinational circuit
HALF ADDER FULL ADDER Half Subtractor.
Week 7: Gates and Circuits: PART II
Number Systems and Circuits for Addition
Homework Reading Machine Projects Labs
COMS 361 Computer Organization
Logic Circuits I Lecture 3.
Combinational Circuits
Electronics for Physicists
Arithmetic Circuits.
ECE2030 HW-6.
Lecture 3 Combinational units. Adders
Presentation transcript:

Computer Organization & Programming Chapter4 Combinatorial Components

Some common, useful combinatorial circuits Multiplexor Some number (power of 2) of inputs and some control inputs The current values on the control lines are interpreted as a binary representation of the number of one of the other inputs. That input is passed through to the output. Demultiplexor Reverse of the multiplexor Single input is routed to one of a number (power of 2) output lines, depending on the control lines. Decoder Takes an n-bit input number and uses it to select exactly one of 2 n output lines note difference between demultiplexor and decoder The selected output line will have a 1, not a selected input value. Comparator outputs a 1 if two input values are equal, 0 otherwise

Comparator All the As represent one input word, all the Bs represent another input word. The output will be one only if the two inputs are the same

Mux (multiplexer) 2 -> 1

Mux 2 -> 1 implementation

Mux 4 -> 1

Mux 8 -> 1 Abstract representation of a multiplexor. The circuit details are hidden, but the essentials are visible.

Implement a Boolean Function using Mux

Decoder 3->8

Decoder circuit

Decoder 4 -> 16

Implement a Boolean Function using Decoder

Shifter C determines if the shift will be left or right. Assume D = Show exactly what passes through each gate, and what ends up in S.

Half Adder Called a half adder because it does not do the whole job: it does not add a carry in.

Full Adder

Example – 4bit Adder

Example – 4bit Adder/Subtractor

ALU Slice

1bit ALU What happens if F= 11, A=1, B=1, carry in = 1 What happens if F= 10, A=1, B=1, carry in = 1 Note INVA (Inverse A), ENA (Enable A), ENB (Enable B) Once we have the circuit understood, note the inputs and the outputs. We can hide the rest of the details in using this device.

8Bit ALU

Overflow

ALU with overflow detection