34 views

Uploaded by kstu1112

- A 04220106
- Hazard
- Computer Organization
- Final Review
- exp86f
- LECTURE 1. What-AreEmbeddedSystems
- circuits
- MCQ3 DC Boolean Algebra and Logic Simplification
- investigation 1
- 2.01) Add Math Module 01 (Functions)
- LN5_Kmap
- codigos
- VLSI Lab Manual
- Sr05220403 Switching Theory and Logic Design
- Functions
- 02ext2
- Conf
- Question Paper
- Project PascalsSurprises
- 4-5

You are on page 1of 3

Lesson Objectives:

In this lesson you will learn:

2. How to get a minimized POS function using a K-map.

3. How to minimize a combinational circuit that is not completely specified (has don't

care conditions).

4. How to make a 5 and 6 variable K-map given a truth table or a SOP representation.

Definitions/Notations:

A product term of a function is said to be an implicant.

possible number of adjacent 1-squares in the map.

If a minterm is covered only by one prime implicant then this prime implicant is said

to be an Essential Prime Implicant (EPI).

POS Simplification:

Until now we have derived simplified Boolean functions from the maps in SOP form.

Procedure for deriving simplified Boolean functions POS is slightly different. Instead

of making groups of 1’s, make the groups of 0’s.

Since the simplified expression obtained by making group of 1’s of the function (say

F) is always in SOP form. Then the simplified function obtained by making group of

0’s of the function will be the complement of the function (i.e., F’) in SOP form.

In some cases, the function is not specified for certain combinations of input variables

as 1 or 0.

1. The input combination never occurs.

2. The input combination occurs but we do not care what the outputs are in response

to these inputs.

In both cases, the outputs are called as unspecified and the functions having them are

called as incompletely specified functions.

In most applications, we simply do not care what value is assumed by the function for

unspecified minterms.

Unspecified minterms of a function are called as don’t care conditions. They provide

further simplification of the function, and they are denoted by X’s to distinguish them

from 1’s and 0’s.

In choosing adjacent squares to simplify the function in a map, the don’t care

minterms can be assumed either 1 or 0, depending on which combination gives the

simplest expression.

A don’t care minterm need not be chosen at all if it does not contribute to produce a

larger implicant.

Five-Variable K-Maps:

There are 32 minterms for a Boolean function with five-variables. Hence, Five-

variable map consists of 32 squares.

indicated on the top of the diagram. The left-hand four-variable map represents the 16

squares where A=0, and the other four-variable map represents the squares where

A=1.

Minterms 0 through 15 belong to the four-variable map with A=0 and minterms 16

through 31 belong to the four-variable map with A=1.

Each four-variable map retains the previously defined adjacency when taken

separately. In addition, each square in the A=0 map is adjacent to the corresponding

square in the A=1 map. For example, minterm 4 is adjacent to minterm 20 and

minterm 15 to 31.

The best way to visualize this new rule for adjacent squares is to consider the two half

maps as being one on top of the other. Any two squares that fall one over the other are

considered adjacent.

Six-Variable K-Maps:

There are 64 minterms for a Boolean function with six-variables. Hence, Six-variable

map consists of 64 squares.

By following the procedure used for the five-variable map, it is possible to construct a

six-variable map with 4 four-variable maps to obtain the required 64 squares.

- A 04220106Uploaded byInternational Journal of computational Engineering research (IJCER)
- HazardUploaded byTimmy Ocanto
- Computer OrganizationUploaded byRenu Raj
- Final ReviewUploaded byhuyeb
- exp86fUploaded byjhangm
- LECTURE 1. What-AreEmbeddedSystemsUploaded byg_gayatri
- circuitsUploaded byJhornalyn Sison
- MCQ3 DC Boolean Algebra and Logic SimplificationUploaded bysreekantha
- investigation 1Uploaded byapi-320878080
- 2.01) Add Math Module 01 (Functions)Uploaded bycikguruzana
- LN5_KmapUploaded by謝君揚
- codigosUploaded byCesar Geronimo
- VLSI Lab ManualUploaded bysruthigummadi
- Sr05220403 Switching Theory and Logic DesignUploaded byandhracolleges
- FunctionsUploaded byChandra Sekhar
- 02ext2Uploaded byapi-3706821
- ConfUploaded bynagaidl
- Question PaperUploaded byVivek Singh
- Project PascalsSurprisesUploaded byc1311938
- 4-5Uploaded bysarasmile2009
- Domain and RangeUploaded byodette_7th
- cc alg 2 syllabus 2014Uploaded byapi-262893996
- Theoretical Concepts of CalculusUploaded byManjuThottam
- second lesson plan - jacob davolUploaded byapi-413047542
- banaagUploaded byapi-245174502
- 3 4 definite integralsUploaded byapi-299265916
- Set 1Uploaded byHusain Qutbuddin
- Section 3.2 Page 157 to 167Uploaded byKnoll711
- unit objectives-functions finalUploaded byapi-245023409
- 91768v00_C_constructsUploaded bythambigan

