Scribd
Upload
18 views

Elec1111 11a Digital Boolean Algebra

This document provides information about a lecture on Boolean algebra including: 1) The necessary logic operators for any function expressed in Boolean algebra are NOT, AND, and OR. 2) Constants and single variable expressions follow specific theorems like commutative, associative, distributive, absorption, and DeMorgan's laws. 3) DeMorgan's theorem states that the NOT of an AND is the same as the OR of the NOTs, and the NOT of an OR is the same as the AND of the NOTs.

Uploaded by

uploadingperson
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
18 views

Elec1111 11a Digital Boolean Algebra

This document provides information about a lecture on Boolean algebra including: 1) The necessary logic operators for any function expressed in Boolean algebra are NOT, AND, and OR. 2) Constants and single variable expressions follow specific theorems like commutative, associative, distributive, absorption, and DeMorgan's laws. 3) DeMorgan's theorem states that the NOT of an AND is the same as the OR of the NOTs, and the NOT of an OR is the same as the AND of the NOTs.

Uploaded by

uploadingperson
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/ 4

1

Electrical Engineering &


Telecommunications
Lecturer:
Ted Spooner
Lecture -
Boolean Algebra
Elec1111 Elec1111
Rm124A EE email: [email protected]
Necessary Logic Operators
Any function may be expressed by NOT,
AND & OR
Literal
Literal: each appearance of variable in
expression
below: 4 variables; 11 literals
Precedence
NOT () highest precedence
AND () second highest precedence
OR (+) lowest precedence
2
Constant expressions
AND
0 0 =0
0 1 =0
1 0 =0
1 1 =1
NOT
OR
0 +0 =0
0 +1 =1
1 +0 =1
1 +1 =1
Single variable theorems
Commutative laws
A B =B A
A +B =B +A
Gate: input order doesnt matter
Associative laws
(A B) C =A (B C) =A B C
(A +B) +C =A +(B +C) =A +B +C
Gate: multiple input gates defined
3
Distributive laws
A (B +C) =(A B) +(A C)
A +(B C) =(A +B) (A +C)
Proof: using truth table
Absorption laws
Consensus laws DeMorgans theorem
4
Pushing the bubble
DeMorgan: different symbols for same gate
Simplification example
Powerful NAND

You might also like