Scribd
Upload
11 views

dcf module2 points

Uploaded by

shihankv807
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

dcf module2 points

Uploaded by

shihankv807
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

1.

Boolean Algebra
Definition
 Boolean Algebra is used to analyse and simplify the
digital (logic) circuits. It uses only the binary OR AND
numbers i.e. 0 and 1. 
 It is an algebraic structure defined on a set of at least operat operat
two elements B = {0, 1}, together with three binary or
operators NOT
( “+”, “.”, “-” ) operator

Absorption law 1. Two-valued Boolean Algebra


A+(A.B)=A
A.(A+B)=A A two‐valued Boolean algebra is defined on a set of
two elements, B = {0, 1}, with rules for binary
Idempotence law operators + , . , - (OR,AND &NOT), with truth table
A +A=A as below.
A .A=A
Redundant Literal Rule (RLR)
A+A’B=A+B
A(A’+B) =AB
Consensus Theorem
AB + A’C + BC = AB + A’C
(A + B) + (A’ + C) + (B + C) = (A + B) + (A’ + C)
Sum of Product (SOP) Form Product of Sums (POS) Form
All these sum terms are ANDed (multiplied) together
• A sum-of-products form can be formed by adding (or to get the product-of-sum form. This form is exactly
summing) two or more product terms using a opposite to the SOP form.
Boolean addition operation. • Writing the input variables if the value is 0, and write
the complement of the variable if its value is 1.
• Writing the input variables if the value is 1 , and write
the complement of the variable if its value is 0.
Ex: Boolean expression for function F = (A + B + C)
• Ex: Boolean expression f(A,B,C)= A’BC + AB’C (A + B + C ‘) (A + B’ + C) (A’ + B + C)
+ ABC ‘ + ABC By taking binary values expression can be written as 
By taking binary values expression can be written (0+0+0)(0+0+1)(0+1+0)(1+0+0) In truth table mark 1
as 011+101+110+111 In truth table mark 1 corresponding to the terms in the expression.
corresponding to the terms in the expression.

A B C OUTPUT

0 0 0 0
A B C Y / OUTPUT
0 0 1 0
0 0 0 0
0 0 1 0 0
0 1 0
0 1 0 0
0 1 1 1 0 1 1 1
1 0 0 0
1 0 0 0
1 0 1 1
1 1 0 1 1
1 0 1
1 1 1 1
1 1 0 1

Canonical SOP Converting POS to canonical POS form


ADD by ( X X’) where X is the missing variable
If each term in SOP contains all the literals then Repeat above steps until all resulting sum terms contains
these are known as canonical(standard) SOP
all the variable in either complimented or normal form
expression
 Multiply each SOP by ( X + X’) where X is the
missing variable & expand
Repeat above steps until all resulting product
terms contains all the variable in either
complimented or normal form

Min term(m) or( ∑ ) • MAXTERM( M ) or ( П )


• Each individual product term in SOP is • Each individual sum term in POS is called
called minterm( m0,m1,m2..) maxterm(M1,M2,M3….)
0A’ 0A
1A 1A’

• A’B’ , A’B , AB’ & AB • These are the sum terms which contains all
• Each of these four AND terms is called a the variables in either normal form or
minterm or standard product compliment form
• 2^n different minterm can be obtained by • 2^n different maxterm can be obtained by
writing the binary equivalent of numbers writing the binary equivalent of numbers
2-Variable K MAP
KARNAUGH MAP (K MAP)

 A Karnaugh map or a K-map refers to a pictorial


method that is utilized to minimize various Boolean
expressions without using the Boolean algebra
theorems along with the equation manipulations.
 A Karnaugh map can be a special version of the
truth table.
Solving an Expression Using K-Map
1. Select a K-map according to the total number of
variables. 3Variable K MAP
2. Identify maxterms or minterms as given in the
problem.
3. For SOP, put the 1’s in the blocks of the K-map
with respect to the minterms (elsewhere 0’s).
4. For POS, putting 0’s in the blocks of the K-map
with respect to the maxterms (elsewhere 1’s)
5. Making rectangular groups that contain the total
terms in the power of two, such as 2,4,8 ..
6. From the groups that have been created in step 5,
find the product terms and then sum them up for
the SOP form. Or find the sum terms and multiply
them for POS form

Don’t Care Conditions


The “Don’t Care” conditions allow us to replace the empty SOP including don’t POS including don’t care
cell of a K map to form a grouping of the variables which care
is larger than that of forming groups without don’t care. f = m(1, 5, 6, 11, F(A, B, C, D) = M(6, 7, 8, 9)
While forming groups of cells, we can consider a “Don’t 12, 13, 14) + d(4) + d(12, 13, 14, 15)
Care” cell as 1 or 0 or we can also ignore that cell.
A Don’t Care cell can be represented by a cross(X)
Logic Gates BASIC GATES
 Logic gate is an electronic circuit which makes
logic decisions
 It have only one output and two or more inputs
except for the not gate, which has only one input
 3 basic logic gates: are OR gate , NOT gate, AND
gate
 Input and output relationship can be represented in
a tabular form in a truth table

NOT
GATE /

UNIVERSAL GATES,EX-OR, and EX-NOR

NAND and NOR gates are called UNIVERSAL GATES, because all other gates can be realised using the
NAND and NOR gates.
Implement NOT,AND,OR ,Ex-OR, Ex-NOR NAND gates

NOT USING NAND OR USING NAND AND USING NAND

Ex-OR USING NAND Ex-NOR USING NAND

You might also like