ADJACENCY: TOROIDAL / CODE: GRAY
VARS: {A,B,C,D} / Σm(1,5,13,15) + d(3,7)
PRIME_IMPLICANTS: OPTIMIZED
STATE: MINIMAL
ASKiIMAN™ DOOR 03 / THE DIGITAL MACHINE / REALM 06
--:-- · -- --- ----
00011110
00011110

Ontological Layer: Logic Optimization

Minimization & K-Maps

The Geometry of Logical Reduction

Visualizing Boolean Space

Raw Boolean algebra can be tedious and prone to human error. The Karnaugh Map (K-Map) solves this by mapping truth tables onto a geometric grid arranged in Gray Code. Because adjacent cells differ by only one variable, visual grouping physically cancels out redundant logic. This realm is the critical transition from theoretical truth tables to optimized, cost-effective hardware.

TRUTH TABLE → MINTERMS → K-MAP GRID → ADJACENCY (GRAY CODE) → DON'T CARES PRIME IMPLICANTS → ESSENTIAL GROUPS → MINIMAL SOP/POS → OPTIMIZED CIRCUIT

The 12 Optimization Nodes

Ontological Mapping: Algebra to Geometry

GROUP 01-02

Why Minimize? & Algebra

A+A'B
→
A+B
  • 01.2 Fewer Literals = Fewer Gates
  • 01.6 Lower Prop Delay & Cost
  • 02.2 Boolean Laws Application
  • 02.6 Consensus Theorem Tricks
 GROUP 03

Boolean Function Forms

  • 03.3 Standard SOP & POS
  • 03.5 Canonical Forms
  • 03.7 Minterms (Evaluate to 1)
  • 03.8 Maxterms (Evaluate to 0)
 GROUP 04, 08

K-Map Fundamentals

01
↓
11
  • 04.3 Gray-Code Cell Ordering
  • Only 1 variable changes per step
  • 08.1 Horizontal/Vertical Adjacency
  • 08.5 Toroidal (Cylindrical) Map
 GROUP 05-06

2 & 3-Variable Maps

  • 05.1 Four Cells (2 Vars)
  • 06.1 Eight Cells (3 Vars)
  • 06.3 Pair (Eliminates 1 Var)
  • 06.4 Quad (Eliminates 2 Vars)
 GROUP 07

4-Variable K-Maps

1
1
  • 07.1 Sixteen Cells (4 Vars)
  • 07.5 Octets (Eliminates 3 Vars)
  • 07.7 Wrap-around Adjacency (Edges)
  • Corner Adjacency (Forms a Quad)
 GROUP 09

Grouping Rules

  • 09.1 Must be powers of 2 (1,2,4,8...)
  • 09.3 Largest possible groups
  • 09.4 Minimum number of groups
  • 09.5 Overlapping is allowed/required
 GROUP 10

Prime Implicants

  • 10.1 Implicant (Any valid group)
  • 10.2 Prime Implicant (PI - Largest)
  • 10.3 Essential PI (Covers unique 1)
  • EPIs must be in final expression
 GROUP 11

SOP Minimization

Σm (1,5,13,15)
  • 11.1 Group 1s in the K-Map
  • 11.3 Eliminate changing variables
  • 11.2 Derive Product (AND) terms
  • 11.5 Combine with OR (Sum of Prods)
 GROUP 12

POS Minimization

ΠM (0,2,8,10)
  • 12.1 Group 0s in the K-Map
  • 12.3 Eliminate changing variables
  • 12.2 Derive Sum (OR) terms (Invert vars)
  • 12.5 Combine with AND (Prod of Sums)
 GROUP 13

Don't-Care Conditions

  • 13.1 Meaning of X or d
  • 13.2 Invalid/Impossible inputs
  • 13.4 Treat as 1 or 0 strategically
  • 13.5 Do not group unneeded X's
 GROUP 15-16

Realization & Hazards

  • 15.3 NAND-NAND (SOP) realization
  • 16.1 Static Hazards (Glitches)
  • 16.2 Caused by gate delay differences
  • 16.3 Fix via redundant terms (Consensus)
 FINAL PROTOCOL

14, 17 — Circuit Optimization Lab

1. MAP MINTERMS & DON'T CARES
2. FIND ESSENTIAL PRIME IMPLICANTS
3. COVER REMAINING 1s (MINIMAL GROUPS)
[1] TRUTH TABLE [2] K-MAP ENTRY [3] EPI ISOLATION [4] REDUNDANCY CHECK [5] NAND IMPLEMENTATION

A strictly executed K-Map guarantees the absolute mathematical minimum of logic gates required. It is the final step of theory before moving into Realm 07: Combinational Logic, where these minimal expressions become functional hardware modules like Adders and Multiplexers.

SIMULATION RUNNING