Scribd
Upload
14 views28 pages

CSE204 (Lecture04)

This document summarizes a lecture on digital logic design that covered: 1) Binary logic uses variables with two possible values (1 and 0) and logic operations like AND, OR, and NOT. Logic gates are basic digital devices that take inputs and produce an output. 2) Common logic gates were discussed including NOT, AND, OR, NAND, NOR, XOR, and XNOR. Truth tables show all possible input-output combinations for a gate. 3) Boolean algebra is a mathematical system for logic with elements, operators, and postulates. It includes concepts like duality where valid expressions remain valid when operators are swapped, and De Morgan's laws for complementing functions.

Uploaded by

Jasper D' Rozario
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
14 views28 pages

CSE204 (Lecture04)

This document summarizes a lecture on digital logic design that covered: 1) Binary logic uses variables with two possible values (1 and 0) and logic operations like AND, OR, and NOT. Logic gates are basic digital devices that take inputs and produce an output. 2) Common logic gates were discussed including NOT, AND, OR, NAND, NOR, XOR, and XNOR. Truth tables show all possible input-output combinations for a gate. 3) Boolean algebra is a mathematical system for logic with elements, operators, and postulates. It includes concepts like duality where valid expressions remain valid when operators are swapped, and De Morgan's laws for complementing functions.

Uploaded by

Jasper D' Rozario
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/ 28

CSE 204

Digital Logic Design

Lecture 04
Quiz 01
• Today
Binary Logic

• Binary logic consists of binary variables


and logical operations.
• Variables are designated by letters such
as A, B, C, x, y, z etc. with only 2
possible values: 1 and 0.
• Logic operations: and, or, not
– combinations!
Logic Gates

• The most basic digital devices are called Gates.

• A Gate has one or more inputs and produces


an output that is a function of the current input
values.
Notations
• AND function: • NOT function
– A&&B, A&B • ~A
– A.B, AB • A’
– AND(A,B)
• NOT(A)

• OR function:
– A||B, A|B
– A+B
– OR(A,B)
Truth Table
▪ A Truth Table provides a complete list of
every possible combination of inputs and
its corresponding outputs.

▪ Example (2 inputs, 2 outputs):


A two-input AND Gate

A A &
A.B A.B
B B
A two-input OR Gate

A A
A+B A+B
B B
A (one-input) NOT Gate

A A' A A'
Other Basic Gates

• NAND
• NOR
• XOR
• XNOR
The two-input NAND Gate
A A &
(A.B)' ≡ A
(A.B)' (A.B)'
B B B

≡≡

NAND Negative-OR
The two-input NOR Gate
A A A
B
(A+B)' ≡ (A+B)'
B
(A+B)'
B

NOR Negative-AND
The two-input XOR Gate
A A
A⊕B A⊕B
B B
The two-input XNOR Gate
A
AʘB
B
Universal Gates
NAND
Using NAND
NOT OR
Gate Gate

NOT AND
Gate Gate
NOR
Using NOR
NOT OR
Gate Gate

NOT AND
Gate Gate
BOOLEAN ALGEBRA

(Break!)
Boolean Algebra

• Like any other deductive mathematical system,


defined with a set of elements, a set of operators,
and a number of postulates and axioms.

• In Boolean algebra, the set consists of at least 2


variables, with 2 binary operations {+} and {.} and
1 unary operation {’}
Boolean Algebra Postulates
▪ For every x, y in set B:
❖ x + y will be in B
❖ x . y will be in B

▪ For every x, y in B:
❖ x+y=y+x
❖ x.y=y.x

▪ For every x in B, there exists an element x' in B such


that:
❖ x + x' = 1
❖ x . x' = 0
Boolean Algebra Postulates

▪ For every x, y, z in B:
❖ (x + y) + z = x + (y + z) = x + y + z
❖ (x . y) . z = x .( y . z ) = x . y . z

▪ For 0 and 1:
❖ 0+x=x+0=x
❖ 1.x=x.1=x

▪ For every x, y, z in B:
❖ x . (y + z) = (x . y) + (x . z)
❖ x + (y . z) = (x + y) . (x + z)
Duality

▪ Every valid Boolean expression (equality)


remains valid if the operators and identity
elements are interchanged, as follows:
+↔.
1↔0
▪ Example: Given the expression
a + (b.c) = (a+b).(a+c)
its Dual Expression is
a . (b+c) = (a.b) + (a.c)
Duality

▪ If (x+y+z)' = x'.y.'z' is valid, then its Dual is


also valid:
(x.y.z)' = x'+y'+z’
▪ If x + 1 = 1 is valid, then its Dual is also valid:
x.0=0
Complementing a Function:
De Morgan’s Laws
1. Take dual of the function
2. Complement each literals

Example: F1= x’yz’+x’y’z


1. Dual of the function F1 is
(x’+y+z’)(x’+y’+z)
2. Complement each literal=
(x+y’+z)(x+y+z’)
Therefore, F1’= (x+y’+z)(x+y+z’)
Notes
• Reading
– Mano and Kime, Ch 2-1~2
Acknowledgement to
Dr. Tarem Ahmed

You might also like