A New Class of Sequential Circuits with Acyclic Test Generation Complexity

This paper introduces a new class of sequential circuits called acyclically testable sequential circuits which is wider than the class of acyclic sequential circuits but whose test generation complexity is equivalent to that of the acyclic sequential circuits. We also present a test generation procedure for acyclically testable sequential circuits and elaborate a design-for-test (DFT) method to augment an arbitrary sequential circuit into an acyclically testable sequential circuit. Since the class of acyclically testable sequential circuits is larger than the class of acyclic sequential circuits, the DFT method results in lower area overhead than the partial scan method and still achieves complete fault efficiency. Besides, we show through experiment that the proposed method contributes to lower test application time compared to partial scan method. Moreover, the proposed method allows at-speed testing while the partial scan method does not.

[1]  Chia Yee Ooi,et al.  Classification of Sequential Circuits Based on tauk Notation and Its Applications , 2005, IEICE Trans. Inf. Syst..

[2]  Melvin A. Breuer,et al.  The BALLAST Methodology for Structured Partial Scan Design , 1990, IEEE Trans. Computers.

[3]  Hideo Fujiwara,et al.  An optimal time expansion model based on combinational ATPG for RT level circuits , 1998, Proceedings Seventh Asian Test Symposium (ATS'98) (Cat. No.98TB100259).

[4]  Chia Yee Ooi,et al.  Classification of Sequential Circuits Based on τ^k Notation and Its Applications(VLSI Systems) , 2005 .

[5]  Malgorzata Marek-Sadowska,et al.  Cost-free scan: a low-overhead scan path design methodology , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Kurt Keutzer,et al.  Why is ATPG easy? , 1999, DAC '99.

[7]  Hideo Fujiwara A New Class of Sequential Circuits with Combinational Test Generation Complexity , 2000, IEEE Trans. Computers.

[8]  Hideo Fujiwara,et al.  A DFT Method for RTL Data Paths Based on Partially Strong Testability to Guarantee Complete Fault Efficiency , 2005, 14th Asian Test Symposium (ATS'05).

[9]  Chia Yee Ooi,et al.  Classification of sequential circuits based on /spl tau//sup k/ notation , 2004, 13th Asian Test Symposium.

[10]  Prabhakar Goel Test generation costs analysis and projections , 1980, DAC '80.

[11]  Susanta Chakraborty,et al.  Max-testable class of sequential circuits having combinational test generation complexity , 2004, 13th Asian Test Symposium.