- The document discusses Boolean algebra and its properties.
- Boolean algebra defines binary operators for logical operations like AND (.) and OR (+). It also defines identities and inverses.
- The algebra can be represented by truth tables to show it obeys properties like closure, identity, inverse, commutative, associative, and distributive laws.
- Boolean functions and expressions can be simplified, converted to canonical and standard forms using sums of minterms and products of maxterms.
Lesson 2 : Logic Gates and Boolean Algebra
Part 1
Content:
1 .Boolean Theorem
2. Logic gates and Universal gates
Part 2
Content :
1. Standard SOP and POS
forms
2. Minterms and Maxterms
3. Karnaugh Map
P.S. Part 2 content will be uploaded later
Lesson 2 : Logic Gates and Boolean Algebra
Part 1
Content:
1 .Boolean Theorem
2. Logic gates and Universal gates
Part 2
Content :
1. Standard SOP and POS
forms
2. Minterms and Maxterms
3. Karnaugh Map
P.S. Part 2 content will be uploaded later
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Event Management System Vb Net Project Report.pdfKamal Acharya
In present era, the scopes of information technology growing with a very fast .We do not see any are untouched from this industry. The scope of information technology has become wider includes: Business and industry. Household Business, Communication, Education, Entertainment, Science, Medicine, Engineering, Distance Learning, Weather Forecasting. Carrier Searching and so on.
My project named “Event Management System” is software that store and maintained all events coordinated in college. It also helpful to print related reports. My project will help to record the events coordinated by faculties with their Name, Event subject, date & details in an efficient & effective ways.
In my system we have to make a system by which a user can record all events coordinated by a particular faculty. In our proposed system some more featured are added which differs it from the existing system such as security.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Automobile Management System Project Report.pdfKamal Acharya
The proposed project is developed to manage the automobile in the automobile dealer company. The main module in this project is login, automobile management, customer management, sales, complaints and reports. The first module is the login. The automobile showroom owner should login to the project for usage. The username and password are verified and if it is correct, next form opens. If the username and password are not correct, it shows the error message.
When a customer search for a automobile, if the automobile is available, they will be taken to a page that shows the details of the automobile including automobile name, automobile ID, quantity, price etc. “Automobile Management System” is useful for maintaining automobiles, customers effectively and hence helps for establishing good relation between customer and automobile organization. It contains various customized modules for effectively maintaining automobiles and stock information accurately and safely.
When the automobile is sold to the customer, stock will be reduced automatically. When a new purchase is made, stock will be increased automatically. While selecting automobiles for sale, the proposed software will automatically check for total number of available stock of that particular item, if the total stock of that particular item is less than 5, software will notify the user to purchase the particular item.
Also when the user tries to sale items which are not in stock, the system will prompt the user that the stock is not enough. Customers of this system can search for a automobile; can purchase a automobile easily by selecting fast. On the other hand the stock of automobiles can be maintained perfectly by the automobile shop manager overcoming the drawbacks of existing system.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
Quality defects in TMT Bars, Possible causes and Potential Solutions.
Chapter2 (1).pptx
1. Devang Patel Institute of Advance Technology and Research
CE252 : Digital Electronics
AY : 2022-23
Chapter 2
Boolean Algebra
Presented By :
Prof. Bhavika Patel
DEPSTAR, FTE
2.
3. Binary Operator: A Binary Operator defined on a set S of
elements is a rule that assigns to each pair of elements from S a
unique element from S.
i.e. Consider the relation, a * b = c
* is a binary operator, if it specifies a rule, for finding c from the
pair (a,b), and also a,b,c∈S.
However, * is not a binary operator if a, b ∈S , while the rule
finds c ∈ S
4. Postulates: Assumptions
1. Closure: A set is closed with respect to a binary operator if,
for every pair of elements of S, the binary operator specifies
a rule for obtaining a unique element of S.
for the set of Natural Numbers N = {1,2,3,4,5…….}
N is closed with binary operator (+) for a,b ∈ N we obtain
unique c ∈ N
But N is not closed with Binary operator (-)
because 2 – 3 = -1 when -1 ∈ N
5. 2. Associative Law : A binary operator (*) on a set S is said to be associative
whenever
(X * Y) * Z = X * (Y * Z) for all X,Y,Z ∈ S
3. Commutative Law: A binary operator (*) on a set S is said to be commutative
whenever
X * Y = Y * X for all X,Y ∈ S
4. Identity Element: A set S is to have an identity element with respect to a
binary operation (*) on S, if there exists an element E ∈ S with the property
E * X = X * E = X for every X ∈ S
i.e. 0 is identity element with respect to operation ( + )
0 + X = X + 0 = X for every X ∈ S
6. 5. Inverse: If a set S has the identity element E with respect to a binary
operator (*), there exists an element X ∈ S, which is called the inverse,
for every Y ∈ S, such that
X * Y = E
i.e. In the set of integers I with E = 0, the inverse of an element X is
(-X) since
X + (–X) = 0
6. Distributive Law: If (*) and (+) are two binary operators on a set S, (*)
is said to be distributive over (+), whenever
A * (B + C) = (A * B) + (A * C)
7. SUMMARY
The binary operator (+) defines addition.
The additive identity is 0.
The additive inverse defines subtraction.
The binary operator (.) defines multiplication.
The multiplication identity is 1.
The multiplication inverse of A is 1/A, defines division i.e., A . 1/A = 1
The only distribution law applicable is that of (.) over (+)
A . (B + C) = (A . B) + (A . C)
8. DEFINITION OF BOOLEAN ALGEBRA
In 1854 George Boole introduced a systematic approach of logic and developed an
algebraic system to treat the logic functions, which is now called Boolean
algebra.
In 1938 C.E. Shannon developed a two-valued Boolean algebra called Switching
algebra, and demonstrated that the properties of two-valued or bistable
electrical switching circuits can be represented by this algebra.
9. The following postulates are satisfied for the definition of Boolean algebra on a set
of elements S together with two binary operators (+) and (.)
1. (a) Closure with respect to the operator (+).
(b) Closure with respect to the operator (.).
2. (a) An identity element with respect to + is designated by 0 i.e.,
X + 0 = 0 + X = X
(b) An identity element with respect to . is designated by 1 i.e.,
X . 1 = 1 . X = X
3. (a) Commutative with respect to (+), i.e., X + Y = Y + X
(b) Commutative with respect to (.), i.e., X . Y = Y . X
10. 4. (a) (.) is distributive over (+), i.e., X . (Y + Z) = (X . Y) + (X . Z)
(b) (+) is distributive over (.), i.e., X + (Y .Z) = (X + Y) . (X + Z)
5. For every element X ∈ S, there exists an element X' ∈ S (called the
complement of X) such that X + X’ = 1 and X . X’ = 0
6. There exists at least two elements X,Y ∈ S, such that X is not equal to Y
i.e. In Boolean algebra 0 & 1
11. TWO-VALUED BOOLEAN ALGEBRA
Two-valued Boolean algebra is defined on a set of only two elements,
S={0,1}, with rules for two binary operators (+) and (.) and inversion or
complement as shown In the following operator tables at Figures 1, 2, and 3
respectively.
12. 1. Closure is obviously valid, as form the table it is observed that the result of each
operation is either 0 or 1 and 0,1 ∈ S.
2. From the tables, we can see that
(i) X + 0 = 0 + X = X 0 + 0 = 0 + 0 = 0 1 + 0 = 0 + 1 = 1
(ii) X . 1 = 1 . X = X 1 . 1 = 1 . 1 = 1 0 . 1 = 1 . 0 = 0
which verifies the two identity elements 0 for (+) and 1 for (.) as defined by
postulate 2.
3. The commutative laws are confirmed by the symmetry of binary operator tables.
X + Y = Y + X
1 + 0 = 0 + 1
13. 4. The distributive laws of (.) over (+) i.e., A . (B+C) = (A . B) + (A . C), and (+) over (.)
i.e., A + ( B . C) = (A+B) . (A+C) can be shown to be applicable with the help of the
truth tables considering all the possible values of A, B, and C as under. From the
complement table it can be observed that
14. (C) A + A’ = 1, since, 0 + 0’= 0 + 1 = 1 1 + 1’ = 1 + 0 = 1
(D) A . A’ = 0, since, 0 . 0’ = 0 . 1 = 0 1 . 1’ = 1 . 0 = 0
5. Postulate 6 also satisfies two-valued Boolean algebra that has two distinct
elements 0 and 1 where 0 is not equal to 1
15. BASIC PROPERTIES AND THEOREMS OF BOOLEAN ALGEBRA
Principle of Duality
From postulates, it is evident that they are grouped in pairs as part (a) and (b) and
every algebraic expression deductible from the postulates of Boolean algebra
remains valid if the operators and identity elements are interchanged.
This means one expression can be obtained from the other in each pair by
interchanging every element i.e., every 0 with 1, every 1 with 0, as well as
interchanging the operators i.e., every (+) with (.) and every (.) with (+). This
important property of Boolean algebra is called principle of duality.
i.e. 0 <->1 & + <-> .
(a) 0 . 1 = 0 <-> (b) 1 + 0 = 1
i.e. (b) is dual of (a)
16. The following is the complete list of postulates and theorems useful for two-valued
Boolean algebra
17. Theorem 1(a): A + A = A
A + A = (A + A).1 by postulate 2(b)
= (A + A) . ( A + A’) by postulate 5(a)
= A + (A.A’) by postulate 4(b)
= A + 0 by postulate 5(b)
= A by postulate 2(a)
Theorem 1(b): A . A = A
A . A = (A . A) + 0 by postulate 2(a)
= (A . A) + ( A . A’) by postulate 5(b)
= A (A + A’) by postulate 4(a)
= A . 1 by postulate 5(b)
= A by postulate 2(b)
18. Theorem 2(a): A + 1 = 1
Theorem 2(b): A . 0 = 0 by Duality
Theorem 6(a): A + A.B = A
A + A.B = A . 1 + A.B by postulate 2(b)
= A ( 1 + B) by postulate 4(a)
= A . 1 by theorem 2(a)
= A by postulate 2(b)
Theorem 6(b): A ( A + B ) = A by Duality
Venn Diagram
19. • Truth tables :
Both sides of the relation are checked to yield identical results for all possible
combinations of variables involved.
The following truth table verifies the 6(a) absorption theorem.
Following Truth Table verifies the De Morgan’s theorem (x+y)’=x’.y’
X Y XY X+XY
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1
X Y X+Y (X+Y)’ X’ Y’ X’Y’
0 0 0 1 1 1 1
0 1 1 0 1 0 0
1 0 1 0 0 1 0
1 1 1 0 0 0 0
20. • BOOLEAN FUNCTIONS
Binary variables have two values, either 0 or 1.
A Boolean function is an expression formed with binary variables, the two binary
operators AND and OR, one unary operator NOT, parentheses and equal sign.
The value of a function may be 0 or 1, depending on the values of variables present
in the Boolean function or expression. For example, if a Boolean function is
expressed algebraically as
F = AB’C
then the value of F will be 1, when A = 1, B = 0, and C = 1.
For other values of A, B, C the value of F is 0
21. Boolean functions can also be represented by Truth Tables. A truth table is the
tabular form of the values of a Boolean function according to the all possible
values of its variables. For an n variable, 2n combinations of 1s and 0s are listed
and one column represents function values according to the different
combinations of variables
For example, for three variables the Boolean function F = AB + C truth table can be
written as below in Figure
22. SIMPLIFICATION OF BOOLEAN EXPRESSIONS
• Simplify the Boolean function F = X + (X’ . Y)
= (X + X’) . (X + Y) (4(b))
= 1 . (X + Y) (5(b))
= X + Y (2(b))
• Simplify the Boolean function F = X . (X’+Y)
= (X . X’) + (X . Y)
= 0 + (X . Y)
= (X . Y)
• Simplify the Boolean function F = (X’ . Y’ . Z) + (X’ . Y . Z) + (X . Y’)
= (X’ . Z)(Y’ + Y) + (X . Y’)
= (X’ .Z) . 1 + (X . Y’)
Implementation of Boolean functions with gate (Circuit)
23. Simplify following Boolean Function into minimum
number of Literals and Draw Circuit Diagram using
AND, OR and NOT Gate
1. F=xy+x’z+yz
2. F=(x+y)(x’+z)(y+z)
3. F=xy+xy’
4. F=xyz+x’y+xyz’
5. F=y(wz’+wz)+xy
6. F=(a + b)' (a' + b')’
7. F = BC + AC' + AB + BCD
24. Canonical And Standard Forms
Boolean function expressed as a sum of minterms or product of
maxterms are said to be canonical form.
Standard form: Sum Of Product (SOP) : AB’ + AC’ + ABC
Product Of Sum (POS) : (A + B’) ▪ (A +C’) ▪ (A + B + C)
SUM -> OR gate
PRODUCT -> AND gate
25. Minterm
A product term containing all N variables of the function in either true or
complemented form is called the minterm. Each minterm is obtained by an AND
operation of the variables in their true form or complemented form.
For a two-variable function, four different combinations are possible, such as, A’B’,
A’B, AB’, and AB. These product terms are called the fundamental products or
standard products or minterms.
Note that, in the minterm, a variable will possess the value 1, if it is in true or
uncomplemented form, whereas, it contains the value 0, if it is in complemented
form .
Symbol for Minterm is mj, where j denotes the decimal equivalent of binary
number
26. • For three variables function, eight minterms are possible as listed in the following
table in Figure
27. Sum of Minterms
F = A + B’C
A = A (B + B’)
= AB + AB’
= AB(C +C’) + AB’(C + C’)
= ABC + ABC’ + AB’C + AB’C’
B’C = B’C (A +A’) = AB’C + A’B’C
F = ABC + ABC’ + AB’C + AB’C’ + AB’C + A’B’C
= ABC + ABC’ + AB’C + AB’C’ + A’B’C
= A’B’C + AB’C’ + AB’C + ABC’ + ABC
= m1 + m4 + m5 + m6 + m7
F (A,B,C) = Σ (1, 4, 5, 6, 7)
28. Steps to obtain Sum of MINTERMS
• Find out how many variables is there in equation
• List out all minterms for given variables. i.e m0 to m7 for 3 variables
• Check the given equation is in SOP FORM or not? If not then convert it into SOP
form. i.e ab + bc + ac’ form
• Find out missing variable in each term & add that variable in that term. i.e for
A,B,C: B is missing in AC’. Add B in AC’ using AC’ = AC’(B+B’) = ABC’ + AB’C’
• ADD ALL MISSING VARIABLES IN EACH TERMS OF THE EQUATION
• ARRANGE ALL OBTAINED MINTERMS IN ASCENDING ORDERS. i.e from m0 to
m7 for 3 variables
29. MAXTERM
A sum term containing all n variables of the function in either true or
complemented form is called the maxterm. Each maxterm is obtained by an OR
operation of the variables in their true form or complemented form.
Four different combinations are possible for a two-variable function, such as, A’ +
B’, A’ + B, A + B', and A + B. These sum terms are called the standard sums or
maxterms.
Note that, in the maxterm, a variable will possess the value 0, if it is in true or
uncomplemented form, whereas, it contains the value 1, if it is in complemented
form.
Symbol for Maxterm is Mj, where j denotes the decimal equivalent of binary
number
30. • Like minterms, for a three-variable function, eight maxterms are also possible as
listed in the following table
31. Product of Maxterms
F = xy + x’z
= (xy + x’)(xy + z)
= (x + x’) (y + x’) (x + z) (y + z)
= (x’ + y) (x + z) (y + z)
x’ + y = x’ + y + zz’ = (x’ + y + z) (x’ + y + z’)
x + z = x + z + yy’ = (x + z + y) (x+ z + y’)
y + z = y + z + xx’ = (y + z + x) (y + z + x’)
F = (x + y + z) (x + y’ + z) (x’ + y + z) (x’ + y + z’)
= M0M2M4M5
F (x, y, z) = П (0, 2, 4, 5)
32. Steps to obtain PRODUCT OF MAXTERMS
• Find out how many variables is there in given equation
• List out all maxterms for given variables. i.e M0 to M7 for 3 variables
• Check the given equation is in POS FORM or not? If not then convert it into POS
form. i.e (a + b)(b + c)(a +c’) form
• Find out missing variable in each term & add that variable in that term. i.e for
A,B,C: B is missing in (A + C’). Add B in (A + C’) using (A + C’) = (A + C’)+BB’
= (A + B + C)(A + B’ + C)
• ADD ALL MISSING VARIABLES IN EACH TERMS OF THE EQUATION
• ARRANGE ALL OBTAINED MAXTERMS IN ASCENDING ORDERS. i.e from M0 to
M7 for 3 variables
34. • Express the following functions in a sum of minterms and product of
maxterms.
1. F(A,B,C,D) = D(A' + B) + B’D
2. F(W,X,Y,Z) = Y'Z + WXY' + WXZ' + W'X’Z
3. F(A,B,C) = (A' + B)(B' + C)
4. F(W,X,Y,Z) = (W + Y + Z) (X + Y') (W' + Z)
35. Conversion Between Canonical Forms
F(A, B, C) = Σ (1, 4, 5, 6, 7) (Sum Of Product) (Sum Of Minterms)
F’(A, B, C) = Σ (0, 2, 3) = m0 + m2 + m3
complement of F’ = F = (m0 + m2 + m3)’
= m0’ . m2’ . m3’
= M0.M2.M3
= П (0, 2, 3) (Product Of Sum) (Product Of Maxterms)
mj’ = Mj
F (A, B, C) = Σ (1, 4, 5, 6, 7) = П (0, 2, 3)
37. IC DIGITAL LOGIC FAMILIES
TTL Transistor – Transistor Logic
ECL Emitter – Coupled Logic
MOS Metal – Oxide Semiconductor
CMOS Complementary Metal – Oxide Semiconductor
IIL Integrated – Injection Logic
TTL has an extensive list of digital functions and is currently the most popular logic
family.
ECL is used in system requiring high speed operations.
MOS & IIL are used in circuits requiring high component density (Large Number of
Components like Transistors)
CMOS is used in system requiring low power consumption.
38. TTL - 5400 & 7400 SERIES i.e. 7400 7402 7432
ECL – 10000 SERIES i.e. 10102(Quad 2-Input NOR Gate) & 10107(triple–2 input
exclusive OR/NOR gate)
CMOS – 4000 SERIES i.e. 4002(dual 4-input NOR gate)
39. Positive and Negative Logic
Logic Value Signal Value Logic Value Signal Value
1 H 0 H
0 L 1 L
POSITIVE LOGIC NEGATIVE LOGIC
40. Special Characteristics:
Fan out: specifies the number of standard loads(means amount of current needed
by an input of another gate in same IC) that the output of a gate can drive
without impairing its normal operation.
Power dissipation: is the supplied power required to operate the gate. This
parameter is expressed in milliwatts (mW). It represents the power delivered to
the gate from power supply.
Propagation delay: is the average transition delay time for a signal to propagate
from input to output when the binary signals change in value. This parameter is
expressed in nanoseconds (ns)
Noise Margin: is the maximum noise voltage added to the input signal of a digital
circuit that does not cause an undesirable change in the circuit output.
41. SUMMARY OF CHAPTER 2
Basic Definitions
Axiomatic definitions of Boolean Algebra
Basic Theorems & Properties of Boolean Algebra
Boolean Functions
Canonical & Standard Forms
Minterms & Maxterms
Digital Logic Gates
IC Digital Logic Families