Contents

Digital Electronics
Number Systems
Logic Gates
Boolean Algebra
Combinational Circuits
Sequential Circuits
Memory & PLDs
Digital System Design
Other Topics
Other Subjects
Section Progress31%

5 of 16 articles

De Morgan Applications

Multi-variable De Morgan, bubble pushing, gate conversion.

Darshan N
Updated: 19 March 2026
4 min read

De Morgan's theorems become most powerful when applied to multi-variable expressions, gate-level schematic interpretation, and universal gate conversion. While the two-variable forms are foundational, real digital circuits involve complex Boolean expressions with three or more variables and mixed gate types. Mastering De Morgan applications allows a designer or GATE aspirant to simplify, convert, and verify logic circuits efficiently.

De Morgan Applications OverviewMulti-variable(ABC)' = A'+B'+C'(A+B+C)' = A'B'C'Apply to each variableBubble PushingMove bubble output to inputsSwap gate type: OR and ANDLogic function unchangedGate ConversionNAND replaces AND+NOTNOR replaces OR+NOTUniversal gate designStep-by-Step: Complement of (AB + C)Step 1: Identify the outermost operation(AB + C) — outermost is OR between AB and CStep 2: Apply De Morgan (Theorem 1 on outer OR)(AB + C)' = (AB)' · C'Step 3: Apply De Morgan (Theorem 2 on inner AND)(AB)' = A' + B'Step 4: Final Result(AB + C)' = (A' + B') · C'
Figure 1: Overview of De Morgan theorem applications in multi-variable expressions, bubble pushing, and gate conversion

Core Concept Explanation

When De Morgan's theorems are applied to expressions involving more than two variables, the same rules hold but must be applied carefully layer by layer. For a three-variable AND expression, (ABC)' = A' + B' + C'. For a three-variable OR expression, (A+B+C)' = A'B'C'. The key principle is that complementation distributes across all variables in the expression, and the connecting operation flips from AND to OR or vice versa.

**Bubble pushing** is a graphical technique used in schematic design that directly applies De Morgan's theorems. The rule is simple: a bubble (inversion circle) can be moved from the output of a gate to all of its inputs simultaneously, provided the gate type is changed from AND to OR or from OR to AND. The logic function produced at the output remains unchanged. This technique is especially useful when checking active-low signal compatibility at gate inputs and outputs in a design.

Gate conversion using De Morgan's theorems allows any circuit to be redrawn using only NAND gates or only NOR gates. A NAND gate followed by an inverter gives an AND gate. Two NAND gates can implement an OR gate by inverting both inputs before the NAND, which is the direct application of the first De Morgan theorem in reverse. This is why NAND and NOR are called **universal gates**.

When complementing a complex multi-level expression, the correct approach is to apply De Morgan from the outermost operation inward, one level at a time. Attempting to complement the entire expression in one step without tracking the hierarchy leads to errors. Each complemented sub-expression must be handled by the appropriate De Morgan theorem based on whether the enclosed operation is AND or OR.

Mathematical Expression

The multi-variable generalizations are stated as (A · B · C · ... · N)' = A' + B' + C' + ... + N' for the first theorem, and (A + B + C + ... + N)' = A' · B' · C' · ... · N' for the second theorem. For a mixed expression like (AB + CD)', the procedure applies De Morgan to the outer OR first, giving (AB)'(CD)', and then applies it again to each AND group: (A'+B')(C'+D'). This two-pass approach handles any complexity.

Practical Understanding

In CMOS integrated circuit design, NAND and NOR gates are preferred because their pull-down networks (for NAND) or pull-up networks (for NOR) are simpler and faster than equivalent AND or OR gate circuits. De Morgan's theorem is the mathematical tool that makes NAND-only or NOR-only implementation possible from any given Boolean function. Every synthesis tool in industry uses this principle internally.

In schematic verification, engineers use bubble pushing to check whether the correct active level (active-high or active-low) of a signal is being used at each gate input. A mismatch between a gate's bubble and the signal's active level indicates a logic error. De Morgan equivalences provide the formal basis for this check.

Example
Given:
Expression: F = (A·B·C)'
A = 1, B = 1, C = 0

Why this formula applies:
Complementing a three-variable AND expression uses De Morgan Theorem 1

Formula:
(A·B·C)' = A' + B' + C'

Substitution:
Left side: (1·1·0)' = (0)' = 1
Right side: (1)' + (1)' + (0)' = 0 + 0 + 1 = 1

Calculation:
Left side = 1
Right side = 1

Final Answer:
Both sides equal 1. Multi-variable De Morgan verified for A=1, B=1, C=0.
Exam Tip: In GATE questions involving complementing expressions like (AB+CD)', always apply De Morgan from the outermost operation inward. A common mistake is to complement individual variables first. The outer structure determines which theorem to apply first.

Loading lab...

Quick Revision

  • Multi-variable De Morgan: (ABC)' = A'+B'+C' and (A+B+C)' = A'B'C'.
  • Bubble pushing: move output bubble to all inputs and swap gate type (AND becomes OR, OR becomes AND).
  • For mixed expressions like (AB+CD)', apply De Morgan to the outer operation first: (AB)'(CD)' = (A'+B')(C'+D').
  • NAND and NOR are universal gates because De Morgan's theorems allow any function to be expressed using only one type.
  • Bubble pushing does not change the logic function, only the visual representation of the gate.
  • Exam trap: applying complement to individual terms of a sum or product without using De Morgan is a direct error.
  • Always complement the entire sub-expression enclosed in brackets using the correct theorem for its internal operation.

De Morgan Applications

Apply multi-variable De Morgan, bubble pushing, and gate conversion to solve circuit problems.

Question 1 of 3

Q1.Using bubble-pushing, a NAND gate (bubble on output) is equivalent to which gate with bubbles on inputs?