Scribd
Upload
16 views24 pages

Boolean Os

Here are the key steps to simplify a Boolean expression: 1. Identify the literals (variables) and their complements 2. Group like terms using Boolean algebra rules 3. Apply absorption laws to further simplify 4. The resulting expression is in Sum of Products (SOP) or Product of Sums (POS) form Simplifying the given expression step-by-step: AB + AB + AC + B + BC AB + AB + AC + B + B(A+C) (Distribution of B over OR) AB + AC + B (Combining like terms) The simplified expression is in SOP form. The literals are A, B, C.

Uploaded by

mwanza matthews
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
16 views24 pages

Boolean Os

Here are the key steps to simplify a Boolean expression: 1. Identify the literals (variables) and their complements 2. Group like terms using Boolean algebra rules 3. Apply absorption laws to further simplify 4. The resulting expression is in Sum of Products (SOP) or Product of Sums (POS) form Simplifying the given expression step-by-step: AB + AB + AC + B + BC AB + AB + AC + B + B(A+C) (Distribution of B over OR) AB + AC + B (Combining like terms) The simplified expression is in SOP form. The literals are A, B, C.

Uploaded by

mwanza matthews
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/ 24

Lecturer : Mr.

Sianga
B.Sc. Computer Science
M.Sc. Computer Science
 Presence or absence of a signal in a given time interval is a
binary thing
 To represent the presence of a signal by ‘1’ and it's absence
by a ‘0’.
 Digital signals are represented by bits.
 A ‘1’ means a certain voltage level like 5 V and a ‘0’ 0 V.
 In practice, there is a window of voltages to represent these
1s and 0s. Similarly, a multilevel digital signal can be
represented by a group of binary bits.
 Boolean algebra is a branch of mathematics and
it can be used to describe the manipulation and
processing of binary information. The two-valued
Boolean algebra has important application in the
design of modern computing systems.
 Boolean algebra is algebra for the manipulation of
objects that can take on only two values, typically
true and false.
 It is common to interpret the digital value 0 as
false and the digital value 1 as true.
 Boolean Expression: Combining the variables and operation
yields Boolean expressions.
 Boolean Function: A Boolean function typically has one or more
input values and yields a result, based on these input value, in the
range {0, 1}.
 A Boolean operator can be completely described using a table
that list inputs, all possible values for these inputs, and the
resulting values of the operation.
 A truth table shows the relationship, in tabular form, between the
input values and the result of a specific Boolean operator or
function on the input variables.
.
.
Inputs .
Network . Outputs
.
.

 Boolean Algebra is used to describe the


relationship between inputs and outputs
 Boolean Algebra is the logic mathematics
used for understanding of digital systems
Main structural part of a digital system
Block of hardware that produces signals of
binary 1 or 0 when input logic requirements
are satisfied.
The relationship between the input-output
binary variables for each gate can be
represented in tabular form by a truth table.
Each gate has one or two binary input
variables designated by A and B and one
binary output variable designated by x.
The NOT gate is an electronic circuit which produces an inverted version of the input at its
output. It is also known as an Inverter.
0  1 and 1  0
' '

A  1 if A  0 and A  0 if A  1
' '

0 is low voltage
 NOT
1 is high voltage
The AND gate is an electronic circuit which gives a high output only if all its inputs are
high. The AND operation is represented by a dot (.) sign.

F is 1 if and only if
 AND
A and B are both 1
The OR gate is an electronic circuit which gives a high output if one or
more of its inputs are high. The operation performed by an OR gate is
represented by a plus (+) sign.

F is 1 if and only if

 OR A or B (or both) are 1


 The three simplest gates are the AND, OR, and NOT gates.
A0  A
A  1  A'
A A  0
A  A'  1
A B  B  A
( A  B)  C  A  ( B  C )  A  B  C
A( B  C )  AB  AC
( A  B) '  A  B '  A'  B  AB  A' B '

A  B  1  A  1 or B  1 but not both


 The 'Exclusive-OR' gate is a circuit which will give a high output if one of its inputs
is high but not both of them. The XOR operation is represented by an encircled plus
sign.
 The 'Exclusive-NOR' gate is a circuit that does the inverse operation to the XOR
gate. It will give a low output if one of its inputs is high but not both of them. The
small circle represents inversion.
Stacking Logic Gates!
An output of one logic gate can be an input to another logic gate.
F = XY + X’Y + Y’Z

F = (a + b’)(a + b + c)( b’ + c)
1. Draw a network to realize the following by using only one AND
gate and one OR gate
Y  ABCD  ABCE  ABCF
1. Draw a network to realize the following by using two OR gates
and two AND gates
F  (V  W  X )(V  X  Y )(V  Z )
 AB + AB + AC + B + BC
 AB + A (B+C) + B (B+C)
 AB + AC + B + BC
 AB + AC +B
 Identify the SOP and POS
 Identify the Literals and variable

You might also like