SlideShare a Scribd company logo
1 of 37
ENEE244-020x
Digital Logic Design
Lecture 20
Announcements
• Homework 6 due today.
• Homework 7 up on course webpage, due on
11/13.
• Recitation quiz on Monday, 11/10
– Will cover material from lectures 18,19,20
• Exams to be returned at end of lecture.
Agenda
• Last time:
– Decimal Adders (5.2)
– Comparators (5.3)
– Decoders (5.4)
– Encoders (5.5)
• This time:
– Multiplexers (5.6)
– Programmable Logic Devices (5.7)
– Programmable Read-Only Memories (PROM) (5.8)
Multiplexer
• Also called data selectors.
• Basic function: select one of its 2𝑛
data input
lines and place the corresponding information
onto a single output line.
• 𝑛 input bits needed to specify which input line
is to be selected.
– Place binary code for a desired data input line
onto its 𝑛 select input lines.
Realization of 4-to-1 line multiplexer
Logic Diagram
Truth Table
Symbol
Realization of 4-to-1 line multiplexer
• Alternate description:
• Algebraic description of multiplexer:
𝑓 = 𝐼0𝑆1𝑆0 + 𝐼1𝑆1𝑆0 + 𝐼2𝑆1𝑆0 + 𝐼3𝑆1𝑆2 𝐸
Building a Large Multiplexer
Multiplexers
• One of the primary applications of
multiplexers is to provide for the transmission
of information from several sources over a
single path.
• This process is known as multiplexing.
• Demultiplexer = decoder with an enable input.
Multiplexer/Demultiplexer for
information transmission
Logic Design with Multiplexers
𝒙 𝒚 𝒛 𝒇
0 0 0 𝑓0
0 0 1 𝑓1
0 1 0 𝑓2
0 1 1 𝑓3
1 0 0 𝑓4
1 0 1 𝑓5
1 1 0 𝑓6
1 1 1 𝑓7
The Boolean expression corresponding to this truth table can be
written as:
𝑓 𝑥, 𝑦, 𝑧
= 𝑓0 ⋅ 𝑥 𝑦 𝑧 + 𝑓1 ⋅ 𝑥 𝑦 𝑧 + 𝑓2 ⋅ 𝑥𝑦𝑧 + 𝑓3 ⋅ 𝑥𝑦𝑧 + 𝑓4 ⋅ 𝑥𝑦 𝑧 + 𝑓5 ⋅ 𝑥𝑦𝑧
+ 𝑓6𝑥𝑦𝑧 + 𝑓7 ⋅ 𝑥𝑦𝑧.
Logic Design with Multiplexers
• The Boolean expression corresponding to this
truth table can be written as:
𝑓 𝑥, 𝑦, 𝑧 = 𝑓0 ⋅ 𝑥 𝑦 𝑧 + 𝑓1 ⋅ 𝑥 𝑦 𝑧 + 𝑓2 ⋅
𝑥𝑦𝑧 + 𝑓3 ⋅ 𝑥𝑦𝑧 + 𝑓4 ⋅ 𝑥𝑦 𝑧 + 𝑓5 ⋅ 𝑥𝑦𝑧 + 𝑓6𝑥𝑦𝑧 +
𝑓7 ⋅ 𝑥𝑦𝑧.
• The Boolean expression for an 8-to-1-line
multiplexer is:
𝑓
= 𝐼0𝑆2𝑆1𝑆0 + 𝐼1𝑆2𝑆1𝑆0 + 𝐼2𝑆2𝑆1𝑆0 + 𝐼3𝑆2𝑆1𝑆0
Logic Design with Multiplexers
• If E is logic-1 then the latter is transformed into the former by
replacing 𝐼𝑖 with 𝑓𝑖, 𝑆2 with 𝑥, 𝑆1 with 𝑦, and 𝑆0 with z.
• Placing 𝑥, 𝑦, 𝑧 on the select lines 𝑆2, 𝑆1, 𝑆0, respectively and
placing the functional values 𝑓𝑖 on data input lines 𝐼𝑖.
8-to-1
MUX
𝐼0
𝐼1
𝐼2
𝐼3
𝐼4
𝐼5
𝐼6
𝐼7
𝐸 𝑆2 𝑆1 𝑆0
𝑓
𝑓0
𝑓1
𝑓2
𝑓3
𝑓4
𝑓5
𝑓6
𝑓7
1
𝑥 𝑦 𝑧
Example:
𝒙 𝒚 𝒛 𝒇
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 0
8-to-1
MUX
𝐼0
𝐼1
𝐼2
𝐼3
𝐼4
𝐼5
𝐼6
𝐼7
𝐸 𝑆2 𝑆1 𝑆0
𝑓
1
0
1
1
0
1
0
0
1
𝑥 𝑦 𝑧
Logic Design with Multiplexers
• If at least one input variable of a Boolean function is
available in both its complemented and uncomplemented
form, any 𝑛-variable function is realizable with a 2𝑛−1-to-1-
line multiplexer.
• For the case of a 3-variable function, only a 4-to-1
multiplexer is needed.
• 𝑓 𝑥, 𝑦, 𝑧 = 𝑓0 ⋅ 𝑥 𝑦 𝑧 + 𝑓1 ⋅ 𝑥 𝑦 𝑧 + 𝑓2 ⋅ 𝑥𝑦𝑧 + 𝑓3 ⋅ 𝑥𝑦𝑧 +
𝑓4 ⋅ 𝑥𝑦 𝑧 + 𝑓5 ⋅ 𝑥𝑦𝑧 + 𝑓6𝑥𝑦𝑧 + 𝑓7 ⋅ 𝑥𝑦𝑧
= 𝑓0 ⋅ 𝑧 + 𝑓1 ⋅ 𝑧 𝑥 𝑦 + 𝑓2 ⋅ 𝑧 + 𝑓3 ⋅ 𝑧 𝑥𝑦
+ 𝑓4 ⋅ 𝑧 + 𝑓5 ⋅ 𝑧 𝑥𝑦 + 𝑓6 ⋅ 𝑧 + 𝑓7 ⋅ 𝑧 𝑥𝑦
• When E = 1, 4-to-1 Multiplexer has the form
𝐼0𝑆1𝑆0 + 𝐼1𝑆1𝑆0 + 𝐼2𝑆1𝑆0 + 𝐼3𝑆1𝑆2
Logic Design with Multiplexers
𝑓(𝑥, 𝑦, 𝑧)
= 𝑓0 ⋅ 𝑧 + 𝑓1 ⋅ 𝑧 𝑥 𝑦 + 𝑓2 ⋅ 𝑧 + 𝑓3 ⋅ 𝑧 𝑥𝑦
+ 𝑓4 ⋅ 𝑧 + 𝑓5 ⋅ 𝑧 𝑥𝑦 + 𝑓6 ⋅ 𝑧 + 𝑓7 ⋅ 𝑧 𝑥𝑦
4-to-1 Multiplexer has the form
𝑓 = 𝐼0𝑆1𝑆0 + 𝐼1𝑆1𝑆0 + 𝐼2𝑆1𝑆0 + 𝐼3𝑆1𝑆2
• Realization of 𝑓(𝑥, 𝑦, 𝑧) is obtained by placing the
𝑥 and 𝑦 variables on the 𝑆1, 𝑆0 select lines, the
single variable functions 𝑓𝑖 ⋅ 𝑧 + 𝑓𝑗 ⋅ 𝑧 on the data
input lines and let E = 1.
• Note: 𝑓𝑖 ⋅ 𝑧 + 𝑓𝑗 ⋅ 𝑧 reduce to 0,1,𝑧 or 𝑧.
Example
𝒙 𝒚 𝒛 𝒇
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 0
𝑓0 ⋅ 𝑧 + 𝑓1 ⋅ 𝑧
𝑓2 ⋅ 𝑧 + 𝑓3 ⋅ 𝑧
𝑓4 ⋅ 𝑧 + 𝑓5 ⋅ 𝑧
𝑓6 ⋅ 𝑧 + 𝑓7 ⋅ 𝑧
1
𝑥 𝑦
Example
𝒙 𝒚 𝒛 𝒇
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 0
𝑧
1
𝑧
0
1
𝑥 𝑦
Logic Design with Multiplexers and K-
maps
• Consider 3-variable Karnaugh map. Assume x is placed
on the 𝑆1 line and y is placed on the 𝑆0 line.
• We get that the output is: 𝐼0𝑥 𝑦 + 𝐼1𝑥𝑦 + 𝐼2𝑥𝑦 + 𝐼3𝑥𝑦
• 𝐼0𝑥 𝑦 corresponds to those cells in which 𝑥 = 0, 𝑦 = 0
• 𝐼1𝑥𝑦 corresponds to those cells in which 𝑥 = 0, 𝑦 = 1
• 𝐼2𝑥𝑦 corresponds to those cells in which 𝑥 = 1, 𝑦 = 0
• 𝐼3𝑥𝑦 corresponds to those cells in which 𝑥 = 1, 𝑦 = 1
K-map representation
𝑆1 = 𝑥
𝑆0 = 𝑦
𝑦𝑧
00 01 11 10
𝐼0 𝐼1
𝐼2 𝐼3
𝐼0 map
0 1
𝑧
𝐼1 map
0 1
𝐼2 map
0 1
𝐼3 map
0 1
𝑧 𝑧 𝑧
Example
𝒙 𝒚 𝒛 𝒇
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 0
1 0 1 1
0 1 0 0
𝑆1 = 𝑥
𝑆0 = 𝑦
𝑦𝑧
00 01 11 10
1 0
𝐼0 map
0 1
𝑧
1 1
𝐼1 map
0 1
0 1
𝐼2 map
0 1
0 0
𝐼3 map
0 1
𝑧 𝑧 𝑧
𝐼0 = 𝑧 𝐼1 = 1 𝐼2 = 𝑧 𝐼3 = 0
Realization
𝒙 𝒚 𝒛 𝒇
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 0
𝑧
1
𝑧
0
1
𝑥 𝑦
Alternative Structures
𝑥
𝑆1 = 𝑦, 𝑆0 = 𝑧
𝑦𝑧
00 01 11 10
𝐼0 𝐼3
𝐼1 𝐼2
𝑆0 = 𝑥
𝑆1 = 𝑦
𝑦𝑧
00 01 11 10
𝐼0 𝐼2
𝐼1 𝐼3
Note that order of variables on
input lines matters!
8-to-1-line multiplexers and 4-variable
Boolean functions
• Can do the same thing, three variables are placed on select
lines, inputs to the data lines are single-variable functions.
• Example:
Can we do better?
• By allowing realizations of 𝑚-variable
functions as inputs to the data input lines, 2𝑛
-
to-1-line multiplexers can be used in the
realization of (𝑛 + 𝑚)-variable functions.
• E.g.: input variables w and x are applied to
the 𝑆1, 𝑆0 select inputs. Functions of the y and
z variables appear at the data input lines.
K-map Structure
Example:
𝑓 𝑥, 𝑦, 𝑧 = ∑𝑚(0,1,5,6,7,9,13,14)
Example
Example
Multiplexer Tree
Programmable Logic Devices (PLDs)
• With the advent of large-scale integration
technology, it has become feasible to fabricate
large circuits within a single chip.
• This has led to devices known as
programmable logic devices (PLDs).
– Programmable read-only memory (PROM)
– Programmable logic array (PLA)
– Programmable array logic (PAL)
General Structure of PLD
• Inputs to the PLD are applied to a set of
buffer/inverters. These devices have both the
true value of the input as well as the
complemented value of the input as its outputs.
• Outputs from these devices are the inputs to an
array of and-gates. The AND array generates a
set of p product terms.
• The product terms are inputs to an array of or-
gates to realize a set of m sum-of-product
expressions.
General Structure of PLD
General Structure of PLD
• One or both of the gate arrays are programmable.
• The logic designer can specify the connections within
an array.
• PLDs serve as general circuits for the realization of a
set of Boolean functions.
Device AND-array OR-array
PROM Fixed Programmable
PLA Programmable Programmable
PAL Programmable Fixed
Programming a PLD
• In a programmable array, the connections to each gate can be
modified.
• Simple approach is to have each of the gate inputs connected
to a fuse.
• Gate realizes the product term 𝑎𝑏𝑐𝑑.
• To generate the product term 𝑏𝑐 we remove the 𝑎, 𝑑
connections by blowing the corresponding fuses.
• Thus, programming is a hardware procedure. Specialized
equipment called programmers is needed to carry out the
programming of a PLD.
Programming a PLD
• Erasable PLD—connections can be reset to their
original conditions and then reprogrammed.
– Can be achieved by exposing the PLD to ultraviolet light or
using electrical signals
• PLDs programmed by a user are called field
programmable.
• User can also specify the desired connections and
supply the information to the manufacturer.
Manufacturer prepares an overlay that is used to
complete the connections as the last step in the
fabrication process.
• Such PLDs are called mask programmable.
PLD Notation
• Simplified notation. Each gate has only a single input
line.
• Inputs are indicated by lines at right angles to the
single gate lines.
• A cross at the intersection denotes a fusible link is
intact.
PLD Notation
• Lack of cross indicates the fuse is blown or no
connection exists.
PLD Notation
• The occurrence of a hard-wired connection that is not fusible
is indicated by a junction dot.
• For the special case when all the input fuses to a gate are kept
intact, a cross is placed inside the gate symbol.

