Absorption in Boolean algebra is a simplification rule stating that a variable ORed with its ANDed product (A + AB) or ANDed with its ORed sum (A(A + B)) always simplifies to just the original variable (A). When you apply this mathematical concept to physical hardware or programmable logic, it directly changes your bill of materials (BOM), reduces propagation delay, and shrinks PLC scan cycle times. Beginners frequently confuse absorption with the Consensus theorem or De Morgan's Laws, but absorption is strictly about a term 'swallowing' a larger, redundant term that contains itself.
The Core Absorption Laws Explained
There are two primary forms of the absorption law in digital logic design. Both rely on the fundamental identities of Boolean algebra, specifically that 1 + X = 1 and 1 * X = X. According to standard digital design references like All About Circuits, these rules are foundational for minimizing sum-of-products (SOP) and product-of-sums (POS) expressions.
Law 1: The OR-AND Absorption
Formula: A + AB = A
Proof: Factor out A to get A(1 + B). Since 1 + anything in Boolean logic equals 1, this becomes A(1), which simplifies to A. If A is true, the entire expression is true regardless of B. If A is false, both terms are false.
Law 2: The AND-OR Absorption
Formula: A(A + B) = A
Proof: Distribute A to get AA + AB. Since AA = A, this becomes A + AB, which is the exact same expression as Law 1, simplifying back to A.
| A | B | AB | A + AB |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 |
As the truth table demonstrates, the output column for A + AB perfectly mirrors the input column for A. The variable B is entirely redundant.
Worked Numeric Example: Gate Count and Delay Reduction
To see what absorption changes in a real circuit, let us look at a physical discrete logic design. Suppose you are building a safety interlock board for a CNC machine using standard 74HC-series CMOS logic. The original, unoptimized Boolean equation derived from the truth table is:
Y = (A · B) + (A · B · C) + D
Notice the sub-expression (A · B) + (A · B · C). If we let X = (A · B), the expression becomes X + XC. By the absorption law, X + XC = X. Therefore, the entire equation simplifies to:
Y = (A · B) + D
Here is the exact numeric impact on your hardware BOM and timing, based on typical 2026 low-volume pricing and Texas Instruments 74HC datasheet propagation delays (at 5V, 25°C):
Before Absorption (Unoptimized)
- Gates Required: One 3-input AND, one 2-input AND, two 2-input ORs (cascaded).
- ICs Needed: 1x SN74HC11 (3-input AND), 1x SN74HC08 (2-input AND), 1x SN74HC32 (2-input OR).
- Total IC Count: 3 chips.
- BOM Cost: 3 × $0.42 = $1.26 per board.
- Max Propagation Delay: Signal passes through the 3-input AND (18ns typical) then the OR gate (14ns typical). Total delay = 32ns.
After Absorption (Optimized)
- Gates Required: One 2-input AND, one 2-input OR.
- ICs Needed: 1x SN74HC08, 1x SN74HC32.
- Total IC Count: 2 chips.
- BOM Cost: 2 × $0.42 = $0.84 per board.
- Max Propagation Delay: Signal passes through the 2-input AND (14ns typical) then the OR gate (14ns typical). Total delay = 28ns.
Where You Meet This in Practice
You will rarely sit down with a pen and paper to apply absorption laws unless you are debugging a compiler's output or designing discrete logic. In modern workflows, this concept surfaces in three specific areas:
1. PLC Ladder Logic Optimization
In industrial automation, Programmable Logic Controllers (PLCs) execute ladder logic rungs in a continuous scan cycle. If a rung contains redundant parallel/series contact branches that fit the absorption profile, the PLC still evaluates them unless you manually simplify the logic. In high-speed packaging machines where scan times must remain under 2 milliseconds, eliminating redundant branches via absorption reduces the CPU instruction count, directly shrinking the scan cycle time and preventing I/O lag.
2. FPGA and CPLD Synthesis
When you write Verilog or VHDL for an FPGA (like an Intel Cyclone or Xilinx Artix), the synthesis tool (Quartus or Vivado) automatically applies absorption laws to map your code into Look-Up Tables (LUTs). However, if you read the post-synthesis resource utilization report and notice you are using more LUTs than mathematically necessary, it is often because complex conditional statements in your code prevented the compiler from recognizing the absorption pattern. Rewriting your RTL code to expose the A + AB pattern allows the compiler to pack the logic into fewer LUTs, freeing up routing resources.
3. Relay Logic and Legacy Retrofits
When retrofitting old electromechanical relay panels to modern solid-state controllers, you must translate physical relay wiring into Boolean equations. Physical relay circuits are notorious for redundant 'holding' contacts that create massive A + AB structures. Applying absorption before programming the replacement controller ensures you do not waste PLC I/O points on physically wired redundant feedback loops.
Frequently Asked Questions
How does absorption boolean algebra differ from De Morgan's laws?
De Morgan's laws are used to manipulate and distribute inversions (NOT gates) across AND and OR operations, effectively changing the type of gate while preserving the logic state (e.g., converting a NAND into an OR with inverted inputs). Absorption, on the other hand, does not involve inversion at all. It is strictly a reduction tool used to delete redundant terms that are overshadowed by a simpler version of themselves, thereby reducing the total number of gates required.
Can absorption laws be applied to PLC ladder logic rungs?
Yes, absolutely. In ladder logic, an AND operation is represented by series contacts, and an OR operation is represented by parallel branches. If you have a branch with a single normally-open contact 'A' in parallel with a series branch containing contact 'A' and contact 'B' (the physical equivalent of A + AB), the series branch is redundant. You can safely delete the 'A and B' series branch from the rung without changing the machine's operational behavior, which simplifies troubleshooting for maintenance technicians.
What is the consensus theorem and how does it relate to absorption?
The consensus theorem is another simplification rule, stated as AB + A'C + BC = AB + A'C. The term 'BC' is the 'consensus' term and can be eliminated. People confuse it with absorption because both eliminate terms to simplify equations. The key difference is that absorption eliminates a term that contains the other term (like AB being absorbed by A), whereas the consensus theorem eliminates a term formed by the non-complementary variables of two other terms. Both are vital for minimizing sum-of-products expressions, but they apply to entirely different structural patterns in the equation.
