Scribd
Upload
24 views26 pages

Boolean Algebra: Boolean Constants Boolean Variables Boolean Functions

Boolean algebra is used to simplify logical expressions. It uses Boolean constants (0 for false and 1 for true), variables that can only be 0 or 1, and functions (AND, OR, NOT). Boolean algebra contains identities that define the functions and laws like commutative, distributive, absorption, and De Morgan's laws. De Morgan's laws allow converting between AND/OR expressions by changing the operators and complementing the variables. Boolean algebra can be used to simplify digital circuits using fewer gates.

Uploaded by

smart telugu guru
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
24 views26 pages

Boolean Algebra: Boolean Constants Boolean Variables Boolean Functions

Boolean algebra is used to simplify logical expressions. It uses Boolean constants (0 for false and 1 for true), variables that can only be 0 or 1, and functions (AND, OR, NOT). Boolean algebra contains identities that define the functions and laws like commutative, distributive, absorption, and De Morgan's laws. De Morgan's laws allow converting between AND/OR expressions by changing the operators and complementing the variables. Boolean algebra can be used to simplify digital circuits using fewer gates.

Uploaded by

smart telugu guru
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/ 26

Boolean algebra

 Boolean constants
 these are ‘0’ (false) and ‘1’ (true)
 Boolean variables
 variables that can only take the values ‘0’ or ‘1’
 Boolean functions
 each of the logic functions (such as AND, OR and NOT)
are represented by symbols as described above
 Boolean theorems
 a set of identities and laws

15EEE302
SY
Boolean algebra

 Boolean identities
AND Function OR Function NOT function
00=0 0+0=0 0 1
01=0 0+1=1 1 0
10=0 1+0=1 AA
11=1 1+1=1
A0=0 A+0=A
0A=0 0+A=A
A1=A A+1=1
1A=A 1+A=1
AA=A A+A=A
A A  0 A  A 1
15EEE302
SY
Boolean algebra
 Boolean laws

Commutative law Absorption law


AB  BA A  AB  A
AB B A A( A  B)  A

Distributive law De Morgan’s law


A(B  C )  AB  AC A B  AB
A  BC  ( A  B)( A  C ) AB  A  B

Associative law Note also


A(BC )  ( AB)C A  AB  A  B
A  (B  C )  ( A  B)  C A( A  B)  AB
15EEE302
SY
DeMorgan’s Theorem/Laws
 DeMorgan’s law can be extended to any number of
variables.

 Replace each variable by its complement and change all


ANDs to ORs and all ORs to ANDs.

 Thus, we can find the complement

15EEE302
SY
DeMorgan’s theorem helps to simplify digital circuits
using NORs and NANDs

15EEE302
SY
Reduction Examples using
Boolean Algebra

15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY
15EEE302
SY

You might also like