Scribd
Upload
9 views22 pages

3. Boolean Expressions

Network Parameters - Impedance, Admittance, Hybrid and Transmission Parameters, Conditions for reciprocity and symmetry, relation between various two port network parameters.UNIT – 1 DC GENERATORS 1)With neat diagram explain the constructional features of DC machine. (10M, L1) 2) Explain with the help of a diagram the construction of DC Machine detailing the importance of each part. 11)Explain in detail the characteristics of DC Shunt generators with n

Uploaded by

2305a21050
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
9 views22 pages

3. Boolean Expressions

Network Parameters - Impedance, Admittance, Hybrid and Transmission Parameters, Conditions for reciprocity and symmetry, relation between various two port network parameters.UNIT – 1 DC GENERATORS 1)With neat diagram explain the constructional features of DC machine. (10M, L1) 2) Explain with the help of a diagram the construction of DC Machine detailing the importance of each part. 11)Explain in detail the characteristics of DC Shunt generators with n

Uploaded by

2305a21050
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/ 22

• Boolean expression can be represented by

1. Sum of Products (SOP) form


2. Product of Sum (POS) form
SOP: AB+AC
POS: (A+B)+(A+C)
These SOP and POS expressions are not in standard form.

Canonical or Standard form of Boolean expression


• In Canonical or Standard form of Boolean expression, each term of
Boolean expression must contain all the literals (with and without bar).
• If the above condition is satisfied by Boolean expression, that is called
Canonical or Standard form of Boolean expression
Q. Convert AB+AC in canonical or standard SOP form

Q. Convert (A+B)+(A+C) in canonical or standard POS form

Using Distribution Law


A + (B.C) = (A + B) . (A + C)
Min-term
• Individual term of canonical sum of products(SOP) is called
Minterm.
• Minterm is a product of all the literals(with or without bar)
within the Boolean expression.

Max-term
• Individual term of canonical Product of sum (POS) is called
Maxterm.
• Maxterm is a sum of all the literals(with or without bar) within
the Boolean expression.
F = Π A, B, C (1, 4, 6) = (A + B + C) * (A + B’ + C’) * (A + B’ + C’)
Simplification (Minimization) of Boolean
expression
•Two ways to reduce Boolean expression
1. Algebraic
2. 2. Karnaugh Map( K-Map)

•In Algebraic method, different boolean rules and theorems are


used to minimize the boolean expression.
•In Algebraic method, there is no best and fast rule to minimize the
Boolean expression.

•The k-map is a graphical technique for simplifying Boolean


function. They are the visual representation of a truth table.
•In Karnaugh map, there are some rules if you follow those rules,
then we will definitely get a minimum form expression
Simplification of Boolean expression by K-Map
• The Karnaugh map or k-map is a graphical technique for
simplifying Boolean function. They are the visual
representation of a truth table.
• 2 variable k-map for SOP and POS form are as follows: –
3 variables k-map for SOP and POS form are as follows: –

It is not the binary ascending order, but it is in gray code. In this


type of coding where only one bit changes between successive
terms.
• 3 variables k-map for SOP and POS form are as
follows: –
4 variable k-map for SOP and POS form
are as follows: –
Rules
• To reduce Boolean expression first we have to mark pairs,
quads and octets.
• pair means group of 2 ones, quad means group of 4 ones, and
Octet means the group of 8 ones.
• It is important that to get the optimum reduction, priority is
given to the octet first then quad and then pair.

• When a variable change it is polarity, that variable gets eliminated


2-variable K- Map simplification

• Adjacent 1s can be paired off


• Pairs can be made adjacent horizontally or vertically.

• When a variable change it is polarity, that variable gets eliminated


• Reduce the function y(A,B,C) = Σ (0,1,3,6,7)

• Reduce the given function y = Σ (4,5,7)


Simply the sop function F(A,B,C) = Σ (2,4,6)

Simply the sop function F(A,B,C) = Σ (1,3,5,7)


• 𝐴𝐵𝐶 + 𝐴𝐵𝐶 ′ + 𝐴 ′𝐵𝐶 + 𝐴 ′𝐵𝐶 ′ = ∑(7,6,3,2)
• F (A, B, C, D) = ∑(0, 2, 5, 7, 8, 10, 13, 15)

(BD + B’D’)
• A Boolean function that has some of the terms as don’t cares, in that case,
the outputs are undefined. we don’t care whether the logic value
produced is 0 or 1.
• In a K-map, consider don't cares as either 1s or 0s, or ignore them
altogether when groups are not forming.

You might also like