Proceedings/Proceedings - International Test Conference · 2006 · 29 citations · 13 references
Mathematical ProgrammingSequential ExpansionEngineeringTest VectorsSoftware TestingSequential DecompressionTest DerivationComputer ArchitectureComputer EngineeringInverse ProblemsComputer ScienceStatistical InferenceIllinois ScanParallel ComputingData CompressionSignal ProcessingRegression Testing
Existing techniques that incorporate decompressor constraints in the ATPG search/backtrace (e.g., Illinois scan) are based on combinational expansion in which each scan slice must be encoded using only the free-variables arriving from the tester in the current clock cycle. Sequential expansion is more powerful as it allows free-variables across multiple clock cycles to be used, however conventional approaches for sequential expansion that are based on linear finite state machines (LFSRs) and ring generators are not amenable to including the constraints in the ATPG backtrace because the constraints are too complex. This paper investigates the use of limited dependence sequential expansion to combine the benefits of sequential decompression with the benefits of incorporating the decompressor constraints in the ATPG backtrace. Analytical and experimental results are presented showing the benefits of the proposed approach
13
Janusz Rajski, Jerzy Tyszer, Mark Kassab et al. · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 2004 · 518 citations
Reducing test application time for full scan embedded cores
Ilker Hamzaoglu, J.H. Patel · 2003 · 335 citations
New Design, Engineering, Mem Testing +19
A SmartBIST variant with guaranteed encoding
B. Koenemann, C. Barnhart, Brion Keller et al. · 2002 · 268 citations
Specific Smartbist Implementation, Engineering, Computer Architecture +17
Using a single input to support multiple scan chains
Kuen-Jong Lee, Jih-Jeen Chen, Cheng-Hua Huang · 1998 · 195 citations