More Related Content

Similar to lecture_20.pptx

Intel Cluster Poisson Solver Library
Intel Cluster Poisson Solver LibraryIntel Cluster Poisson Solver Library
Intel Cluster Poisson Solver Library
Ilya Kryukov
 

Similar to lecture_20.pptx (20)

WEEK 4- DLD-GateLvelMinimization.pptx
WEEK 4- DLD-GateLvelMinimization.pptxWEEK 4- DLD-GateLvelMinimization.pptx
WEEK 4- DLD-GateLvelMinimization.pptx
 
CH3_Gate Level Minimization.pdf
CH3_Gate Level Minimization.pdfCH3_Gate Level Minimization.pdf
CH3_Gate Level Minimization.pdf
 
Loop parallelization & pipelining
Loop parallelization & pipeliningLoop parallelization & pipelining
Loop parallelization & pipelining
 
Digital logic and microprocessors
Digital logic and microprocessorsDigital logic and microprocessors
Digital logic and microprocessors
 
Introduction to Neural networks (under graduate course) Lecture 6 of 9
Introduction to Neural networks (under graduate course) Lecture 6 of 9Introduction to Neural networks (under graduate course) Lecture 6 of 9
Introduction to Neural networks (under graduate course) Lecture 6 of 9
 
DSJ_Unit I & II.pdf
DSJ_Unit I & II.pdfDSJ_Unit I & II.pdf
DSJ_Unit I & II.pdf
 
