Elec 2607 Digital Switching Circuits

Slides:



Advertisements
Similar presentations
Computer Science 210 Computer Organization Introduction to Logic Circuits.
Advertisements

Combinational Circuits
Multiplexer as a Universal Function Generator Lecture L6.7 Section 6.2.
Combinational Circuits. Analysis Diagram Designing Combinational Circuits In general we have to do following steps: 1. Problem description 2. Input/output.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
Lecture 4 More Examples of Karnaugh Map. Logic Reduction Using Karnaugh Map Create an Equivalent Karnaugh Map Each circle must be around a power of two.
1 Homework Reading –Tokheim, Section 5-10, 7-4 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
ECE 331 – Digital System Design
ECE 301 – Digital Electronics Multiplexers and Demultiplexers (Lecture #12)
What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Multiplexers and Demultiplexers, and Encoders and Decoders
Digital Activity work sheet Inputs  Sound  Light  Heat  Slide Switch  Push Switch Output  Light________________  Buzzer______________  Relay_______________.
Digital System Design Multiplexers and Demultiplexers, and Encoders and Decoders.
AND Gate Inputs Output Input A (Switch) Input B (Switch) Output Y (Lamp) 0 (Open) 0 (OFF) A B Lamp.
Lecture 21: Combinatorial Circuits II Discrete Mathematical Structures: Theory and Applications.
Combinational Circuits Part 1
Homework Reading Machine Projects Labs
Application: Digital Logic Circuits
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Multiplexers and Demultiplexers,
What is a Multiplexer (MUX)?
RCA 02 FLIPPED CLASSROOM ACTIVITY CONSTRUCTOR – USING EXISTING CONTENT
Thinking Hats There are 6 Thinking Hats and they are used to help us focus and guide our thinking. INFORMATION HAT The white hat is used for information.
Jeremy R. Johnson Wed. Sept. 29, 1999
Basics of Digital Logic Design Presentation D
MIPS ALU.
ECE 331 – Digital System Design
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Elec 2607 Digital Switching Circuits
Dr. Clincy Professor of CS
Karnaugh Maps (K-Maps)
Computer Science 210 Computer Organization
Compare and Order Numbers
Elec 2607 Digital Switching Circuits
Instructor: Alexander Stoytchev
BASIC & COMBINATIONAL LOGIC CIRCUIT
Elec 2607 Digital Switching Circuits
Instructor: Alexander Stoytchev
Karnaugh Mapping Karnaugh Mapping Digital Electronics
Karnaugh Mapping Digital Electronics
Lecture 8 Logistics Last lecture Last last lecture Today
Karnaugh Mapping Karnaugh Mapping Digital Electronics
ECE 301 – Digital Electronics
Homework Reading Tokheim, Section 5-10, 7-4.
Elec 2607 Digital Switching Circuits
Lecture 10 Logistics Last lecture Today
Instructor: Alexander Stoytchev
Dr. Clincy Professor of CS
Lecture 11 Logistics Last lecture Today HW3 due now
AOI Logic Implementation
13 Digital Logic Circuits.
ECB2212-Digital Electronics K-Map
Elec 2607 Digital Switching Circuits
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Chapter 10.3 and 10.4: Combinatorial Circuits
My Take on the Largest Number Algorithm
Elec 2607 Digital Switching Circuits
ECE 352 Digital System Fundamentals
Instructor: Alexander Stoytchev
Digital System Design Combinational Logic
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Combinational Logic Circuit
ECE 352 Digital System Fundamentals
MIPS ALU.
MIPS ALU.
Digital System Design ASMD based Design
Presentation transcript:

Elec 2607 Digital Switching Circuits Lecture 17 & 18: Digital Logic 24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 0:

ANOTHER FORM OF Digital Logic 24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

AND Gates No x indicates use a 1 OR Gates No x indicates use a 0 24/11/2018 ELEC 2607 Lecture 17 & 18:

Wrong drawing X X X AND Gates No x indicates variable disabled use a 1 OR Gates No x indicates variable disabled use a 0 24/11/2018 ELEC 2607 Lecture 17 & 18:

No x indicates variable disabled use a 1 AND Gates No x indicates variable disabled use a 1 OR Gates No x indicates variable disabled use a 0 24/11/2018 ELEC 2607 Lecture 17 & 18:

No x indicates variable disabled use a 1 AND Gates No x indicates variable disabled use a 1 OR Gates No x indicates variable disabled use a 0 24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

Slide taken from Lecture 0 This stuff again 24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

Change the way it looks Same as in middle 24/11/2018 ELEC 2607 Lecture 17 & 18:

ELEC 2507 ELEC 2507 24/11/2018 ELEC 2607 Lecture 17 & 18:

5V 5V 5V 24/11/2018 ELEC 2607 Lecture 17 & 18:

5V 5V 5V 5V 5V 24/11/2018 ELEC 2607 Lecture 17 & 18:

5V 0V 0V 5V 5V 5V 5V 5V 5V 24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

What ‘s the function What ‘s the function 24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

AND Gates No x indicates use a 1 24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

disconnect disconnect Put into sum of products form X P = AB+ACD X X X X disconnect disconnect 24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

disconnect 24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

Read carefully and REMEBER Key to PLA design 24/11/2018 ELEC 2607 Lecture 17 & 18:

Obvious looping Needs explaining 24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

A GOOD PLACE TO TAKE A BREAK 1 2 3 4 5 Only have 5 and terms available 24/11/2018 ELEC 2607 Lecture 17 & 18: A GOOD PLACE TO START AGAIN

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 15 & 16:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

Think about: “who can design the circuit sung the least number of 2 input Mux’s 24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

a b c d 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d d d d d 1 1 1 d d 1 1 d d 1 d d 1 d d Z 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d 1 d d 1 1 d d 1 1 d d X e f g W Map Key Y Try something ??????????????????? 24/11/2018 ELEC 2607 Lecture 17 & 18:

a b c d 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d d d d d 1 1 d d 1 1 d d 1 1 d d 1 d d Z 1 1 1 1 1 1 1 1 1 1 1 1 1 No other options for the 1/d pair in “d” segment. Loop of 2 is the best we can do. But we can share d d d d d d d d d d d d 1 d d 1 1 d d 1 1 d d X e f g W Map Key Y 24/11/2018 ELEC 2607 Lecture 17 & 18:

One possible looping with this one. Can be shared 4 times d d d d d d 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d d d d d 1 1 d d 1 1 d d 1 1 d d 1 d d Z 1 1 1 1 1 1 1 1 1 1 1 1 1 One possible looping with this one. Can be shared 4 times d d d d d d d d d d d d 1 d d 1 1 d d 1 1 d d X e f g W Map Key Y 24/11/2018 ELEC 2607 Lecture 17 & 18:

One possible looping with this one. Can be shared 4 times d d d d d d 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d d d d d 1 1 d d 1 1 d d 1 1 d d 1 d d Z 1 1 1 1 1 1 1 1 1 1 1 1 1 d d One possible looping with this one. Can be shared 4 times d d d d d d d d d d 1 d d 1 1 d d 1 1 d d X e f g W Map Key Y 24/11/2018 ELEC 2607 Lecture 17 & 18:

One possible looping with this one. Can be shared 4 times 1 d d 1 1 d Z 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d One possible looping with this one. Can be shared 4 times 1 d d 1 1 d d 1 1 d d X e f g W Map Key Y 24/11/2018 ELEC 2607 Lecture 17 & 18:

One possible looping with this one. Can be shared 5 times X e f g W 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d d d d d 1 1 d d 1 1 d d 1 1 d d 1 d d Z 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d 1 d d 1 1 d d 1 1 d d One possible looping with this one. Can be shared 5 times X e f g W Map Key Y 24/11/2018 ELEC 2607 Lecture 17 & 18:

One possible looping with this one. Can be shared 2 times X e f g W 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d d d d d 1 1 d d 1 1 d d 1 1 d d 1 d d Z 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d 1 d d 1 1 d d 1 1 d d One possible looping with this one. Can be shared 2 times X e f g W Map Key Y 24/11/2018 ELEC 2607 Lecture 17 & 18:

One possible looping with this one. Can be shared 4 times X e f g W 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d d d d d 1 1 d d 1 1 d d 1 1 d d 1 d d Z 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d 1 d d 1 1 d d 1 1 d d One possible looping with this one. Can be shared 4 times X e f g W b is done c is done d is done Map Key Y 24/11/2018 ELEC 2607 Lecture 17 & 18:

One possible looping with this one. Can be shared 3 times. 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d d d d d 1 1 d d 1 1 d d 1 1 d d 1 d d Z 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d 1 d d 1 1 d d 1 1 d d One possible looping with this one. Can be shared 3 times. Group of 8 is largest looping that I can share X e f g W a is done b is done c is done d is done f is done g is done Map Key Y 24/11/2018 ELEC 2607 Lecture 17 & 18:

One possible looping with this one. Can be shared 2 times. 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d d d d d 1 1 1 d d 1 1 d d 1 d d 1 d d Z 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d 1 d d 1 1 d d 1 1 d d X e f g W Extend previous group of 2 “Red” to a group of 4. Larger loop = simpler and term a is done b is done c is done d is done e is done f is done g is done One possible looping with this one. Can be shared 2 times. Group of 4 is largest looping that I can share Map Key Y 24/11/2018 ELEC 2607 Lecture 17 & 18:

a b c d 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 d d d d d d d d d d d d d d d d 1 1 d d 1 1 d d 1 1 d d 1 d d 1 1 1 1 1 Z 1 1 1 1 1 1 1 1 d d d d d d d d d d d d 1 d d 1 1 d d 1 1 d d e f g X 9 loops W Map Key Y 24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18:

24/11/2018 ELEC 2607 Lecture 17 & 18: