Multiplexers 1 The output is equal to one of several input signals to the circuit The multiplexer selects which input signal to use as an output signal.

Slides:



Advertisements
Similar presentations
Chapter 4 Gates and Circuits.
Advertisements

Chapter 4 Gates and Circuits Nell Dale • John Lewis.
Chapter 4 Gates and Circuits.
Gates and Circuits Nell Dale & John Lewis (adaptation by Erin Chambers and Michael Goldwasser)
Sequential Logic Circuits. Set-Reset Latch The Set-Reset latch or bistable is a simple sequential logic circuit that remembers what has happened to the.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Chapter 4 Gates and Circuits.
Flip-Flops Basic concepts. A. Yaicharoen2 Flip-Flops A flip-flop is a bi-stable device: a circuit having 2 stable conditions (0 or 1) A flip-flop circuit.
Digital Logic Design Week 7 Encoders, Decoders, Multiplexers, Demuxes.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
Computer Science 210 Computer Organization Clocks and Memory Elements.
Latches CS370 –Spring 2003 Section 4-2 Mano & Kime.
A. Abhari CPS2131 Sequential Circuits Most digital systems like digital watches, digital phones, digital computers, digital traffic light controllers and.
Chapter 1 — Computer Abstractions and Technology — 1 Lecture 7 Carry look ahead adders, Latches, Flip-flops, registers, multiplexors, decoders Digital.
Logical Circuit Design Week 11: Sequential Logic Circuits Mentor Hamiti, MSc Office ,
CSCE 211: Digital Logic Design. Chapter 6: Analysis of Sequential Systems.
1 © 2014 B. Wilkinson Modification date: Dec Sequential Logic Circuits – I Flip-Flops A sequential circuit is a logic components whose outputs.
Latches Module M10.1 Section 7.1. Sequential Logic Combinational Logic –Output depends only on current input Sequential Logic –Output depends not only.
Latches Section 4-2 Mano & Kime. Sequential Logic Combinational Logic –Output depends only on current input Sequential Logic –Output depends not only.
Chapter 4 Gates and Circuits.
CS 151 Digital Systems Design Lecture 30 Random Access Memory (RAM)
Latches Lecture L8.1 Section 7.1 – Book Sect. 8.1– Handout.
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
Informationsteknologi Friday, October 19, 2007Computer Architecture I - Class 81 Today’s class Digital Logic.
TDC 311 Digital Logic. Truth Tables  AND  OR  NOT  NAND  NOR  XOR  XNOR.
Any logic circuits can be transformed to an implementation where only NAND gates (and inverters) are used. The general approach to finding a NAND-gate.
Digital Logic Design CHAPTER 5 Sequential Logic. 2 Sequential Circuits Combinational circuits – The outputs are entirely dependent on the current inputs.
Digital Electronics and Computer Interfacing Tim Mewes 3. Digital Electronics.
Chapter 4 Gates and Circuits. 4–2 Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors.
Some Useful Circuits Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University.
EECS 370 Discussion 1 xkcd.com. EECS 370 Discussion Topics Today: – Floating Point – Finite State Machines – Combinational Logic – Sequential Logic 2.
Chapter 4 Gates and Circuits.
Chapter 4 Gates and Circuits. Integrated Circuits aka CHIPS What’s in this thing???? 4–2.
Chapter 4 Gates and Circuits.
Unit 9 Multiplexers, Decoders, and Programmable Logic Devices
CPS120: Introduction to Computer Science
Basic Sequential Components CT101 – Computing Systems Organization.
Chapter 4: Gates and Circuits Chapter 4 Gates and Circuits Page 30 The AND Operation (i.e., are both operands “true”?) 1 AND 1 11 AND 0 00 AND 1 00 AND.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits II.
CHAPTER-2 Fundamentals of Digital Logic. Digital Logic Digital electronic circuits are used to build computer hardware as well as other products (digital.
Hamming Code,Decoders and D,T-flip flops Prof. Sin-Min Lee Department of Computer Science.
Magnitude Comparator Dr. Ahmed Telba.
Synchronous Sequential Logic A digital system has combinational logic as well as sequential logic. The latter includes storage elements. feedback path.
CO5023 Latches, Flip-Flops and Decoders. Sequential Circuit What does this do? The OUTPUT of a sequential circuit is determined by the current output.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
CENG 241 Digital Design 1 Lecture 7 Amirali Baniasadi
Logic Gates Dr.Ahmed Bayoumi Dr.Shady Elmashad. Objectives  Identify the basic gates and describe the behavior of each  Combine basic gates into circuits.
4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.
Week 1: Introduction and Logic gates IT3002 – Computer Architecture
SIGNAL TRAINING SCHOOL – BORDER SECIRITY FORCE - TIGRI
Sequential Logic Design
Computer Science 210 Computer Organization
Basics of Logic gates - Part 2
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Computer Organization and Design
Multiplexer.
CS140 Lecture 03: The Machinery of Computation: Combinational Logic
Sequential Circuits Most digital systems like digital watches, digital phones, digital computers, digital traffic light controllers and so on require.
Flip Flop.
Computer Science 210 Computer Organization
NAND-ONLY LOGIC CIRCUITS
LECTURE 15 – DIGITAL ELECTRONICS
Chapter 4 Gates and Circuits.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Computer Science 210 Computer Organization
CSE 370 – Winter Sequential Logic - 1
Week 7: Gates and Circuits: PART II
Logic Gates.
Reference: Moris Mano 4th Edition Chapter 5
Presentation transcript:

Multiplexers 1 The output is equal to one of several input signals to the circuit The multiplexer selects which input signal to use as an output signal based on the value represented by a few more input signals, called select signals EECS Computer Use: Fundamentals A multiplexer (or mux) is a general circuit that produces a single output signal

Multiplexers 2 S0S1S2F 000D0 001D1 010D2 011D3 100D4 101D5 110D6 111D7 The control lines S0, S1, S2 determine which of eight other input lines (D0 – D7) are provided to the output “F” For example, if S0 S1 S2 = 000, the output will be equal to D0 In general, the binary values on n input control lines are used to determine which of 2 n other data lines are selected for output. EECS Computer Use: Fundamentals

Sequential Circuits 3 In this circuit, the output of the circuit also serves as input to the circuit. That is the existing state of the circuit is used to determine the next state of the circuit Digital circuits that store information form a sequential circuit. EECS Computer Use: Fundamentals

Circuit as Memory (S-R Latch) 4 Here we use 2 NAND gates An S-R latch stores a single binary digit (1 or 0) S = Set; R = Reset (or the control line) An example of one type of memory circuits is the S-R latch EECS Computer Use: Fundamentals

Circuit as Memory (S-R Latch) 5 The design of this circuit guarantees that the two outputs X and Y are always complements of each other The value of X at any point in time is considered to be the current state of the circuit: If X is 1, the circuit is storing a 1 If X is 0, the circuit is storing a 0 X = Y’ An S-R latch stores a single binary digit (1 or 0) EECS Computer Use: Fundamentals

Circuit as Memory (S-R Latch) 6 then if S = R = 1, X remains 1 and Y remains X = Y’ Suppose the current state of the circuit is 1 (i.e. X = 1), EECS Computer Use: Fundamentals

Circuit as Memory (S-R Latch) This means if both input values S and R are 1, then the circuit keeps its current state X = Y’ Suppose the current state of the circuit is 0 (i.e. X = 0), then if S = R = 1, X remains 0 and Y remains 1 EECS Computer Use: Fundamentals

Circuit as Memory (S-R Latch) 8 Go back to the case when the current state is 1 Now we purposely set S = 0 then X remains 1 and Y remains X = Y’ EECS Computer Use: Fundamentals But how does the output state (i.e. X) change?

Circuit as Memory (S-R Latch) X = Y’ No changes to X and Y EECS Computer Use: Fundamentals Now change S back to 1

Circuit as Memory (S-R Latch) X = Y’ 0 1 That means the output state can be changed from 1 to 0 by resetting R to 0 EECS Computer Use: Fundamentals Now change R to 0 Then the output of the bottom NAND will always give us 1, so Y = 1 and X = 0

Circuit as Memory (S-R Latch) X = Y’ Then Y remains at 1 and X remains at 0 Again, as long as S = R = 1, X remains at 0 and Y remains at 1 EECS Computer Use: Fundamentals Now change R to 1

Circuit as Memory (S-R Latch) X = Y’ Let’s try to change R to 0 Then Y remains at 1 and X remains at 0 So X remains at 0 and the state doesn’t change 0 1 EECS Computer Use: Fundamentals So how do we change X back to 1 (i.e. the previous state)?

Circuit as Memory (S-R Latch) X = Y’ By changing S, the output state goes back to 1 EECS Computer Use: Fundamentals So let’s go back and change S to 0 instead

Circuit as Memory (S-R Latch) 14 X = Y’ SRX (output state) 00Restricted combination 01X goes to 1 10X goes to 0 11No change Timing diagram: EECS Computer Use: Fundamentals So the truth table of the S-R latch is:

Integrated Circuits (Chip or IC) 15 An integrated circuit (IC) is a piece of silicon on which multiple gates are embedded IC are classified by the number of gates contained in them. EECS Computer Use: Fundamentals

Integrated Circuits (Chip or IC) 16 For example: An SSI chip has 14 pins: 8 for inputs to gates; 4 for output of the gates; 1 for ground; 1 for power. EECS Computer Use: Fundamentals

Integrated Circuits (Chip or IC) 17 So how can an IC has more than 100,000 gates on it? If we need 2 pins for input and 1 pin for output, that would need 300,000 pins! Key is that the gates are not independent, that is, many gates are combines to create complex circuits that require only a few input and output values. EECS Computer Use: Fundamentals

CPU Chips 18 Most important IC in any computer is the central processing unit (CPU) Each CPU chip contains a large number of pins – provides communication from the CPU to memory and I/O devices, and vice versa. EECS Computer Use: Fundamentals