Unit-1 Basic Concept of Algorithm.pptx
Unit-1 Basic Concept of Algorithm.pptxUnit-1 Basic Concept of Algorithm.pptx
Unit-1 Basic Concept of Algorithm.pptx
 
LeNet-5
LeNet-5LeNet-5
LeNet-5
 
Searching Algorithms
Searching AlgorithmsSearching Algorithms
Searching Algorithms
 
Trajectory Transformer.pptx
Trajectory Transformer.pptxTrajectory Transformer.pptx
Trajectory Transformer.pptx
 
NS-CUK Seminar: H.E.Lee, Review on "Gated Graph Sequence Neural Networks", I...
NS-CUK Seminar: H.E.Lee,  Review on "Gated Graph Sequence Neural Networks", I...NS-CUK Seminar: H.E.Lee,  Review on "Gated Graph Sequence Neural Networks", I...
NS-CUK Seminar: H.E.Lee, Review on "Gated Graph Sequence Neural Networks", I...
 
Hardware Acceleration for Machine Learning
Hardware Acceleration for Machine LearningHardware Acceleration for Machine Learning
Hardware Acceleration for Machine Learning
 
Intro. to computational Physics ch2.pdf
Intro. to computational Physics ch2.pdfIntro. to computational Physics ch2.pdf
Intro. to computational Physics ch2.pdf
 
