Docsity
Log inSign up
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Simplification by the K-Map Method, Lecture notes of Engineering

Wayne State CollegeEngineering

System level design of digital logic circuits using hardwired and programmable logic devices. ROMs, PROMs, and PLAs. Synchronous and asynchronous circuit design and analysis.

Typology: Lecture notes

2021/2022

Available from 12/22/2022

galaxy-a-1
galaxy-a-1 🇺🇸

13 documents

1 / 42

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
KMap 1
Simplification by the K-Map Method
(Section 3.5 Dueck)
•Karnaugh Map (K-Map) is a tool used in
digital circuit analysis and design in order to
simplify a logic equation (instead of using
Boolean algebra).
•It is a graphical representation of the output
for each input combination for a given logic
function.
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a

Partial preview of the text

Download Simplification by the K-Map Method and more Lecture notes Engineering in PDF only on Docsity!

KMap^

Simplification by the K-Map Method

(Section 3.5 Dueck)

•Karnaugh Map (K-Map) is a tool used indigital circuit analysis and design in order tosimplify a logic equation (instead of usingBoolean algebra). •It is a graphical representation of the outputfor each input combination for a given logicfunction.

KMap^

KMap^

KARNAUGH MAPPING

•A K-Map derives either the simplified SOP or POS formof the expression from the truth table. •The simplification is done graphically using the K-map. •The correct labeling of input values on the K-map iscritical. •The labeling is done to assure that there is only oneinput variable that changes between adjacent cells.

KMap^

2-variable Truth table A B^ 0 0^ 0 1^ 1 0^ 1 1

KMap^

2-variable K-map

B A 0 1

A’B’^

A’B

AB’^

AB

KMap^

3-variable K-map C^ A B^0

KMap^

SOP Simplification using K-Maps • Group the adjacent 1’s; maximize the size of the groupsbut minimize the number of groups. • All 1’s in the output must be included in a group; evenif it is only a group of one cell. •Each AND term is written with only the input variablescommon to the group. •Form the final SOP expression by ORing all AND terms.

KMap^

Ex1 (Problem 3.31)

Use the K-Map method to find the maximum SOP simplificationof the logic diagram in Fig. 3.21.

KMap^

13

Ex1 (3.31) F(A,B,C,D) =

Σm ( 0,1,3,8,10,12,13,

KMap^

Ex1 (3.31)

F(A,B,C,D) =

Σ^ m (0,1,3,8,10,12,13,14)

KMap^

Ex1 (3.31)

KMap^

Ex1 (3.31)

F(A,B,C,D) = A’B’D+ABC’+AD’+A’B’C’

SOP simplification

KMap^

Ex2 (3.32c)

Use the K-Map method to reduce the following Booleanexpression to their maximum SOP simplification:^ F(A,B,C) =A’B’C’+A’BC+ABC+AB’C

F(A,B,C) =A’B’C’+BC+AC

KMap^

Ex3 (Problem 3.35)

Use the K-Map method to reduce the following Booleanexpression represented by the following truth table to simplestSOP form.