Three-Input Cascaded AND Gate
Two cascaded 2-input AND gates implement a three-input conjunction. The output is HIGH only for input 111, while the unequal gate depths remain visible in the topology.
What You'll Learn
- Build a 3-input AND from two 2-input ANDs and verify the result.
- Apply AND associativity: (A·B)·C = A·(B·C) regardless of grouping.
- Read the 3-input AND truth table — exactly one of 8 rows produces 1.
- Distinguish AND chaining (this circuit) from a single 3-input AND primitive.
- Identify multi-factor authentication and safety interlocks as real AND applications.
How It Works
Three keys, one chest, one rule: every key must be on for the chest to open. The production circuit cascades two 2-input AND gates: the first combines Key 1 and Key 2, and the second combines that intermediate result with Key 3. The Treasure Unlocked light is high only when all three inputs are 1.
This is a direct example of AND associativity. The Boolean function (A·B)·C equals A·(B·C), even though those groupings use different physical connections.
With three inputs there are 2³ = 8 stable combinations. Exactly one—111—produces Treasure Unlocked = 1; the other seven produce 0. A three-input OR has the complementary count of high-output rows, but it is not the logical inverse of AND.
The cascade demonstrates one valid way to realize a three-input conjunction from two-input primitives. It does not claim that every wide AND cell has this exact internal topology. The visible graph also has unequal path depth: Key 1 and Key 2 traverse two gates, while Key 3 traverses one.
Truth Table
Three keys, 8 combinations. Only the all-keys-on row asserts Treasure Unlocked.
| Inputs | Output | |||
|---|---|---|---|---|
| Key 1 | Key 2 | Key 3 | Treasure Unlocked | |
| 0 | 0 | 0 | 0 | No keys turned |
| 0 | 0 | 1 | 0 | |
| 0 | 1 | 0 | 0 | |
| 0 | 1 | 1 | 0 | |
| 1 | 0 | 0 | 0 | |
| 1 | 0 | 1 | 0 | |
| 1 | 1 | 0 | 0 | Key 1 and Key 2 on, but Key 3 missing |
| 1 | 1 | 1 | 1 | All three turned — chest opens |
Boolean Expression
Standard 3-input AND — output is 1 only if every input is 1.
Same expression with explicit chaining of two 2-input ANDs.
Equivalent grouping — associativity guarantees the same output.
Try It Step-by-Step
Set the listed controls in the embedded circuit, then compare the observed modeled state with the expected result.
- 1Key 1=0Key 2=0Key 3=0Expected:
Treasure Unlocked = 0What you'll see:All keys off — chest stays locked. The default state. - 2Key 1=1Key 2=1Key 3=0Expected:
Treasure Unlocked = 0What you'll see:Key 1 and Key 2 are on but Key 3 is still off. AND requires every input to be high. - 3Key 1=1Key 2=1Key 3=1Expected:
Treasure Unlocked = 1What you'll see:All three keys on — chest opens. The only winning combination. - 4Key 1=0Key 2=1Key 3=1Expected:
Treasure Unlocked = 0What you'll see:Turn Key 1 off and the chest re-locks immediately. Removing any single key drops the AND output to 0.
Components Used
Applications and Design Context
Policy conjunction. An authorization policy can require several independently validated factors before granting access; the Boolean decision is an AND even when software, not literal gates, evaluates it.
Safety-rated interlocks. Certified control hardware can require guard-closed, emergency-stop-released, and operator-permissive conditions together. The simple gate illustrates the logic requirement, not the complete safety architecture.
Memory write qualification. A design may combine select, write-enable, and data-valid conditions before allowing a write transaction. Exact polarities and timing depend on the interface.
Canonical SOP minterms. A·B·C is the minterm for input 111. ORing selected minterms is one way to describe a canonical Sum-of-Products function.
Permission checks. Logged-in, role-authorized, and confirmation-present flags can form an all-required condition.
Frequently Asked Questions
Why use two 2-input ANDs instead of one 3-input AND?
The cascade makes decomposition and associativity visible. Some cell libraries provide wider AND functions, while synthesis may instead use narrower gates or other equivalent structures according to timing, area, power, and fan-in constraints.
Does the order of chaining matter?
No. (A AND B) AND C produces the same output as A AND (B AND C) — that's the associativity property. The simulator may show different gate placement but the truth table is identical.
What's the propagation delay through a chain of two ANDs?
A change on Key 1 or Key 2 traverses two AND stages; a change on Key 3 traverses only the final stage. Numerical delay depends on the selected cells, input slew, loading, process, supply, temperature, and routing, so this schematic alone cannot justify a picosecond value.
Can I extend this to a 4-key chest?
Yes — chain another AND. Either (((A·B)·C)·D), or ((A·B)·(C·D)), or any other associative grouping. All give the same result: output 1 only when every input is 1.
How does this relate to Sum-of-Products form?
An ANDed expression is a product term. It is a minterm only when it contains every input variable exactly once, either complemented or uncomplemented. A·B·C is therefore the minterm for row 111; canonical SOP forms OR selected minterms together.