CodiodeCodiode
Home
Problem Solving
Skill Tracks
My Assignments
Contests
Leaderboard
Community
Settings
Codiode/Problems/Combinational Logic

Fault Equivalence in Basic Gates

EasyLogic CircuitAnalyze

Manufacturing defects require physical testing, but testing every possible fault in a modern chip is computationally impossible. Design for Testability (DFT) relies on fault collapsing to group faults that produce identical output behaviors into equivalence classes.

The circuit below is a standard 4-input NAND gate with inputs A, B, C, D and output Y. A stuck-at fault model assumes a single node is permanently tied to logic 0 (SA0) or logic 1 (SA1).

Analyze the fault equivalence classes for this gate. Determine exactly which input faults are structurally indistinguishable from the output Y being stuck-at-1.

Constraints

  • Assume a single stuck-at fault model.
  • Only structural equivalence is considered.
  • The gate is an ideal combinational element with no timing defects.

Topics

logic-gatesdftfault-collapsingtesting

Solve this problem

Place the gates, wire them up and watch the signals settle. Every submission runs on the same simulation engine that grades it.

This problem is part of Codiode Pro. The statement above is free to read.

Sign in to solveSee what Pro unlocks

The circuit builder and code editor need a desktop screen. On a phone, read the problem here and open it on a laptop to solve.

Related problems

  • Binary to HexEasy
  • 1-to-4 Demultiplexer from AND and NOT GatesEasy
  • 2-to-4 Line Decoder with Active-High EnableEasy
  • Hex Nibble to BinaryEasy
  • Odd Parity Bit Generator for 3-bit DataEasy
  • Full Adder from Half AddersEasy
  • Modulo ArithmeticMedium
  • Two's Complement: Encode a Negative DecimalEasy

Browse all problems · Learning tracks