0% found this document useful (0 votes)
26 views18 pages

Lecture 14

logic design

Uploaded by

Jale Çavuş
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
26 views18 pages

Lecture 14

logic design

Uploaded by

Jale Çavuş
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

Magnitude Comparator and Multiplexers

Asst. Prof. Mohanad Alayedi


Department of Software Engineering
Haliç University
[email protected]

CEN203, Fall 2024

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 1


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

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 2


Magnitude Comparator

➢ The comparison of two numbers


➢ outputs: A>B, A=B, A<B

➢° Design Approaches
➢ the truth table
2n
➢ 2 entries - too cumbersome for large n
➢ use inherent regularity of the problem
➢ reduce design efforts
➢ reduce human errors

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 3


Magnitude Comparator

How can we find A > B?


How many rows would a truth table have?

28 = 256

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 4


Magnitude Comparator

Find A > B

Because A3 > B3
If A = 1001 and i.e. A3 . B3’ = 1
B = 0111 Therefore, one term in the
is A > B? logic equation for A > B is
Why? A3 . B3’

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 5


Magnitude Comparator

If A = 1010 and A > B = A3 . B3’


B = 1001 + C3 . A2 . B2’
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’

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 6


Magnitude Comparison

➢ Algorithm -> logic


➢ A = A3A2A1A0 ; B = B3B2B1B0
➢ A=B if A3=B3, A2=B2, A1=B1and A1=B1
➢ Test each bit:
➢ equality: xi= AiBi+Ai'Bi'
➢ (A=B) = x3x2x1x0
➢ More difficult to test less than/greater than
➢ (A>B) = A3B3'+x3A2B2'+x3x2A1B1'+x3x2x1 A0B0'
➢ (A<B) = A3'B3+x3A2'B2+x3x2A1'B1+x3x2x1 A0'B0
➢ Start comparisons from high-order bits
➢ Implementation
➢ xi = (AiBi'+Ai'Bi)’

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 7


CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 8
Magnitude Comparator

➢ Real-world application
➢ Thermostat controller

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 9


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

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 10


4– to– 1- Line Multiplexer

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 11


Quadruple 2–to–1-Line Multiplexer

➢ Notice enable bit


➢ Notice select bit
➢ 4 bit inputs

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 12


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

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 13


Implementing a Four- Input Function with a Multiplexer

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 14


Typical multiplexer uses

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 15


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

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 16


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

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 17


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
CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 18

You might also like