Partitioning sequential circuits for pseudoexhaustive testing
| Autor: | D. Landis, S.A. Al-Arian, B. Shaer |
|---|---|
| Rok vydání: | 2000 |
| Předmět: |
Very-large-scale integration
Digital electronics Sequential logic business.industry Computer science Directed graph Integrated circuit Automatic test pattern generation Directed acyclic graph Multiplexer law.invention Hardware and Architecture law Algorithm design Observability Electrical and Electronic Engineering business Algorithm Software Electronic circuit |
| Zdroj: | IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 8:534-541 |
| ISSN: | 1557-9999 1063-8210 |
| DOI: | 10.1109/92.894159 |
| Popis: | In this paper, we present an algorithm for partitioning sequential circuits. This algorithm is based on an analysis of a circuit's primary input cones and fanout values (PIFAN), and it uses a directed acyclic graph to represent the circuit. An invasive approach is employed, which creates logical and physical partitions by automatically inserting reconfigurable test cells and multiplexers. The test cells are used to control and observe multiple partitioning points, while the multiplexers expand the controllability and observability provided by the test cells. The feasibility and efficiency of our algorithm are evaluated by partitioning numerous standard digital circuits, including some large benchmark circuits containing up to 5597 gates. Our algorithm is based upon pseudoexhaustive testing methods where fault simulation is not required for test-pattern generation and grading; hence, engineering design time and cost are further reduced. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|