Fortran chapter 2.pdf
Fortran chapter 2.pdfFortran chapter 2.pdf
Fortran chapter 2.pdf
 
MSc Thesis Presentation
MSc Thesis PresentationMSc Thesis Presentation
MSc Thesis Presentation
 
Intel Cluster Poisson Solver Library
Intel Cluster Poisson Solver LibraryIntel Cluster Poisson Solver Library
Intel Cluster Poisson Solver Library
 
Data structure and algorithm using java
Data structure and algorithm using javaData structure and algorithm using java
Data structure and algorithm using java
 
Linear regression by Kodebay
Linear regression by KodebayLinear regression by Kodebay
Linear regression by Kodebay
 
Tutorial on Object Detection (Faster R-CNN)
Tutorial on Object Detection (Faster R-CNN)Tutorial on Object Detection (Faster R-CNN)
Tutorial on Object Detection (Faster R-CNN)
 
System design using HDL - Module 3
System design using HDL - Module 3System design using HDL - Module 3
System design using HDL - Module 3
 

More from ansariparveen06

Fundamentals of programming Arduino-Wk2.ppt
Fundamentals of programming Arduino-Wk2.pptFundamentals of programming Arduino-Wk2.ppt
Fundamentals of programming Arduino-Wk2.ppt
ansariparveen06
 
Combinational_Logic_Circuit.pptx
Combinational_Logic_Circuit.pptxCombinational_Logic_Circuit.pptx
Combinational_Logic_Circuit.pptx
ansariparveen06
 
presentation_python_7_1569170870_375360.pptx
presentation_python_7_1569170870_375360.pptxpresentation_python_7_1569170870_375360.pptx
presentation_python_7_1569170870_375360.pptx
ansariparveen06
 
BCom-Sem2-Marketing-Digital-payment-Presentation.pptx
BCom-Sem2-Marketing-Digital-payment-Presentation.pptxBCom-Sem2-Marketing-Digital-payment-Presentation.pptx
BCom-Sem2-Marketing-Digital-payment-Presentation.pptx
ansariparveen06
 

More from ansariparveen06 (20)

discrete mathematics binary%20trees.pptx
discrete mathematics binary%20trees.pptxdiscrete mathematics binary%20trees.pptx
discrete mathematics binary%20trees.pptx
 
Introduction to Arduino 16822775 (2).ppt
Introduction to Arduino 16822775 (2).pptIntroduction to Arduino 16822775 (2).ppt
Introduction to Arduino 16822775 (2).ppt
 
Fundamentals of programming Arduino-Wk2.ppt
Fundamentals of programming Arduino-Wk2.pptFundamentals of programming Arduino-Wk2.ppt
Fundamentals of programming Arduino-Wk2.ppt
 
pscheduling.ppt
pscheduling.pptpscheduling.ppt
pscheduling.ppt
 
kmap.pptx
kmap.pptxkmap.pptx
kmap.pptx
 
Combinational_Logic_Circuit.pptx
Combinational_Logic_Circuit.pptxCombinational_Logic_Circuit.pptx
Combinational_Logic_Circuit.pptx
 
presentation_python_7_1569170870_375360.pptx
presentation_python_7_1569170870_375360.pptxpresentation_python_7_1569170870_375360.pptx
presentation_python_7_1569170870_375360.pptx
 
