A Low-Cost BIST Scheme for Test Vector Embedding in Accumulator-Generated Sequences

Table 2

Execution times of serial and linear searches versus the proposed 𝑂(1) time algorithm.

𝑛	Serial search 𝑂(2^𝑛)	Linear search 𝑂(𝑛) [11]	Proposed 𝑂(1)
10	0.05”	0.02”	0.02”
12	0.44”	0.03”	0.03”
14	6.36”	0.13”	0.04”
16	1.5 min	0.42”	0.05”
18	25 min	1.39”	0.06”
20	6 h	6.71”	0.20”
22	12 d	26.39”	0.57”
24	243 d	2 min	2.06”
26	11 yrs	8 min	8.67”
28	235 yrs	33 min	24.56”