Scribd
Upload
26 views5 pages

Boolean Logic Theory

This document outlines the basic postulates and theorems of Boolean logic, including definitions of key concepts like minterms, implicants, covers, and minimization techniques. It discusses the sum of products and product of sums forms, De Morgan's theorem, the Karnaugh map method, and the Quine-McCluskey method for minimizing Boolean functions.

Uploaded by

lashali1212
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
26 views5 pages

Boolean Logic Theory

This document outlines the basic postulates and theorems of Boolean logic, including definitions of key concepts like minterms, implicants, covers, and minimization techniques. It discusses the sum of products and product of sums forms, De Morgan's theorem, the Karnaugh map method, and the Quine-McCluskey method for minimizing Boolean functions.

Uploaded by

lashali1212
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/ 5

Boolean Logic Theory

Basic postulates
1. a) 0 0 = 0
b) 1 + 1 = 1
2. a) 1 1 = 1
b) 0 + 0 = 0
3. a) 0 1 = 1 0 = 0
b) 1 + 0 = 0 + 1 = 0
4. a) if x = 0, then x = 1
b) if x = 1, then x = 0
5. a) x 0 = 0
b) x + 1 = 1
6. a) x 1 = x
b) x + 0 = x
7. a) x x = x
b) x + x = x
8. a) x x = 0
b) x + x = 1
9. a) (x) = x
10. a) x y = y x
--Commutative
b) x + y = y + x
11. a) x (y z) = (x y) z
--Associative
b) x + (y + z) = (x + y) + z
12. a) x (y + z) = x y + x z
--Distributive
b) x + y z = (x + y) (x + z)
13. a) x + x y = x
--Absorption
b) x (x + y) = x
14. a) x y + x y = x
--Combining
b) (x + y) (x + y) = x
15. a) x y = x + y
--DeMorgans Theorem
b) (x + y) = x y
16. a) x + x y = x + y
b) x (x + y) = x y
17. a) x y + y z + x z = x y + x z
b) (x + y) (y + z) (x + z) = (x + y) (x + z)

2(not 2.9/2.10),4

Duality
Dual of statement obtained by interchanging + and * , and elements 0 and 1. Polarity of elements is left
unchanged.
S=AB + AC +BC
Sd = (A+B)(A+C)(B+C)
S is not equal to Sd , nor is it a negation of S.

Order of operator priority


1.
2.
3.
4.

Parenthesis
Not
And
Or

DeMorgans Theorem
F is found by interchanging True and Complemented variable forms, 0s and 1s, and + and

Logic Synthesis
Definitions
Minterms
A product term in which each of the n variables appears one
Maxterm
Complement of Minterms. Found using DeMorgans theorem.
Sum of Products form
Each Minterm is AND-ed with the corresponding value of F. If each product term is a Minterm, it is a
canonical SOP form. SOP or canonical SOP not necessarily minimal implementation.
Products of Sum form
F represented by sum of Minterms for which F=1 or F=0. Then complement to find representation of F.
Literal
Each appearance of a variable either in true or complemented form
Implicant
A product term that indicated the input valuation(s) for which a given function f is equal to 1.
Prime Implicant
An Implicant that cannot be combined into another Implicant that has fewer literals.
I.E. If you delete a literal in a prime Implicant, it is no longer a valid Implicant.
Essential Prime Implicant
A Prime Implicant that must be included in the cover
Cover
Collection of Implicants that account for all valuations for which F=1. F may have multiple covers.
Set of all Minterms for which F=1
Set of all Prime Implicants etc.

Cost
Total number of inputs to all gates in a cover. Minimum cost is number of literals in Prime Implicants.

Minimization
Procedure
Finding minimum-cost subset of the prime Implicant that will cover the function. Some prime may have
to be included i.e. Essential Prime Implicants, while for others there may be a choice. This choice is
made using a heuristic.
1. Generate set of prime Implicants for F
2. Find set of essential prime Implicants
3. If set of essential prime Implicants covers f then choose this set. Otherwise determine the
nonessential prime Implicants that should be added to for complete minimum-cost cover using
heuristics.
Karnaugh Map
If variable is included in all its possible values in a grouping, it is removed.
Find smallest number of products that cover the function
Draw largest possible rectangular groupings
Cost of each of the product term should be low as possible
Two variable map can have 1,2 or 4 Minterms
Group of 1: 2 literals in product term
Group of 2: 1 literal
Group of 4: 0 literal (Trivial function i.e. F=1 for any input combination)
Minimization of POS forms
Find POS terms for which F=0 and apply minimization as for SOP.
Incompletely defined function
May include Dont Care terms. Should be assigned values to minimize cover.
Multiple Output circuits
Find minimum cost realization of F1 and F2 that includes maximum sharing of common product terms
Cubical representation
Map function of n variables onto an n-dimensional cube.
Edges join vertices that differ in only one variable.
Find edges for which F=1.
N-Cubes contain lower dimensional cubes which in turn contain lower dimensional cubes and so on.
2K adjacent vertices K-Cube
Vertex: 0-cube

Edge: 1-cube
Side: 2-cube
etc
Largest possible K-cubes that exist for given function are its prime Implicants
Quine-McCluskey Method
Tabular method based on cubical representation.
More suitable for computer algorithms
Done in two steps
1. Generation of Prime Implicants

Prime Implicants are the largest possible K-cubes for which either f=1 or Dont Care (D).
Assume F and Ds are specified as Minterms and write them down as vertices I.E. 0-cubes
Compare vertices in pairwise fashion to see if they can be combined into larger cubes I.E
they differ by one variable. Reiterate for each new larger cube generated until Prime
Implicants are found.
As you go, any cube that cannot be combined with another is counted as a Prime Implicant.

2. Determination of minimum Cover


Aim for lowest cost
Construct a prime-Implicant cover table
A row for each prime Implicant
A column for each Minterm to be covered
Put checks to indicate Minterms covered by each Prime Implicant.
If there is a single check in some column, then the prime Implicant that covers the Minterm of
this column is Essential and must be included in final cover.
Remove rows corresponding to essential prime Implicants and the columns of the Minterms
associated with them.
Apply Row Dominance
Only remove dominated Prime Implicants if their cost is higher than the dominating row.
Apply Column Dominance
Remove dominating columns instead of dominated columns.
If reduced cover table is not empty, use branching to determine the remaining prime Implicant
that should be included in minimum cost cover.

You might also like