BCom-Sem2-Marketing-Digital-payment-Presentation.pptx
BCom-Sem2-Marketing-Digital-payment-Presentation.pptxBCom-Sem2-Marketing-Digital-payment-Presentation.pptx
BCom-Sem2-Marketing-Digital-payment-Presentation.pptx
 
dsa.ppt
dsa.pptdsa.ppt
dsa.ppt
 
11-IOManagement.ppt
11-IOManagement.ppt11-IOManagement.ppt
11-IOManagement.ppt
 
May14ProcessScheduling.ppt
May14ProcessScheduling.pptMay14ProcessScheduling.ppt
May14ProcessScheduling.ppt
 
UNIPROCESS SCHEDULING.pptx
UNIPROCESS SCHEDULING.pptxUNIPROCESS SCHEDULING.pptx
UNIPROCESS SCHEDULING.pptx
 
1-introduction-to-dart-programming.pptx
1-introduction-to-dart-programming.pptx1-introduction-to-dart-programming.pptx
1-introduction-to-dart-programming.pptx
 
CHAP4.pptx
CHAP4.pptxCHAP4.pptx
CHAP4.pptx
 
green IT cooling.pptx
green IT cooling.pptxgreen IT cooling.pptx
green IT cooling.pptx
 
06-Deadlocks.ppt
06-Deadlocks.ppt06-Deadlocks.ppt
06-Deadlocks.ppt
 
chp9 green IT.pptx
chp9 green IT.pptxchp9 green IT.pptx
chp9 green IT.pptx
 
regex.ppt
regex.pptregex.ppt
regex.ppt
 
BOM.ppt
BOM.pptBOM.ppt
BOM.ppt
 
Cooling.pptx
Cooling.pptxCooling.pptx
Cooling.pptx
 

Recently uploaded

Seal of Good Local Governance (SGLG) 2024Final.pptx
Seal of Good Local Governance (SGLG) 2024Final.pptxSeal of Good Local Governance (SGLG) 2024Final.pptx
Seal of Good Local Governance (SGLG) 2024Final.pptx
negromaestrong
 
Activity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdfActivity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdf
ciinovamais
 

Recently uploaded (20)

Class 11th Physics NEET formula sheet pdf
Class 11th Physics NEET formula sheet pdfClass 11th Physics NEET formula sheet pdf
Class 11th Physics NEET formula sheet pdf
 
Asian American Pacific Islander Month DDSD 2024.pptx
Asian American Pacific Islander Month DDSD 2024.pptxAsian American Pacific Islander Month DDSD 2024.pptx
Asian American Pacific Islander Month DDSD 2024.pptx
 
Measures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and ModeMeasures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and Mode
 
Seal of Good Local Governance (SGLG) 2024Final.pptx
Seal of Good Local Governance (SGLG) 2024Final.pptxSeal of Good Local Governance (SGLG) 2024Final.pptx
Seal of Good Local Governance (SGLG) 2024Final.pptx
 
Unit-IV; Professional Sales Representative (PSR).pptx
Unit-IV; Professional Sales Representative (PSR).pptxUnit-IV; Professional Sales Representative (PSR).pptx
Unit-IV; Professional Sales Representative (PSR).pptx
 
Grant Readiness 101 TechSoup and Remy Consulting
Grant Readiness 101 TechSoup and Remy ConsultingGrant Readiness 101 TechSoup and Remy Consulting
Grant Readiness 101 TechSoup and Remy Consulting
 
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
 
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxPython Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
 
