You are viewing a free preview of this lesson.
Subscribe to unlock all 10 lessons in this course and every other course on LearningBro.
Simplifying Boolean expressions is the capstone skill of OCR H446 section 1.4.3 — the point where the gates, truth tables, basic laws and De Morgan's all come together for a purpose. A simplified expression uses fewer operations, which translates directly into a circuit with fewer gates: lower silicon cost, less power and heat, and a shorter critical path so the circuit can run faster. This lesson is deliberately worked-example-heavy, because simplification is a skill honed by practice rather than a fact to be recalled. Every example below shows each manipulation step explicitly and names the law that licenses it — exactly the discipline an examiner rewards.
Unlike a Karnaugh map (next lesson), algebraic simplification has no guaranteed recipe — there is no single sequence of moves that always yields the minimal form. What it offers instead is flexibility: it works for any number of variables, it makes your reasoning transparent, and it deepens your command of the laws. The art lies in pattern recognition — learning to see, in a sprawling expression, the complement pair waiting to be created or the redundant term waiting to be absorbed.
A useful way to frame the whole activity: simplification is a search. You start at one expression and want to reach an equivalent, cheaper one, where each "move" is a single law application. Because many move-sequences exist and only some lead to the minimum, two students can take quite different valid routes to the same answer — and both are correct, provided every step is sound and named. That freedom is liberating once you trust the laws, but it also means you must develop judgement about which move to try first. The strategy checklist below encodes the moves that, in practice, pay off most often: clear the bars, factor to expose a complement pair, annihilate it, then tidy up. Internalise that rhythm and most exam expressions yield within four or five lines.
It also helps to keep the goal concrete. "Simplest" usually means the minimal sum-of-products form: the fewest product terms, each with the fewest literals. Occasionally a product-of-sums form is cheaper, or a specific gate type is mandated, in which case the target shifts — but unless told otherwise, aim for minimal SoP, because that is what the mark schemes and the K-map lesson both expect.
This lesson covers the algebraic-simplification strand of OCR H446 section 1.4.3 (Boolean algebra):
It is the synthesis of the three preceding lessons (basic laws, De Morgan's) and the truth-table techniques, and it sets up the K-map lesson, which automates much of what is done here by hand.
| Before simplification | After simplification |
|---|---|
| More gates needed | Fewer gates needed |
| Higher power consumption | Lower power consumption |
| More complex circuit | Simpler circuit |
| Harder to test and debug | Easier to test and debug |
| Longer critical path (slower) | Shorter critical path (faster) |
Each removed term or literal is one or more physical gates removed. In a processor of billions of gates, simplification done well at design time compounds into measurable savings in die area, battery life and clock speed — so this is an engineering optimisation, not a paper exercise.
The benefits are worth unpacking, because they explain why an exam expects this skill. Cost: gates occupy silicon, and silicon area is money; a design that needs half the gates can use a smaller, cheaper chip or pack more functionality into the same one. Power and heat: every gate that switches draws current and dissipates heat, so fewer gates mean longer battery life in a phone and less cooling in a data centre. Speed: a signal must ripple through every gate on its path, and the longest such path (the critical path) sets the maximum clock frequency; removing gates from that path lets the whole processor run faster. Reliability and testability: fewer components mean fewer things to fail and fewer cases to test. A single simplified sub-expression rarely matters on its own, but the same discipline applied across an entire design is the difference between a competitive product and an also-ran.
There is no universal algorithm, but this ordered checklist resolves the great majority of exam expressions:
Exam Tip: Name the law at every step. OCR mark schemes award marks for the justification, so an unlabelled jump — even a correct one — can forfeit marks.
The ordering of the checklist is not arbitrary. Long bars come first because, until a NOT-over-compound is broken open with De Morgan's, the structure underneath is hidden and the other laws cannot reach it — you could stare at A+B+AB forever without progress until De Morgan's reveals the two products inside. Factoring comes next because complement pairs (X+X, X⋅X) almost never appear ready-made; you usually have to manufacture them by pulling a common variable outside a bracket so that the leftover terms form a variable beside its own negation. Only once a pair exists can the complement law fire and produce a constant, after which the identity and null laws sweep that constant away. Idempotency is housekeeping that runs throughout — whenever a step accidentally duplicates a term, merge the copies before they multiply. Knowing why each move sits where it does turns the checklist from a list to memorise into a logic you can reconstruct under pressure.
Simplify A⋅B+A⋅B+A⋅B.
Step 1 — factor A from the first two terms:
A⋅B+A⋅B=A⋅(B+B)[distributive] =A⋅1=A[complement, then identity]
So the expression is now A+A⋅B.
Step 2 — apply the derived identity A+A⋅B=A+B. Spelled out from first principles:
A+A⋅B=(A+A)⋅(A+B)[distributive: OR over AND] =1⋅(A+B)[complement] =A+B[identity]
Result: A⋅B+A⋅B+A⋅B=A+B.
Verification:
| A | B | A⋅B | A⋅B | A⋅B | sum | A+B |
|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 0 | 0 | 1 | 1 |
Both columns are (0,1,1,1) — verified. A three-AND, two-OR, one-NOT circuit collapses to a single OR gate.
This example is the archetype of the whole topic, so it repays study. Notice the two-phase rhythm: phase one created a complement pair deliberately by factoring A out of the first two minterms, leaving B+B which the complement law turned into a constant; phase two then dealt with the awkward A+A⋅B leftover using the second distributive law to engineer another complement pair, A+A. At no point did a pair appear by luck — each was manufactured. That is the mental habit to drill: when stuck, ask "which variable can I factor out so that what remains is a variable beside its own complement?"
Simplify A+B+(A⋅B).
Step 1 — the first term has a long bar over an OR, so De Morgan's second law applies:
A+B+A⋅B=(A⋅B)+(A⋅B)[De Morgan 2nd]
Step 2 — this is now a sum of two products. It is 1 when both inputs are 0 or both are 1, i.e. when they are equal — the XNOR / equality function A⊕B. It genuinely needs both product terms, so A⋅B+A⋅B is already minimal in SoP form.
| A | B | A⋅B | A⋅B | Result |
|---|---|---|---|---|
| 0 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 |
The lesson here: De Morgan's opened the expression into a recognisable form, even though no further reduction was possible. Sometimes "simplest" is reached after a single transformation, and a big part of the skill is knowing when to stop. A candidate who keeps grinding on A⋅B+A⋅B — trying to factor or absorb where nothing applies — wastes time and risks introducing an error. Recognising the XNOR shape (see the "Recognising Standard Functions" section below) tells you instantly that this is the floor. Confidence to halt is as valuable as the ability to continue.
Simplify (A+B)⋅(A+C)⋅(B+C).
Step 1 — combine the first two factors with OR-over-AND distribution (A is common):
(A+B)⋅(A+C)=A+(B⋅C)[distributive]
Step 2 — AND the result with (B+C):
(A+(B⋅C))⋅(B+C) =A⋅(B+C)+(B⋅C)⋅(B+C)[distributive]
Step 3 — the second term absorbs: (B⋅C)⋅(B+C)=B⋅C (since B⋅C already implies B+C):
=A⋅(B+C)+B⋅C[absorption]
Step 4 — expand the first term:
=A⋅B+A⋅C+B⋅C[distributive]
This is the majority (voting) function: output 1 when at least two of the three inputs are 1 — the same function derived from a truth table in the truth-tables lesson. The PoS form (A+B)(A+C)(B+C) and the SoP form AB+AC+BC are equal; which is "simpler" depends on the target gates, but AB+AC+BC is the standard minimal SoP answer.
This example also showcases the absorption step that students most often miss. At Step 3, the term (B⋅C)⋅(B+C) looks like it should expand, but absorption collapses it in one move because B⋅C already implies B+C — wherever both B and C are 1, certainly at least one of them is. Spotting that an AND term is a special case of a nearby OR term (or vice versa) is the absorption instinct, and it routinely saves two or three lines of expansion. The majority function appears throughout computing — in fault-tolerant systems that vote across triplicated components, and in the carry logic of adders — so recognising it on sight is doubly worthwhile.
Simplify A⋅(B+B).
Step 1 — inside the bar, B+B=1 (complement):
A⋅1
Step 2 — identity removes the 1:
=A[identity]
Step 3 — double negation:
=A[double negation]
A deceptively busy expression is just A. The key was simplifying inside the bar before touching the bar itself — the complement pair B+B was the trapdoor. A common wrong instinct here is to attack the outer bar with De Morgan's immediately, which gives A+(B+B)=A+1=A+0=A — the same answer, but via a longer route, and only if you correctly evaluate 1=0. Simplifying the inner constant first is shorter and less error-prone. The general principle: resolve constants and complement pairs wherever they sit, including deep inside a bar, before doing structural surgery on the bar itself.
Simplify A⋅B⋅C+A⋅B⋅C+A⋅B⋅C+A⋅B⋅C.
Step 1 — pair the terms and factor the shared part of each pair:
=A⋅B⋅(C+C)+A⋅B⋅(C+C)[distributive] =A⋅B⋅1+A⋅B⋅1[complement] =A⋅B+A⋅B[identity]
Step 2 — factor A again (this is Worked Example 1's Step 1):
=A⋅(B+B)=A⋅1=A[distributive, complement, identity]
Four three-variable product terms reduce to the single literal A: the output ignores B and C entirely. On a Karnaugh map this collapse would appear as one group of four cells covering an entire half of the grid — algebra and map agreeing once again.
The structure here is worth naming because it recurs constantly. Whenever a set of minterms includes every possible combination of some variables while another variable is held fixed, those variables cancel completely. These four terms are exactly the four combinations of B and C (BC, BC, BC, BC) all ANDed with A — so B and C "span their whole space" and vanish, leaving only the fixed A. Recognising this lets you sometimes skip straight to the answer: "all combinations of B and C, with A constant, equals A." The step-by-step factoring proves it rigorously, but the spanning insight is what lets an experienced candidate write the answer down almost immediately and then justify it.
Simplify X=(A⋅B)+(A⋅B⋅C)+(A⋅C).
Step 1 — factor A from all three terms:
X=A⋅(B+(B⋅C)+C)[distributive]
Subscribe to continue reading
Get full access to this lesson and all 10 lessons in this course.