- 2-Lecture Notes Lesson3 7Uploaded bykstu1112
- 4-Homeworks_HW_1_coe_081_202_02Uploaded bykstu1112
- 2-Lecture Notes Lesson5 3Uploaded bykstu1112
- Junction Diode07Uploaded bykstu1112
- bgpUploaded bykstu1112
- 2-Lecture Notes Lesson3 6Uploaded bykstu1112
- Lab ManualUploaded bykstu1112
- 2-Lecture Notes Lesson1 3Uploaded bykstu1112
- 2-Lecture Notes Lesson5 4Uploaded bykstu1112
- 2-Lecture Notes Lesson5 2Uploaded bykstu1112
- 2-Lecture Notes Lesson3 1Uploaded bykstu1112
- 1elec_1Uploaded byhatim5
- CODF_v02bUploaded byajaysatija
- 2-Lecture Notes Lesson3 5Uploaded bykstu1112
- adhocUploaded bykstu1112
- 2-Lecture Notes Lesson1 4Uploaded bykstu1112
- 2-Lecture Notes Lesson2 3Uploaded bykstu1112
- 4-Homeworks_HW_2_coe_081_202_02Uploaded bykstu1112
- 2-Lecture Notes Lesson4 2Uploaded bykstu1112
- 2-Lecture Notes Lesson2 2Uploaded bykstu1112
- 3-Presentations COE 081 202 Com Bi National LogicUploaded bykstu1112
- 2-Lecture Notes Lesson2 4Uploaded bykstu1112
- 2-Lecture Notes Lesson2 7Uploaded bykstu1112
- 4-Homeworks_HW_1_coe_081_202_02_solUploaded bykstu1112
- 1-Syllabus Coe 081 202 01 SyllabusUploaded bykstu1112
- 2-Lecture Notes Lesson2 6Uploaded bykstu1112
- 2-Lecture Notes Lesson1 1Uploaded bykstu1112
- 4-Homeworks_HW_3_coe_081_202_02Uploaded bykstu1112
- 3-Presentations COE 081 202 MemoryAndPLDsUploaded bykstu1112

- What is Gendered LanguageUploaded byMaria Agustina Sabaté
- Nq 41608Uploaded byomelbat-1
- D67238GC20_sg1.pdfUploaded bydsocol
- Reinforced Concrete Design of Tall Buildings (Section 2.3.5 Deep Beams).pdfUploaded byKhuất Trần Thanh
- CHAPTER SEVEN: The Infinitive ConstructUploaded bysteffen han
- bcrUploaded byMarvin Marquez
- 166033852-Digi-Port-Server-Ts-h-Mei.pdfUploaded byMaxi Rojas
- u2-fcUploaded byCADTDD
- Azure Cross Database Query and Comparison with LINQUploaded byInternational Journal for Scientific Research and Development - IJSRD
- English Vocabulary Organiser With KeyUploaded byPermento Lacrane
- Css ResponsiveUploaded bysdfg
- Primary Members of PlasticsUploaded bySanket Aiya
- Medieval Tendai Thought and the New Kamakura BuddhismUploaded byJacob Barger
- L1 V5 21 PolDoc HMI Tool Overview G 01Uploaded byCarlos-AugustoVictorious
- Conductismo, cognitivismo y constructivismo. Tres posturas desde la labor.Uploaded byHeriberto Escobar Samaniego
- IRON MAN OIKODOME - "FULLY CONVINCED"Uploaded byIRON MAN OIKODOME
- Allen BradleyUploaded byNorasad Rafiq Lim Saari
- Sc72 Application DeveloperUploaded byVanchAlexCarrasco
- Cambridge English Empower A2_Unit_7Uploaded bygreenforever999
- Adjective SuffixesUploaded byEspePlanelles
- Frenetic Programmer's GuideUploaded byMohannad Alharthi
- Speech Comm Course ModuleUploaded byMaria Divinagracia Justiniano Cantuba
- TeamViewer Manual MSI DeploymentUploaded byTibor Danku
- AndroidUploaded bySai Sandeep
- Free PDF Quran for MobileUploaded byJason
- at90s851555Uploaded bymike_helpline
- ASp.net 4.0Uploaded byHarish
- [Ellie Sullivan] the Logic of Sexuation orgUploaded byDavid Parra
- 11g Embedded Whitepaper 166560Uploaded byfooddummy
- VB CodeUploaded byLisa Griffin