Scribd
Upload
46 views21 pages

Discrete Structures

This lecture covered basic logic gates like AND, OR, and NOT. It explained how to construct circuits using these logic gates to represent logical expressions and statements. Different logic gates like half adders and full adders were also discussed. The lecture concluded by showing how logical expressions can be represented by equivalent circuits and how circuits can be reduced through logical equivalences.

Uploaded by

Raja Moazzam
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
46 views21 pages

Discrete Structures

This lecture covered basic logic gates like AND, OR, and NOT. It explained how to construct circuits using these logic gates to represent logical expressions and statements. Different logic gates like half adders and full adders were also discussed. The lecture concluded by showing how logical expressions can be represented by equivalent circuits and how circuits can be reduced through logical equivalences.

Uploaded by

Raja Moazzam
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/ 21

Discrete Structures (CSC 102)

Lecture 4
Previous Lecture Summary
• Conditional Propositions.
• Negation, Inverse and Converse of the
conditional statements.
• Contraposition
• Bi-conditional statements.
• Necessary and Sufficient Conditions.
• Conditional statements and their Logical
equivalences.
Applications of Logic

3
Lectures outline

• Basic Logic gates

• Circuits using logic gates

• Boolean Algebra

• Adders

• Reductions of circuits
Basic Logic Gates
x
• Not x where x = ¬x
x xy
• And y where xy = x  y
x x+y
• Or y where x+y = x  y
x xy
• Nand y where ¬(xy)= xy
x x+y
• Nor y
xÅy
• Xor x
y
Constructing Circuits
Here is the circuit of the statement

(p  q)  (~p  q)  (p  ~q)
Cont...
Following is the circuit output of the following
statement

(x + y)  ¬ y

x
y
Designing a circuitt for a given input/output

Here is the out put

we can write it as following


Designing a circuitt for a given input/output

Here is the circuit of the previous input/output


Boolean Algebra
• Just like Boolean logic, variables can only be 1 or 0,
instead of true/false
• Not
~0 = 1
~1 = 0

• Or is used as a plus And is used as a multiplication


0+0 = 0 0*0=0
0+1=1 0*1=0
1+0=1 1*0=0
1+1= ? 1*1=1
Half Adder
• Consider adding two 1-bit binary numbers x and y
0+0 = 0
0+1 = 1
1+0 = 1
1+1 = 10

• Carry is x AND y
• Sum is x XOR y
• The circuit to compute this is called a half-adder.
Circuit of Half Adder

• Sum = x XOR y
• Carry = x AND y

x
y Sum
Carry
Using Half adders

•We can then use a half-adder to compute the


sum of two Boolean numbers

1 0 0
1 1 0 0
+1 1 1 0
? 0 1 0
How to fix that
• We need to create an adder that can take a carry bit as an
additional input
Inputs: x, y, carry in
Outputs: sum, carry out
• This is called a full adder
Will add x and y with a half-adder
Will add the sum of that to the
carry in
• What about the carry out?
It’s 1 if either (or both):
x+y = 10
x+y = 01 and carry in = 1
The Full adder
The “HA” boxes are
half-adders

c X HA S
s
Y C

x X HA S

c
y
Y C
The Full adder
The full circuitry of the full adder

c
s

x
y
c
Logical Expression
Following is the circuit representations of the statement
Cont…….
The above statement is the logical equivalent to the
statement
Statement Reasons
( P  Q)  (~ P  Q)  ( P  ~ Q)
 ( P  ~ P)  Q  ( P  ~ Q) : Distributive Law
 t  Q  ( P  ~ Q) : Negation Law
 Q  ( P  ~ Q) : Identity law
 (Q  P)  (Q  ~ Q) : Distributive Law
 (Q  P )  t : Negation Law
QP : Identity Law
 PQ : Commutative Law
Thus
Accordingly the two circuits are equivalent
Lecture summary

• Basic Logic gates

• Circuits using logic gates

• Circuits corresponding to Logical

Expressions

• Reductions of circuits

You might also like