Phys354: Digital Electronics

Credit Hours: 3hrs/wk (2hrs

lectures + 3hrs lab practices)
 Reading Assignment
Review
▫ Digital Numbers System
▫ Number Systems :
 Binary-to-Decimal & Decimal-to-Binary Conversion
 Hexadecimal & Binary Coded Decimal
▫ Digital Electronic Signals & Switches
1. Describing Logic Gates
Chapter Focus Points:
Describe the operation & use of basic logic gates, &
construct their truth tables
Write Boolean expression for the logic gates and apply
it to simplify complex logic circuits
Use De Morgan’s theorems to simplify logic
expressions
Use universal gates (NAND or NOR) to implement a
circuit represented by a Boolean expression.
1.1 OR Operation with OR Gates

Boolean Expression: x = A + B

Exc.1. Draw a 3-input OR gate. Construct its truth table

& write Boolean expression.
Example: Use of an OR gate in industrial control system
(an alarm system)
1.2 AND Operation with AND Gate

Boolean Expression: x = A . B

Exc.2. Draw a 3-input AND gate. Construct its truth

table & write Boolean expression.
Exc.3. If you have an N-input gates, what will be the no
of possible combinations?
1.3 NOT Operation & the Inverter

Boolean Expression: x  A  A
1.4 The NAND Gate

Boolean Expression: x  A B
1.5 The NOR Gate

Boolean Expression: x  A B
 Simulation: Timing Analysis

Exc: Sketch the output waveforms for a 2-input OR & AND

gates, for the A and B input waveforms shown
Simulation: Enabling or Disabling a Signal Transmitted
Examples: Describing Logic Circuits Algebraically

Exc: Use Truth Table to analyze the Circuits

Examples: Implementing Circuits from Boolean Expression

• Draw the circuit diagram to implement the expression:


x   A  B B  C 

Exc: Draw the circuit diagram that implements the expressions:

1. x  AC  BC  ABC (use no more than 3- inputs)
2. 
x   A  B B  C 
3. x  AB  C  D 
1.5 Boolean Algebra Laws & Rules
Associative Law

Distributive Law
Examples:
1. Simplify the expressions, & draw a circuit diagram for
the original & simplified expressions
x  ABD  AB D  
x  A  B  A  B

x  ACD  ABCD
2. Find a simplified circuit that replace the following
circuit where x   A  BB  B  BC
1.6 De Morgan’s Theorem
De Morgan’s Theorem:
 A  B  A  B
 A  B  A  B

Exc.1. Extend De Morgan’s Theorem for 3-inputs A, B & C.

Exc.2. Construct truth table & draw logic gates for

 A  B  A  B
Examples:
• Simplify the following expression to one having only single
variables inverted.
x  A  C   B  D 

• Use De Morgan’s theorem & then Boolean algebra rules on the

circuits shown to develop an equivalent circuit:

Exercises:
Use De Morgan’s theorem
and Boolean algebra on the
circuit shown to develop an
equivalent circuit:
Simulation: Logic Simplification
Exercises:
• Draw the logic circuit for the following equation, simplify the
equation, and construct a truth table & the circuit for the
simplified equation
x  AB   A  C   AB  A  B  C

x  A B
Example:
Active-LOW Input/Output Used in Microprocessor Systems

Typical gating circuitry used for microprocessor memory access.

Example: The Intel 8085A pin configuration
1.7 Universality of NAND & NOR Gates
• Using a combination of NANDs or a combination of
NORs, all the other logic gates (inverter, AND, OR,
NOR) can be formed.

Exc. Use NORs to construct Inverter, AND, OR & NOR.