Ecological Succession. ( ECOSYSTEM, B. Pharmacy, 1st Year, Sem-II, Environmen...
Ecological Succession. ( ECOSYSTEM, B. Pharmacy, 1st Year, Sem-II, Environmen...Ecological Succession. ( ECOSYSTEM, B. Pharmacy, 1st Year, Sem-II, Environmen...
Ecological Succession. ( ECOSYSTEM, B. Pharmacy, 1st Year, Sem-II, Environmen...
 
Micro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdfMicro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdf
 
How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17
 
Food Chain and Food Web (Ecosystem) EVS, B. Pharmacy 1st Year, Sem-II
Food Chain and Food Web (Ecosystem) EVS, B. Pharmacy 1st Year, Sem-IIFood Chain and Food Web (Ecosystem) EVS, B. Pharmacy 1st Year, Sem-II
Food Chain and Food Web (Ecosystem) EVS, B. Pharmacy 1st Year, Sem-II
 
Mixin Classes in Odoo 17 How to Extend Models Using Mixin Classes
Mixin Classes in Odoo 17  How to Extend Models Using Mixin ClassesMixin Classes in Odoo 17  How to Extend Models Using Mixin Classes
Mixin Classes in Odoo 17 How to Extend Models Using Mixin Classes
 
Activity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdfActivity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdf
 
Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...
Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...
Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...
 
Unit-V; Pricing (Pharma Marketing Management).pptx
Unit-V; Pricing (Pharma Marketing Management).pptxUnit-V; Pricing (Pharma Marketing Management).pptx
Unit-V; Pricing (Pharma Marketing Management).pptx
 
Role Of Transgenic Animal In Target Validation-1.pptx
Role Of Transgenic Animal In Target Validation-1.pptxRole Of Transgenic Animal In Target Validation-1.pptx
Role Of Transgenic Animal In Target Validation-1.pptx
 
psychiatric nursing HISTORY COLLECTION .docx
psychiatric  nursing HISTORY  COLLECTION  .docxpsychiatric  nursing HISTORY  COLLECTION  .docx
psychiatric nursing HISTORY COLLECTION .docx
 
Holdier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfHoldier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdf
 
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
 

lecture_20.pptx

  • 2. Announcements • Homework 6 due today. • Homework 7 up on course webpage, due on 11/13. • Recitation quiz on Monday, 11/10 – Will cover material from lectures 18,19,20 • Exams to be returned at end of lecture.
  • 3. Agenda • Last time: – Decimal Adders (5.2) – Comparators (5.3) – Decoders (5.4) – Encoders (5.5) • This time: – Multiplexers (5.6) – Programmable Logic Devices (5.7) – Programmable Read-Only Memories (PROM) (5.8)
  • 4. Multiplexer • Also called data selectors. • Basic function: select one of its 2𝑛 data input lines and place the corresponding information onto a single output line. • 𝑛 input bits needed to specify which input line is to be selected. – Place binary code for a desired data input line onto its 𝑛 select input lines.
  • 5. Realization of 4-to-1 line multiplexer Logic Diagram Truth Table Symbol
  • 6. Realization of 4-to-1 line multiplexer • Alternate description: • Algebraic description of multiplexer: 𝑓 = 𝐼0𝑆1𝑆0 + 𝐼1𝑆1𝑆0 + 𝐼2𝑆1𝑆0 + 𝐼3𝑆1𝑆2 𝐸
  • 7. Building a Large Multiplexer
  • 8. Multiplexers • One of the primary applications of multiplexers is to provide for the transmission of information from several sources over a single path. • This process is known as multiplexing. • Demultiplexer = decoder with an enable input.
  • 10. Logic Design with Multiplexers 𝒙 𝒚 𝒛 𝒇 0 0 0 𝑓0 0 0 1 𝑓1 0 1 0 𝑓2 0 1 1 𝑓3 1 0 0 𝑓4 1 0 1 𝑓5 1 1 0 𝑓6 1 1 1 𝑓7 The Boolean expression corresponding to this truth table can be written as: 𝑓 𝑥, 𝑦, 𝑧 = 𝑓0 ⋅ 𝑥 𝑦 𝑧 + 𝑓1 ⋅ 𝑥 𝑦 𝑧 + 𝑓2 ⋅ 𝑥𝑦𝑧 + 𝑓3 ⋅ 𝑥𝑦𝑧 + 𝑓4 ⋅ 𝑥𝑦 𝑧 + 𝑓5 ⋅ 𝑥𝑦𝑧 + 𝑓6𝑥𝑦𝑧 + 𝑓7 ⋅ 𝑥𝑦𝑧.
  • 11. Logic Design with Multiplexers • The Boolean expression corresponding to this truth table can be written as: 𝑓 𝑥, 𝑦, 𝑧 = 𝑓0 ⋅ 𝑥 𝑦 𝑧 + 𝑓1 ⋅ 𝑥 𝑦 𝑧 + 𝑓2 ⋅ 𝑥𝑦𝑧 + 𝑓3 ⋅ 𝑥𝑦𝑧 + 𝑓4 ⋅ 𝑥𝑦 𝑧 + 𝑓5 ⋅ 𝑥𝑦𝑧 + 𝑓6𝑥𝑦𝑧 + 𝑓7 ⋅ 𝑥𝑦𝑧. • The Boolean expression for an 8-to-1-line multiplexer is: 𝑓 = 𝐼0𝑆2𝑆1𝑆0 + 𝐼1𝑆2𝑆1𝑆0 + 𝐼2𝑆2𝑆1𝑆0 + 𝐼3𝑆2𝑆1𝑆0
  • 12. Logic Design with Multiplexers • If E is logic-1 then the latter is transformed into the former by replacing 𝐼𝑖 with 𝑓𝑖, 𝑆2 with 𝑥, 𝑆1 with 𝑦, and 𝑆0 with z. • Placing 𝑥, 𝑦, 𝑧 on the select lines 𝑆2, 𝑆1, 𝑆0, respectively and placing the functional values 𝑓𝑖 on data input lines 𝐼𝑖. 8-to-1 MUX 𝐼0 𝐼1 𝐼2 𝐼3 𝐼4 𝐼5 𝐼6 𝐼7 𝐸 𝑆2 𝑆1 𝑆0 𝑓 𝑓0 𝑓1 𝑓2 𝑓3 𝑓4 𝑓5 𝑓6 𝑓7 1 𝑥 𝑦 𝑧
  • 13. Example: 𝒙 𝒚 𝒛 𝒇 0 0 0 1 0 0 1 0 0 1 0 1 0 1 1 1 1 0 0 0 1 0 1 1 1 1 0 0 1 1 1 0 8-to-1 MUX 𝐼0 𝐼1 𝐼2 𝐼3 𝐼4 𝐼5 𝐼6 𝐼7 𝐸 𝑆2 𝑆1 𝑆0 𝑓 1 0 1 1 0 1 0 0 1 𝑥 𝑦 𝑧
  • 14. Logic Design with Multiplexers • If at least one input variable of a Boolean function is available in both its complemented and uncomplemented form, any 𝑛-variable function is realizable with a 2𝑛−1-to-1- line multiplexer. • For the case of a 3-variable function, only a 4-to-1 multiplexer is needed. • 𝑓 𝑥, 𝑦, 𝑧 = 𝑓0 ⋅ 𝑥 𝑦 𝑧 + 𝑓1 ⋅ 𝑥 𝑦 𝑧 + 𝑓2 ⋅ 𝑥𝑦𝑧 + 𝑓3 ⋅ 𝑥𝑦𝑧 + 𝑓4 ⋅ 𝑥𝑦 𝑧 + 𝑓5 ⋅ 𝑥𝑦𝑧 + 𝑓6𝑥𝑦𝑧 + 𝑓7 ⋅ 𝑥𝑦𝑧 = 𝑓0 ⋅ 𝑧 + 𝑓1 ⋅ 𝑧 𝑥 𝑦 + 𝑓2 ⋅ 𝑧 + 𝑓3 ⋅ 𝑧 𝑥𝑦 + 𝑓4 ⋅ 𝑧 + 𝑓5 ⋅ 𝑧 𝑥𝑦 + 𝑓6 ⋅ 𝑧 + 𝑓7 ⋅ 𝑧 𝑥𝑦 • When E = 1, 4-to-1 Multiplexer has the form 𝐼0𝑆1𝑆0 + 𝐼1𝑆1𝑆0 + 𝐼2𝑆1𝑆0 + 𝐼3𝑆1𝑆2
  • 15. Logic Design with Multiplexers 𝑓(𝑥, 𝑦, 𝑧) = 𝑓0 ⋅ 𝑧 + 𝑓1 ⋅ 𝑧 𝑥 𝑦 + 𝑓2 ⋅ 𝑧 + 𝑓3 ⋅ 𝑧 𝑥𝑦 + 𝑓4 ⋅ 𝑧 + 𝑓5 ⋅ 𝑧 𝑥𝑦 + 𝑓6 ⋅ 𝑧 + 𝑓7 ⋅ 𝑧 𝑥𝑦 4-to-1 Multiplexer has the form 𝑓 = 𝐼0𝑆1𝑆0 + 𝐼1𝑆1𝑆0 + 𝐼2𝑆1𝑆0 + 𝐼3𝑆1𝑆2 • Realization of 𝑓(𝑥, 𝑦, 𝑧) is obtained by placing the 𝑥 and 𝑦 variables on the 𝑆1, 𝑆0 select lines, the single variable functions 𝑓𝑖 ⋅ 𝑧 + 𝑓𝑗 ⋅ 𝑧 on the data input lines and let E = 1. • Note: 𝑓𝑖 ⋅ 𝑧 + 𝑓𝑗 ⋅ 𝑧 reduce to 0,1,𝑧 or 𝑧.
  • 16. Example 𝒙 𝒚 𝒛 𝒇 0 0 0 1 0 0 1 0 0 1 0 1 0 1 1 1 1 0 0 0 1 0 1 1 1 1 0 0 1 1 1 0 𝑓0 ⋅ 𝑧 + 𝑓1 ⋅ 𝑧 𝑓2 ⋅ 𝑧 + 𝑓3 ⋅ 𝑧 𝑓4 ⋅ 𝑧 + 𝑓5 ⋅ 𝑧 𝑓6 ⋅ 𝑧 + 𝑓7 ⋅ 𝑧 1 𝑥 𝑦
  • 17. Example 𝒙 𝒚 𝒛 𝒇 0 0 0 1 0 0 1 0 0 1 0 1 0 1 1 1 1 0 0 0 1 0 1 1 1 1 0 0 1 1 1 0 𝑧 1 𝑧 0 1 𝑥 𝑦
  • 18. Logic Design with Multiplexers and K- maps • Consider 3-variable Karnaugh map. Assume x is placed on the 𝑆1 line and y is placed on the 𝑆0 line. • We get that the output is: 𝐼0𝑥 𝑦 + 𝐼1𝑥𝑦 + 𝐼2𝑥𝑦 + 𝐼3𝑥𝑦 • 𝐼0𝑥 𝑦 corresponds to those cells in which 𝑥 = 0, 𝑦 = 0 • 𝐼1𝑥𝑦 corresponds to those cells in which 𝑥 = 0, 𝑦 = 1 • 𝐼2𝑥𝑦 corresponds to those cells in which 𝑥 = 1, 𝑦 = 0 • 𝐼3𝑥𝑦 corresponds to those cells in which 𝑥 = 1, 𝑦 = 1
  • 19. K-map representation 𝑆1 = 𝑥 𝑆0 = 𝑦 𝑦𝑧 00 01 11 10 𝐼0 𝐼1 𝐼2 𝐼3 𝐼0 map 0 1 𝑧 𝐼1 map 0 1 𝐼2 map 0 1 𝐼3 map 0 1 𝑧 𝑧 𝑧
  • 20. Example 𝒙 𝒚 𝒛 𝒇 0 0 0 1 0 0 1 0 0 1 0 1 0 1 1 1 1 0 0 0 1 0 1 1 1 1 0 0 1 1 1 0 1 0 1 1 0 1 0 0 𝑆1 = 𝑥 𝑆0 = 𝑦 𝑦𝑧 00 01 11 10 1 0 𝐼0 map 0 1 𝑧 1 1 𝐼1 map 0 1 0 1 𝐼2 map 0 1 0 0 𝐼3 map 0 1 𝑧 𝑧 𝑧 𝐼0 = 𝑧 𝐼1 = 1 𝐼2 = 𝑧 𝐼3 = 0
  • 21. Realization 𝒙 𝒚 𝒛 𝒇 0 0 0 1 0 0 1 0 0 1 0 1 0 1 1 1 1 0 0 0 1 0 1 1 1 1 0 0 1 1 1 0 𝑧 1 𝑧 0 1 𝑥 𝑦
  • 22. Alternative Structures 𝑥 𝑆1 = 𝑦, 𝑆0 = 𝑧 𝑦𝑧 00 01 11 10 𝐼0 𝐼3 𝐼1 𝐼2 𝑆0 = 𝑥 𝑆1 = 𝑦 𝑦𝑧 00 01 11 10 𝐼0 𝐼2 𝐼1 𝐼3 Note that order of variables on input lines matters!
  • 23. 8-to-1-line multiplexers and 4-variable Boolean functions • Can do the same thing, three variables are placed on select lines, inputs to the data lines are single-variable functions. • Example:
  • 24. Can we do better? • By allowing realizations of 𝑚-variable functions as inputs to the data input lines, 2𝑛 - to-1-line multiplexers can be used in the realization of (𝑛 + 𝑚)-variable functions. • E.g.: input variables w and x are applied to the 𝑆1, 𝑆0 select inputs. Functions of the y and z variables appear at the data input lines.
  • 26. Example: 𝑓 𝑥, 𝑦, 𝑧 = ∑𝑚(0,1,5,6,7,9,13,14)
  • 29. Programmable Logic Devices (PLDs) • With the advent of large-scale integration technology, it has become feasible to fabricate large circuits within a single chip. • This has led to devices known as programmable logic devices (PLDs). – Programmable read-only memory (PROM) – Programmable logic array (PLA) – Programmable array logic (PAL)
  • 30. General Structure of PLD • Inputs to the PLD are applied to a set of buffer/inverters. These devices have both the true value of the input as well as the complemented value of the input as its outputs. • Outputs from these devices are the inputs to an array of and-gates. The AND array generates a set of p product terms. • The product terms are inputs to an array of or- gates to realize a set of m sum-of-product expressions.
  • 32. General Structure of PLD • One or both of the gate arrays are programmable. • The logic designer can specify the connections within an array. • PLDs serve as general circuits for the realization of a set of Boolean functions. Device AND-array OR-array PROM Fixed Programmable PLA Programmable Programmable PAL Programmable Fixed
  • 33. Programming a PLD • In a programmable array, the connections to each gate can be modified. • Simple approach is to have each of the gate inputs connected to a fuse. • Gate realizes the product term 𝑎𝑏𝑐𝑑. • To generate the product term 𝑏𝑐 we remove the 𝑎, 𝑑 connections by blowing the corresponding fuses. • Thus, programming is a hardware procedure. Specialized equipment called programmers is needed to carry out the programming of a PLD.
  • 34. Programming a PLD • Erasable PLD—connections can be reset to their original conditions and then reprogrammed. – Can be achieved by exposing the PLD to ultraviolet light or using electrical signals • PLDs programmed by a user are called field programmable. • User can also specify the desired connections and supply the information to the manufacturer. Manufacturer prepares an overlay that is used to complete the connections as the last step in the fabrication process. • Such PLDs are called mask programmable.
  • 35. PLD Notation • Simplified notation. Each gate has only a single input line. • Inputs are indicated by lines at right angles to the single gate lines. • A cross at the intersection denotes a fusible link is intact.
  • 36. PLD Notation • Lack of cross indicates the fuse is blown or no connection exists.
  • 37. PLD Notation • The occurrence of a hard-wired connection that is not fusible is indicated by a junction dot. • For the special case when all the input fuses to a gate are kept intact, a cross is placed inside the gate symbol.