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

Path Sensitization via Boolean Difference

HardLogic CircuitAnalyze

Automated test pattern generation relies on algebraic methods to systematically discover test vectors for complex silicon designs.

The circuit under test implements the Boolean function F = AB + B'C + AC. Input A is suspected of having a Stuck-At-0 (SA0) fault.

Apply the Boolean difference method to derive the complete set of test vectors capable of detecting this fault. Determine the algebraic derivative dF/dA and identify the specific input combinations that sensitize the path from A to F while satisfying the fault activation criteria.

Constraints

  • Assume standard Boolean algebra rules and simplifications apply.
  • The fault is a single Stuck-At-0 (SA0) fault isolated to input A.
  • Test vectors should be evaluated assuming a standard ABC bit ordering.

Topics

ATPGTestingFault AnalysisBoolean Difference

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