0% found this document useful (0 votes)
3 views3 pages

Digital Electronics Lesson Notes

Uploaded by

ezekielfila
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views3 pages

Digital Electronics Lesson Notes

Uploaded by

ezekielfila
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

EIE 342 / 327 | Digital Electronics

COMBINATIONAL LOGIC
CIRCUITS
A Complete, Professional Lesson Guide

--------------------------------------------------------------------------------

1. What is Combinational Logic?


A combinational logic circuit is a digital circuit whose output(s) depend ONLY on the
present combination of input values. Unlike sequential logic, it has no 'memory' of what
happened in the past.

Property Combinational Sequential


Output depends on Present inputs only Present inputs + past states
Memory None Flip-flops / Latches
Examples Adders, MUX, Decoders Counters, Registers

2. The Design Process


Designing any combinational circuit follows a specific 4-step workflow:

1. 1. Understand the Problem: Identify inputs (N) and outputs.


2. 2. Truth Table: List all 2^N possible combinations.
3. 3. Boolean Expression: Derive the Sum of Products (SOP) from the '1' outputs.
4. 4. Logic Diagram: Draw the circuit using logic gates (AND, OR, NOT).

3. Essential Components

3.1 Decoders
A decoder identifies a specific binary code. For N inputs, there are 2^N outputs. Only one
output is active (HIGH) at any given time based on the input code.

3.2 Multiplexers (MUX)


A MUX acts as a digital switch. It selects one of many inputs and forwards it to a single
output line based on 'select' inputs.
4. Transition to Sequential Logic
While combinational logic is instantaneous, sequential logic introduces the concept of state.
The primary building blocks are Latches and Flip-Flops.

4.1 The SR Latch


The Set-Reset (SR) latch is the simplest memory element. It has a 'Forbidden State' (S=1,
R=1) that must be avoided.

4.2 JK Flip-Flop
The JK flip-flop improves upon the SR latch. When J=1 and K=1, the output 'Toggles' (flips to
the opposite state) on the clock edge, eliminating the forbidden state issue.
Summary Checklist for Exams:

✓ Can you derive a Truth Table from a word problem?


✓ Can you simplify expressions using Boolean Algebra?

✓ Do you understand the difference between Level-Triggered (Latches) and Edge-




Triggered (Flip-Flops)?

You might also like