Min Terms in Binary Representation- Boolean Algebra Guide

What Are Minterms in Boolean Algebra?

A minterm is a product (AND) term containing every variable in a Boolean function, either in its original form or complemented. Each minterm represents exactly one row in a truth table where the output is 1.

Think of it this way: a minterm is the exact "address" of a HIGH output. It tells you precisely which input combination produces a 1.

Binary Representation of Minterms

Each minterm corresponds to a unique binary number. The convention is simple: 0 = complemented variable, 1 = uncomplemented variable.

For a function with n variables, there are 2ⁿ possible minterms.

Example with 2 Variables

Example with 3 Variables

Canonical Sum of Products (Canonical SOP)

The canonical SOP form is simply the OR of all minterms where the output is 1. You use the Σ (sigma) notation for this.

Example truth table:

The canonical SOP form is: F = A'B + AB' + AB

In sigma notation: F = Σm(1, 2, 3)

How to Find Minterms from a Truth Table

Here's the straightforward process:

• Identify all rows where the output is 1
• For each row, write down the variable: use primed version if input is 0, unprimed if input is 1
• AND all variables together for that row
• OR all the minterms together

Getting Started: Finding Minterms Step by Step

Let's work through a complete example with 3 variables.

Truth Table:

Step 1: Identify rows with F = 1. These are rows 1, 3, 4, and 6 (decimal 1, 3, 4, 6).

Step 2: Write each minterm.

• Row 1 (001): A'B'C
• Row 3 (011): A'BC
• Row 4 (100): AB'C'
• Row 6 (110): ABC'

Step 3: The canonical form is:

F = A'B'C + A'BC + AB'C' + ABC'

In sigma notation: F = Σm(1, 3, 4, 6)

Minterms vs Maxterms

This trips up a lot of people. Here's the difference:

A maxterm is the complement of a minterm. If minterm m(3) = AB'C, then maxterm M(3) = A' + B + C'.

Why Minterms Matter

You need minterms when:

• You're building circuits from a truth table specification
• You want to derive the canonical SOP form before simplification
• You're working with digital logic design or FPGA programming
• You need to implement functions using only NAND or NOR gates

The canonical form is rarely the final implementation. It's the starting point before you simplify using Karnaugh maps or the Quine-McCluskey method.

Quick Reference: Variable Count to Minterm Count