1. S. Manich, L. García, J. Rius, R. Rodríguez, J. Figueras
Improving the Efficiency of Arithmetic BIST by Combining Targeted and General Purpose Patterns
UPC
S. Manich, L. García,
J. Rius, R. Rodríguez, J. Figueras

2. Reuse Internal Structures
Increment (I)
Seed (S)
Test Vectors
DATAPATH 
Test Pattern Generator
Signature Analyzer
First proposed in 1994 [5]
Better than LFSRs in 1996 [7]

3. Example 6 bits 1 

4. Example 6 bits 1 

5. Example 6 bits 1 

6. Example 6 bits 1 

7. Example 6 bits 1 

8. Example 6 bits 1 

9. Example 6 bits 1 

10. Example 6 bits 1 

11. TEST WINDOW Large Input Sizes   CUT GENERATOR COMPACTOR INCREMENT
SEED
TEST
WINDOW
CUT

12. The Key Problem (budget) M FC Test length N (Limited) L1 L2 L3 L4 I4
available
available
available I4 S4 I3
(S4 I4 L4) S3 I2
(S3 I3 L3) S2
(S2 I2 L2) I1
(S1 I1 L1) S1
Test length N
(Limited)

13. Initial List of TV
ATPG
CUT
TV(FC*) 1 2
...
k-1

14. Mayer et al. 1997 Random Optimize L1L2L3L4L5L6 I6 S6 I5 S5 I4 S4 I3 S3
sliding window I2 S2 I1 S1
TV(FC*) 1 2
...
k-1

15. Mayer et al. 1997 Random Optimize I1 Maximal cycle length
sliding window I1
TV(FC*) 1 2
...
k-1

16. Mayer et al. 1997 Random Optimize L1 I1 S1 sliding window TV(FC*) 1 21 2
...
k-1

17. Mayer et al. 1997 Random Optimize L1 I2 I1 S1 Maximal cycle length
sliding window I2 I1 S1
TV(FC*) 1 2
...
k-1

18. Mayer et al. 1997 Random Optimize L1L2 I2 S2 I1 S1 sliding window
TV(FC*) 1 2
...
k-1

19. Mayer et al. 1997 Drawback: Storage of random values  L1L2L3L4L5L6 I6
INCREMENT I2 S2  I1 S1
SEED
TV(FC*) 1 2
...
k-1

20. Chiusano et al. 2001
SEEDs
INCREMENTs
Random
TV(FC*) 1 2
...
k-1

21. Chiusano et al. 2001 Optimize L1L2L3L4L5L6 I6 S6 I5 S5 I4 S4 I3 S3 I2
SEEDs
INCREMENTs I5 S5 I4 S4 I3 S3
Optimize
Set Covering I2 S2 I1 S1
TV(FC*) 1 2
...
k-1

22. Chiusano et al. 2001 Drawback: Storage of random values  L1L2L3L4L5L6
INCREMENT I2 S2  I1 S1
SEED
TV(FC*) 1 2
...
k-1

23. Symbolic manipulation
Dorsch et al. 1998
Optimize
Symbolic manipulation
TV(FC*) 1 2
...
k-1

24. Symbolic manipulation
Dorsch et al. 1998
L1L2L3L4L5L6 I6 S6
Optimize
Symbolic manipulation I5 S5 I4 S4 I3 S3
Aproximations I2 S2 I1 S1
TV(FC*) 1 2
...
k-1

25. Dorsch et al. 1998
L1L2L3L4L5L6
Drawback:
Splitting
Aproximations

26. Dorsch et al. 1998 Drawback: Splitting   L1L2L3L4L5L6 TV(FC*)
INCREMENT 
INCREMENT
SEED 
SEED
TV(FC*) 1 2
...
k-1

27. Cataldo et al. 2000 Tunning Random parameters Optimize Random
L1L2L3L4L5L6
Random
Tunning
parameters I6 S6 I5 S5 I4 S4 I3 S3
Optimize
Genetic algorithm I2 S2 I1
Selection
and procreation
rules S1
TV(FC*) 1 2
...
k-1
Random

28. Cataldo et al. 2000  Drawback: Storage of random values
L1L2L3L4L5L6 I6 S6
Drawback:
Storage of
random values
Rules sensible
to CUT I5 S5 I4 S4 I3 S3
INCREMENT I2 S2  I1 S1
SEED
TV(FC*) 1 2
...
k-1

29. Our proposal: LUCSAM+ GPP TPP S9 S8 S7 S6 S5 S4 I3 S3 I2 S2 I1 S1
L1L2L3L4L5L6L7L8L9
TV(FC*) 1 2
...
k-1 S9 S8 S7 S6 S5
GPP S4 I3 S3 I2
TPP S2 I1 S1
TC(FC*) 1 2
...
m-1

30. Targeted Purpose Patterns (TPP)
INCREMENT 
SEED

31. Generic Purpose Patterns (GPP)
SEED 
SEED

32. Results
UPC