This document provides an overview of Boolean algebra and logic gates. It begins with an outline of topics covered, including Boolean algebra, logic operators, theorems, functions, and digital logic gates. It then introduces Boolean algebra as dealing with binary numbers and being important for designing computer logic circuits. Key concepts discussed include logical operators like AND, OR, and NOT; truth tables; Boolean functions; minterms and maxterms; canonical forms; and conversions between sum of products and product of sums forms. George Boole is identified as the founder of Boolean algebra. Truth tables and examples are provided to illustrate logical operators and evaluating Boolean expressions.
Basic Computer Organization and Design
.....................................................................
The basic computer design represents all of the major concepts in CPU design without overwhelming students with the complexity of a modern commercial CPU.
A computer consists of both software and hardware. Making them coordinate with each other and using computer programs, making the hardware do the task is the actual challenge. Now, let us talk about some tasks that are performed by machines while instructed by software programs. Copy the link given below and paste it in new browser window to get more information on Memory Reference Instructions:- http://www.transtutors.com/homework-help/computer-science/memory-reference-instructions.aspx
Basic Computer Organization and Design
.....................................................................
The basic computer design represents all of the major concepts in CPU design without overwhelming students with the complexity of a modern commercial CPU.
A computer consists of both software and hardware. Making them coordinate with each other and using computer programs, making the hardware do the task is the actual challenge. Now, let us talk about some tasks that are performed by machines while instructed by software programs. Copy the link given below and paste it in new browser window to get more information on Memory Reference Instructions:- http://www.transtutors.com/homework-help/computer-science/memory-reference-instructions.aspx
Digital Logic.pptxghuuhhhhhhuu7ffghhhhhgAnujyotiDe
Jdjddjdjjfjrjrhhfbrhrjhjjfjrjfrifjhfjdirurfu8fi3hdudoickegdhejdofjrvdjozdkjieofiudjrhciyyfifjjvi9r7ugidof8cdukrkfj2keoekeRecombination in bacterial growth refers to the process by which bacteria exchange genetic material with each other, leading to the formation of new genetic combinations. This process can occur through several mechanisms, including transformation, conjugation, and transduction.
1. Transformation: In transformation, bacteria take up free DNA from their environment and incorporate it into their genome. This DNA may come from lysed bacterial cells or be released into the environment by other means. Once inside the cell, the foreign DNA can recombine with the bacterial chromosome, leading to genetic diversity.
2. Conjugation: Conjugation involves the direct transfer of genetic material from one bacterium to another through physical contact. This transfer typically occurs through a conjugative pilus, a structure that forms a bridge between the donor and recipient cells. During conjugation, a copy of the donor's DNA, often in the form of a plasmid, is transferred to the recipient cell, where it can integrate into the chromosome or exist as a separate genetic element.
3. Transduction: Transduction occurs when bacterial DNA is transferred from one bacterium to another by a bacteriophage (a virus that infects bacteria). During the lytic cycle of viral replication, some bacteriophages may accidentally package bacterial DNA instead of their own genome. When these phages infect other bacteria, they inject this bacterial DNA into the new host, where it can recombine with the recipient chromosome.
Recombination plays a crucial role in bacterial evolution and adaptation by facilitating the exchange of beneficial genetic traits, such as antibiotic resistance or metabolic capabilities. It contributes to the genetic diversity of bacterial populations and can influence their ability to survive and thrive in various environments.In enzymes, a domain refers to a distinct structural and functional unit that contributes to the overall activity of the enzyme. Domains are often modular components within the enzyme's overall structure, each with its own specific role or function. These functions may include substrate binding, catalysis, regulation, or interaction with other molecules. Domains can have specific shapes, surface properties, and active sites tailored to perform particular biochemical tasks within the enzyme's catalytic cycle. Additionally, enzymes can contain multiple domains, which may interact with each other to modulate enzyme activity or to confer versatility in substrate recognition and binding. The organization of domains within an enzyme contributes to its overall efficiency and specificity in catalyzing biochemical reactions.Superscalar architecture is a CPU design paradigm that enables the simultaneous execution of multiple instructions within a single clock cycle. This is achieved by having multiple execution units, allowing t
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Safalta Digital marketing institute in Noida, provide complete applications that encompass a huge range of virtual advertising and marketing additives, which includes search engine optimization, virtual communication advertising, pay-per-click on marketing, content material advertising, internet analytics, and greater. These university courses are designed for students who possess a comprehensive understanding of virtual marketing strategies and attributes.Safalta Digital Marketing Institute in Noida is a first choice for young individuals or students who are looking to start their careers in the field of digital advertising. The institute gives specialized courses designed and certification.
for beginners, providing thorough training in areas such as SEO, digital communication marketing, and PPC training in Noida. After finishing the program, students receive the certifications recognised by top different universitie, setting a strong foundation for a successful career in digital marketing.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Francesca Gottschalk - How can education support child empowerment.pptxEduSkills OECD
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
2. OUTLINE OF BOOLEAN ALGEBRA
2
2.1 Introduction to Boolean algebra
2.2 History of Boolean algebra
2.3 Logical Operators
2.4 Basic theorems and properties of Boolean algebra
2.5 Boolean functions
2.6 Canonical and standard forms
2.7 Digital logic gates
Prof. K Adisesha
3. INTRODUCTION
An algebra that deals with binary number
system is called “Boolean Algebra”.
It is very power in designing logic circuits used by
the processor of computer system.
The logic gates are the building blocks of all the
circuit in a computer.
Boolean algebra deals with truth table TRUE
and FALSE.
If result of any logical statement or expression is
always TRUE or 1, it is called Tautology and if
the result is always FALSE or 0, it is called
Fallacy
It is also called as “Switching Algebra”. 3
Prof. K Adisesha
4. GEORGE BOOLE
Father of Boolean algebra
Boolean algebra derives its name from the
mathematician George Boole (1815-1864) who
is considered the “Father of symbolic logic”.
He came up with a type of boolean algebra, the
three most basic operations of which were (and
still are) AND, OR and NOT.
It was these three functions that formed the
basis of his premise, and were the only
operations necessary to perform comparisons
or basic mathematical functions.
George Boole (1815 - 1864)
4
Prof. K Adisesha
5. BOOLEAN ALGEBRA
A variable used in Boolean algebra or Boolean
equation can have only one of two variables. The two
values are FALSE (0) and TRUE (1)
A Sentence which can be determined to be TRUE or
FALSE are called logical statements or truth
functions and the results TRUE or FALSE is called
Truth values.
Boolean Expression consists of
Literal: A variable or its complement
Product term: literals connected by •
Sum term: literals connected by +
• A truth table is a mathematical table used in logic to
computer functional values of logical expressions.
5
Prof. K Adisesha
6. TRUTH TABLE
A truth table is a mathematical table used in logic to
computer functional values of logical expressions.
A truth table is a table whose columns are statements
and whose rows are possible scenarios.
Example: Consider the logical expression
Logical Statement: Sports = “Sunny can Play
Cricket OR Football”
Y = A OR B (Logical Variables: Y, A, B,
Logical Operator OR)
6
Prof. K Adisesha
A=Cricket B=Football Y=A OR B
0 0 0
0 1 1
1 0 1
1 1 1
7. LOGICAL OPERATORS
There are three logical operator, AND, OR and NOT.
These operators are now used in computer
construction known as switching circuits.
B = {0, 1} and two binary operators, ‘+’ and ‘.’
The rules of operations: AND, OR and NOT.
7
Prof. K Adisesha
8. AND OPERATOR
The AND operator is a binary operator. This operator
operates on two variables.
The operation performed by AND operator is called
logical multiplication.
The symbol we use for it is ‘.’
Example: X . Y can be read as X AND Y
The Truth table and the Venn diagram for the NOT
operator is:
8
Prof. K Adisesha
10. OR OPERATOR
The OR operator is a binary operator. This operator
operates on two variables.
The operation performed by OR operator is called
logical addition.
The symbol we use for it is ‘+’.
Example: X + Y can be read as X OR Y
The Truth table and the Venn diagram for the NOT
operator is:
10
Prof. K Adisesha
12. NOT OPERATOR
The Not operator is a unary operator. This operator
operates on single variable.
The operation performed by Not operator is called
complementation.
The symbol we use for it is bar.
𝐗 means complementation of X
If X=1, X =0 If X=0, X =1
The Truth table and the Venn diagram for the NOT
operator is:
12
Prof. K Adisesha
14. EVALUATION OF BOOLEAN EXPRESSION
USING TRUTH TABLE
To create a truth table, follow the steps given below.
Step 1: Determine the number of variables, for n
variables create a table with 2n rows.
For two variables i.e. X, Y then truth table will need 22 or
4 rows.
For three variables i.e. X, Y, Z, then truth table will need
23 or 8 rows.
Step 2: List the variables and every combination of 1
(TRUE) and 0 (FALSE) for the given variables
Step 3: Create a new column for each term of the
statement or argument.
Step 4: If two statements have the same truth values,
then they are equivalent. 14
Prof. K Adisesha
15. CONSIDER THE FOLLOWING BOOLEAN
EXPRESSION F=X+Y
Step 1: This expression as two variables X and Y,
then 22 or 4 rows.
Step 2: List the variables and every combination
of X and Y.
Step 3: The final column contain the values of
F=X+ Y.
15
Prof. K Adisesha
16. 16
CONSIDER THE FOLLOWING BOOLEAN
EXPRESSION BOOLEAN ALGEBRA
The truth table for the
Boolean function:
is shown at the right.
To make evaluation of the
Boolean function easier, the
truth table contains extra
(shaded) columns to hold
evaluations of subparts of
the function.
Prof. K Adisesha
17. OPERATOR PRECEDENCE
The operator precedence for evaluating Boolean
Expression is
Parentheses
NOT
AND
OR
Examples
x y' + z
(x y + z)'
17
Prof. K Adisesha
18. BOOLEAN FUNCTIONS
A Boolean function
Binary variables
Binary operators OR and AND
Unary operator NOT
Parentheses
Examples
F1= x y z'
F2 = x + y'z
F3 = x' y' z + x' y z + x y'
F4 = x y' + x' z
18
Prof. K Adisesha
21. DUALITY
The principle of duality is an important concept. It states
that every algebraic expression deducible from the
postulates of Boolean algebra, remains valid if the
operators identity elements are interchanged.
To form the dual of an expression, replace all + operators
with . operators, all . operators with + operators, all ones
with zeros, and all zeros with ones.
Form the dual of the expression
a + (bc) = (a + b)(a + c)
Following the replacement rules…
a(b + c) = ab + ac
Take care not to alter the location of the parentheses if
they are present. 21
Prof. K Adisesha
22. 22
Prof. K Adisesha
Indempotence Law:
“This law states that when a variable is combines with itself
using OR or AND operator, the output is the same variable”.
24. ABSORPTION LAW:
“THIS LAW ENABLES A REDUCTION OF COMPLICATED
EXPRESSION TO A SIMPLER ONE BY ABSORBING COMMON TERMS”.
24
Prof. K Adisesha
25. DEMORGAN’S THEOREM
Theorem 5(a):Statement: “When the OR sum of two variables is inverted, this is same
as inverting each variable individually and then AND ing these inverted variables”
(x + y)’ = x’y’
Theorem 5(b): “When the AND product of two variables is inverted, this is same as
inverting each variable individually and then OR ing these inverted variables”
(xy)’ = x’ + y’
By means of truth table
x y x’ y’ x+y (x+y)’ x’y’ xy x’+y' (xy)’
0 0 1 1 0 1 1 0 1 1
0 1 1 0 1 0 0 0 1 1
1 0 0 1 1 0 0 0 1 1
1 1 0 0 1 0 0 1 0 0
Prof. K Adisesha25
28. SIMPLIFICATION OF BOOLEAN EXPRESSION:
28
Simplification of Boolean expression can
be achieved by two popular methods:
o Algebraic Manipulation
o Karnaugh Maps (K Map)
29. ALGEBRAIC MANIPULATION
To minimize Boolean expressions
Literal: single variable in a term (complemented or uncomplemented )
(an input to a gate)
Term: an implementation with a gate
The minimization of the number of literals and the number of terms → a
circuit with less equipment
It is a hard problem (no specific rules to follow)
Example 2.1
1. x(x'+y) = xx' + xy = 0+xy = xy
2. x+x'y = (x+x')(x+y) = 1 (x+y) = x+y
3. (x+y)(x+y') = x+xy+xy'+yy' = x(1+y+y') = x or x+yy’ = x+ 0 = x
4. xy + x'z + yz = xy + x'z + yz(x+x') = xy + x'z + yzx + yzx' = xy(1+z)
+ x'z(1+y) = xy +x'z
5. (x+y)(x'+z)(y+z) = (x+y)(x'+z), by duality from function 4.
29
Prof. K Adisesha
31. 31
EXAMPLES
Example 2.2
F1' = (x'yz' + x'y'z)' = (x'yz')' (x'y'z)' = (x+y'+z) (x+y+z')
F2' = [x(y'z'+yz)]' = x' + (y'z'+yz)' = x' + (y'z')' (yz)’
= x' + (y+z) (y'+z')
Example 2.3: a simpler procedure
Take the dual of the function and complement each
literal
1. F1 = x'yz' + x'y'z.
The dual of F1 is (x'+y+z') (x'+y'+z).
Complement each literal: (x+y'+z)(x+y+z') = F1'
2. F2 = x(y' z' + yz).
The dual of F2 is x+(y'+z') (y+z).
Complement each literal: x'+(y+z)(y' +z') = F2'
Prof. K Adisesha
34. 34
CANONICAL AND STANDARD FORMS
Minterms and Maxterms
Boolean expression expressed as sum of Minterms or
product of Maxterms are called canonical forms.
For example, the following expressions are the
Minterm canonical form and Maxterm canonical form
of two variables X and Y.
Minterm Canonical = f(X, Y) = X’Y’ + X’ Y +X Y’+ X Y
Maxterm Canonical = f(X, Y) = (X+Y).(X +Y’).(X’+Y’)
The Minterm canonical expression is the sum of all
Minterms.
The maxterm canonical expression is the product of all
Maxterms.
Prof. K Adisesha
35. 35
MINTERMS AND MAXTERMS
Each maxterm is the complement of its corresponding
minterm, and vice versa.
Prof. K Adisesha
36. 36
MINTERMS AND MAXTERMS
Any Boolean function can be expressed by
A truth table
Sum of minterms
f1 = x'y'z + xy'z' + xyz = m1 + m4 +m7 = S(1, 4, 7) (Minterms)
f2 = x'yz+ xy'z + xyz'+xyz = m3 + m5 +m6 + m7 (Minterms)
Prof. K Adisesha
37. 37
MINTERMS AND MAXTERMS
The complement of a Boolean function
The minterms that produce a (0)
f1' = m0 + m2 +m3 + m5 + m6
= x'y'z'+x'yz'+x'yz+xy'z+xyz'
f1 = (f1')' = m’0 . m’2 . m’3 . m’5 . m’6
= (x+y+z)(x+y'+z) (x+y'+z') (x'+y+z')(x'+y'+z)
= M0 M2 M3 M5 M6
f2 = (x+y+z)(x+y+z')(x+y'+z)(x'+y+z)=M0M1M2M4
Any Boolean function can be expressed as
A sum of minterms (“sum” meaning the ORing of terms).
A product of maxterms (“product” meaning the ANDing of
terms).
Both Boolean functions are said to be in Canonical form.
Prof. K Adisesha
38. 38
SUM OF MINTERMS (SOP)
Sum of minterms: there are 2n minterms
Example 4: Express F = A+BC' as a sum of minterms.
F(A, B, C) = S(1, 4, 5, 6, 7)
Prof. K Adisesha
39. 39
PRODUCT OF MAXTERMS
Product of maxterms: there are 2n maxterms
Example 5: express F = xy + x'z as a product of
maxterms.
F(x, y, z) = P(0, 2, 4, 5)
Prof. K Adisesha
42. MINTERMS AND MAXTERMS
(WITH THREE VARIABLES)
The function is
1 for these rows
The function is
0 for these rows
43. 43
CONVERSION BETWEEN CANONICAL
FORMS
The complement of a function expressed as the
sum of minterms equals the sum of minterms
missing from the original function.
F(A, B, C) = S(1, 4, 5, 6, 7)
Thus, F'(A, B, C) = S(0, 2, 3) = m0 + m2 +m3
By DeMorgan's theorem
F(A, B, C) = (m0 + m2 +m3)' = M0 M2 M3 = P(0, 2, 3)
F'(A, B, C) =P (1, 4, 5, 6, 7)
mj' = Mj
Interchange the symbols S and P and list those
numbers missing from the original form
S of 1's
P of 0's
Prof. K Adisesha
44. TWO DIFFERENT WAYS TO SPECIFY THE SAME
FUNCTION F OF THREE VARIABLES
SOP Form
f(x1, x2, x3) = Σ m(0, 2, 4, 5, 6, 7)
POS Form
f(x1, x2, x3) = Π M(1, 3)
45. 45
Example
F = xy + xz
F(x, y, z) = S(1, 3, 6, 7)
F(x, y, z) = P (0, 2, 4, 5)
Prof. K Adisesha
46. 46
STANDARD FORMS
The two canonical forms of Boolean algebra are
basic forms that one obtains from reading a given
function from the truth table.
We do not use it, because each minterm or maxterm
must contain, by definition, all the variables, either
complemented or uncomplemented.
Standard forms: the terms that form the function
may obtain one, two, or any number of literals.
Sum of products: F1 = y' + xy+ x'yz'
Product of sums: F2 = x(y'+z)(x'+y+z')
Prof. K Adisesha
47. 47
CONVERSION OF SOP INTO CANONICAL FORM
Convert the Boolean function f(X, Y) = X + X Y
into canonical form.
Solution:
The given Boolean function f(X, Y) = X + X Y ------ (i)
It has two variables and sum of two Minterms. The first term
X is missing one variable.
So to make it of two variables it can be multiplied by (Y+Y’)=1.
Therefore, X = X (Y+Y’) =XY+XY’
Substitute the value of X in (i) we get f(X, Y) = X Y+X Y’ + X Y
Here, the term X Y appear twice, it is possible to remove one of
them. f(X, Y) = X Y+X Y’
Therefore: SOP Expression is f(X, Y) = Σ (2, 3)
Prof. K Adisesha
48. 48
CONVERSION OF POS INTO CANONICAL FORM
Convert the Boolean function F(X, Y, Z) = X+Y
(Y+Z) into canonical form.
Solution:
The given Boolean function F(X,Y,Z) = (X+Y).(Y+Z) ------(i)
It has three variables and product of two Maxterms. Each
Maxterm is missing one variable.
The first term can be written as X+Y = (X+Y+Z. Z ) Since Z. Z =0
Using distributive law (X + YZ) = (X + Y) (X + Z), we can write
X+Y = (X+Y+Z) (X+Y+ Z ) ------(ii)
The Second term can be written as
Y + Z = (Y+Z+X. X ) Y+Z = (Y+Z+X) (Y+Z+X ) ------(iii)
Substitute (ii) and (iii) in (i) we get
F(X, Y, Z) = (X+Y+Z) (X+Y+ Z ) (Y+Z+X) (Y+Z+X )
Therefore: POS Expression is F(X, Y, Z) = π (0, 1, 4)
Prof. K Adisesha
49. 49
KARNAUGH MAP:
o A graphical display of the fundamental products in a
truth table.
o Fundamental Product: The logical product of variables
and complements that produces a high output for a
given input condition.
o The map method provides simple procedure for
minimizing the Boolean function.
o The map method was first proposed by E.W. Veitch in
1952 known as “Veitch Diagram”.
o In 1953, Maurice Karnaugh proposed “Karnaugh Map”
also known as “K-Map”.
Prof. K Adisesha
50. 50
CONSTRUCTION OF K-MAP
• The K-Map is a pictorial representation of a truth table
made up of squares.
• Each square represents a Minterm or Maxterm.
• A K-Map for n variables is made up of 2n squares.
Single Variable K-Map:
The map consists of 2 squares (i.e. 2n square, 21 = 2 square)
Two Variable K-Map
• The map consists of 4 squares (i.e. 2n square, 22 = 4 square)
Three Variable K-Map:
The map consists of 8 squares (i.e. 2n square, 23 = 8 square)
Four Variable K-Map
• The map consists of 16 squares (i.e. 2n square, 24 = 16 square)
Prof. K Adisesha
51. KARNAUGH MAPS
Karnaugh maps, or K-maps, are often used to simplify logic problems
with 2, 3 or 4 variables.
BA
For the case of 2 variables, we form a map consisting of 22=4 cells
as shown in Figure
A
B
0 1
0
1
Cell = 2n ,where n is a number of variables
00 10
01 11
A
B
0 1
0
1
A
B
0 1
0
1
BA
BA AB
BA BA
BA BA
Maxterm Minterm
0 2
1 3
54. The Karnaugh map is completed by entering a
'1‘(or ‘0’) in each of the appropriate cells.
Within the map, adjacent cells containing 1's
(or 0’s) are grouped together in twos, fours, or
eights.
KARNAUGH MAPS
58. 58
NAND Gate is a Universal Gate:
To prove that any Boolean function can be implemented using only NAND
gates, we will show that the AND, OR, and NOT operations can be
performed using only these gates
59. 59
NAND Gate is a Universal Gate:
To prove that any Boolean function can be implemented using only NOR
gates, we will show that the AND, OR, and NOT operations can be
performed using only these gates
62. 62
MULTIPLE INPUTS
Extension to multiple inputs
A gate can be extended to more than two inputs.
If its binary operation is commutative and
associative.
AND and OR are commutative and associative.
OR
x+y = y+x
(x+y)+z = x+(y+z) = x+y+z
AND
xy = yx
(x y)z = x(y z) = x y z
Prof. K Adisesha
63. 63
MULTIPLE INPUTS
NAND and NOR are commutative but not associative →
they are not extendable.
Figure: Demonstrating the nonassociativity of the NOR operator; (x ↓
y) ↓ z ≠ x ↓(y ↓ z)
z
Prof. K Adisesha
64. 64
MULTIPLE INPUTS
Multiple input NOR = a complement of OR gate,
Multiple input NAND = a complement of AND.
The cascaded NAND operations = sum of products.
The cascaded NOR operations = product of sums.
Figure: Multiple-input and cascaded NOR and NAND gates
Prof. K Adisesha
65. 65
The XOR and XNOR gates are commutative and
associative.
XOR is an odd function: it is equal to 1 if the inputs
variables have an odd number of 1's.
Figure 2.8 3-input XOR gate
Prof. K Adisesha
66. 66
POSITIVE AND NEGATIVE LOGIC
Positive and Negative Logic
Two signal values <=> two
logic values
Positive logic: H=1; L=0
Negative logic: H=0; L=1
The positive logic is used in
this book
Figure 2.9 Signal assignment and logic polarity
Prof. K Adisesha