Meaning
Test vector generation strategies for boundary-scan testing utilise sequence-reduction techniques to identify short circuits on circuit board nets with fewer patterns than exhaustive testing. By employing modified counting, test engineers can run an optimized subset of binary patterns that still guarantees the detection of all bridge faults. This approach significantly shortens the test time on dense boards containing thousands of interconnects.
Fault Coverage
Run-time diagnostics must distinguish between distinct net shorts with minimal scan cycles. Implementing modified counting provides the ability to locate specific faults on adjacent pin groups by using unique sequence patterns.
Pattern Generation
Automated test equipment calculates the necessary vectors by modifying a standard binary count to exclude all-zero and all-one sequences. A typical run utilizing modified counting increases the pattern count logarithmically rather than linearly, which keeps the total execution time manageable as the pin count rises. This algorithm distributes the test vectors across the boundary-scan registers in a pre-defined sequence that maximises the distance between identical signal transitions.
Execution Constraint
High-density arrays of interconnects on ball grid packages demand careful allocation of register space during pattern execution. The boundary of this algorithm is reached when the test hardware cannot store the generated sequence in its local buffer memory. Consequently, the tester must stream the patterns in segments, which increases the total interface clock cycles and slows down the overall production throughput.