ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 15 Magnitude Comparators.

Slides:



Advertisements
Similar presentations
Your performance improvement partner 2/25/
Advertisements

Boolean Algebra Variables: only 2 values (0,1)
ECE555 Lecture 10 Nam Sung Kim University of Wisconsin – Madison
The following 5 questions are about VOLTAGE DIVIDERS. You have 20 seconds for each question What is the voltage at the point X ? A9v B5v C0v D10v Question.
Inside the binary adder. Electro-mechanical relay A solid state relay is a switch that is controlled by a current. When current flows from A to B, the.
The Science of Biology The study of living things.
Enter. The Scene Type text here Choice A1 Text for decisions Guidelines Guideline text Click on A, B or C A B C Choice B1 Choice C1 Click on A, B or C.
State Space Representation Hany Ferdinando Dept. of Electrical Engineering Petra Christian University.
Bus 480 – Lecture 2 Transportation and Assignment models
1 A New Multiplication Technique for GF(2 m ) with Cryptographic Significance Athar Mahboob and Nassar Ikram National University of Sciences & Technology,
Fill-in headings across in the first row. (Type "Month in cell A1, Beginning Balance in cell B1, etc…) Month Beginning BalancePaymentInterestPrincipalEnd.
ENGIN112 L23: Finite State Machine Design Procedure October 27, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 23 Finite State Machine.
Testing “Multiple Conditions” with Decision Table Technique
ENGIN112 L7: More Logic Functions September 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 7 More Logic Functions: NAND, NOR,
DAT2343 Basic Logic Gates © Alan T. Pinck / Algonquin College; 2003.
The IF function Bernard Liengme. Objectives To know how to: Construct a condition using the comparison operators =, >=, >, ; Construct a formula using.
Web-pa – the tutors’ view Web-PA – a tutors’ view Peter Willmot (School of Mechanical and Manufacturing Engineering)
Two parallel lines intersected by another line   A B Corresponding angles (sehadap) Corresponding angles are congruent  A1 =  B1.
IPE – Calendar Seite 1 Application deadline : February 28 Track length: 12 weeks + 2 weeks German class in Heidelberg Semester dates Intensive german class.
( ( ) quantum bits conventional bit
Adders Module M8.1 Section 6.2. Adders Half Adder Full Adder TTL Adder.
Combinatorial networks- II
ENGIN112 L9: More Karnaugh Maps September 22, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 9 More Karnaugh Maps and Don’t Cares.
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.
Give qualifications of instructors: DAP
CDA 3100 Recitation Week 10.
Logic Circuits Design presented by Amr Al-Awamry
Comparators Combinational Design.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.
Give qualifications of instructors: DAP
Lecture #9 EGR 277 – Digital Logic
CS 151 Digital Systems Design Lecture 15 Magnitude Comparators and Multiplexers.
SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 1.
ECE 301 – Digital Electronics Multiplexers and Demultiplexers (Lecture #12)
ENGIN112 L25: State Reduction and Assignment October 31, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 25 State Reduction and Assignment.
ENGIN112 L14: Binary Adder Subtractor October 3, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 14 Binary Adders and Subtractors.
ENGIN112 L12: Circuit Analysis Procedure September 29, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 12 Circuit Analysis Procedure.
ITEC 352 Lecture 5 Low level components(3). Low level components Review Multiplexers Demultiplexer Minterm/Maxterm Karnaugh Map.
Digital Electronics.
Combinational and Sequential Logic Circuits.
Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
Digital Systems I EEC 180A Lecture 4 Bevan M. Baas.
DLD Lecture 15 Magnitude Comparators and Multiplexers
Islamic University Of Gaza, Nael Aburas Data Storage Introduction to computer, 2nd semester, 2010/2011 Mr.Nael Aburas
Universal college of engineering & technology. .By Harsh Patel)
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 7 Dr. Shi Dept. of Electrical and Computer Engineering.
Magnitude Comparator A magnitude comparator is a combinational circuit that compares two numbers, A and B, and then determines their relative magnitudes.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Complex Combinational Logic Blocks ECE/CS 252, Fall 2010 Prof.
1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.
Digital Design Lecture 8 Combinatorial Logic (Continued)
ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.
Encoders The inverse function of a decoder. Priority Encoder resolve the ambiguity of illegal inputs only one of the input is encoded D 3 has the highest.
Combinational Circuit Design
Magnitude Comparator A magnitude comparator is a combinational circuit that compares two numbers, A and B, and then determines their relative magnitudes.
Schematics 201 Lecture Topic: Electrical Symbols
Digital Logic & Design Dr. Waseem Ikram Lecture No. 16.
EEL 3705 / 3705L Digital Logic Design
DIGITAL ELECTRONICS B.SC FY
Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.
XOR Function Logic Symbol  Description  Truth Table 
Magnitude Comparator Lecture L6.2 Section 6.1.
Digital Circuits.
ECE2030 HW-6.
ACOE101: Freshman Computer Engineering Fall 2018
Logic Gates By: Asst Lec. Besma Nazar Nadhem
SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.
Presentation transcript:

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 15 Magnitude Comparators and Multiplexers

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Overview °Discussion of two digital building blocks °Magnitude comparators Compare two multi-bit binary numbers Create a single bit comparator Use repetitive pattern °Multiplexers Select one out of several bits Some inputs used for selection Also can be used to implement logic

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Magnitude Comparator °The comparison of two numbers outputs: A>B, A=B, A<B °Design Approaches the truth table -2 2n entries - too cumbersome for large n use inherent regularity of the problem -reduce design efforts -reduce human errors Magnitude Compare A[3..0] B[3..0] A = B A < B A > B

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Magnitude Comparator How can we find A > B? How many rows would a truth table have? 2 8 = 256

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Magnitude Comparator If A = 1001 and B = 0111 is A > B? Why? Because A3 > B3 i.e. A3. B3’ = 1 Therefore, one term in the logic equation for A > B is A3. B3’ Find A > B

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Magnitude Comparator If A = 1010 and B = 1001 is A > B? Why? Because A3 = B3 and A2 = B2 and A1 > B1 i.e. C3 = 1 and C2 = 1 and A1. B1’ = 1 Therefore, the next term in the logic equation for A > B is C3. C2. A1. B1’ A > B = A3. B3’ + C3. A2. B2’ + …..

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Magnitude Comparison °Algorithm -> logic A = A 3 A 2 A 1 A 0 ; B = B 3 B 2 B 1 B 0 A=B if A 3 =B 3, A 2 =B 2, A 1 =B 1 and A 1 =B 1 °Test each bit: -equality: x i = A i B i +A i 'B i ' -(A=B) = x 3 x 2 x 1 x 0 °More difficult to test less than/greater than (A>B) = A 3 B 3 '+x 3 A 2 B 2 '+x 3 x 2 A 1 B 1 '+x 3 x 2 x 1 A 0 B 0 ' (A<B) = A 3 'B 3 +x 3 A 2 'B 2 +x 3 x 2 A 1 'B 1 +x 3 x 2 x 1 A 0 'B 0 Start comparisons from high-order bits °Implementation x i = (A i B i '+A i 'B i )’

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Magnitude Comparison °Hardware chips

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Magnitude Comparator °Real-world application Thermostat controller

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Multiplexers °Select an input value with one or more select bits °Use for transmitting data °Allows for conditional transfer of data °Sometimes called a mux

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, – to– 1- Line Multiplexer

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Quadruple 2–to–1-Line Multiplexer °Notice enable bit °Notice select bit °4 bit inputs

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Multiplexer as combinational modules °Connect input variables to select inputs of multiplexer (n-1 for n variables) °Set data inputs to multiplexer equal to values of function for corresponding assignment of select variables °Using a variable at data inputs reduces size of the multiplexer

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Implementing a Four- Input Function with a Multiplexer

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Typical multiplexer uses

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Three-state gates A multiplexer can be constructed with three-state gates Output state: 0, 1, and high-impedance (open ckts) If the select input (E) is 0, the three-state gate has no output Opposite true here, No output if E is 1

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Three-state gates A multiplexer can be constructed with three-state gates Output state: 0, 1, and high-impedance (open ckts) If the select input is low, the three-state gate has no output

ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 Summary °Magnitude comparators allow for data comparison Can be built using and-or gates °Greater/less than requires more hardware than equality °Multiplexers are fundamental digital components Can be used for logic Useful for datapaths Scalable °Tristate buffers have three types of outputs 0, 1, high-impedence (Z) Useful for datapaths