Scribd
Upload
4 views15 pages

DLD - Lec 5b

The document contains examples of K-map practice for designing digital systems based on specific logical conditions. It includes the design of a system that outputs low for 4-bit multiples of 3 and a voting circuit for a committee decision. Minterm and maxterm expansions are provided for both examples, along with minimized expressions for the circuits.

Uploaded by

fakhar_fast
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
4 views15 pages

DLD - Lec 5b

The document contains examples of K-map practice for designing digital systems based on specific logical conditions. It includes the design of a system that outputs low for 4-bit multiples of 3 and a voting circuit for a committee decision. Minterm and maxterm expansions are provided for both examples, along with minimized expressions for the circuits.

Uploaded by

fakhar_fast
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/ 15

Lecture 5b

K-map Practice
Example 1
Example 2
Example 3
Example 4
Example 5
Example 6
Example 7
Example 8
Design a digital system whose output is defined as logically low if the 4-bit input binary number is
a multiple of 3; otherwise, the output will be logically high. The output is defined if and only if the
input binary number is greater than 2.

● Minterm expansion will be ∑m(4,5,7,8,10,11,13,14) + ∑d (0,1,2)


● Maxterm expansion will be ∏M(3,6,9,12,15) · ∏D (0,1,2)
Example 8 - Contd

Thus, Y = B̅D̅ + A̅C̅ + A̅BD + BC̅D + AB̅C + ACD̅ Thus, Y = (A+B) (B+C+D̅) (A+C̅+D) (A̅+B̅+C+D) (A̅+B̅+C̅+D̅)
Example 8 - Contd
Example 9
Example 9 - Contd
Example 10
Example 10
A committee of three individuals decides issues for the organization. Each
individual can vote either yes or no for each proposal arises. A proposal is passed
if it receives at least two votes. Design a circuit that determines whether a
proposal passes. Minimize the circuit.

F(x,y,z)= xyz + xyz’ + xy’z + x’yz x y z F

After minimization the expression 1 1 1 1

1 1 0 1
reduces to = xy + xz + yz
1 0 1 1

0 1 1 1

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy