ACM Home Page
Please provide us with feedback. Feedback
Optimal test access architectures for system-on-a-chip
Full text PdfPdf (198 KB)
Source ACM Transactions on Design Automation of Electronic Systems (TODAES) archive
Volume 6 ,  Issue 1  (January 2001) table of contents
Pages: 26 - 49  
Year of Publication: 2001
ISSN:1084-4309
Author
Krishnendu Chakrabarty  Duke Univ., Durham, NC
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 34,   Citation Count: 21
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/371254.371258
What is a DOI?

ABSTRACT

Test access is a major problem for core-based system-on-a-chip (SOC) designs. Since embedded cores in an SOC are not directly accessible via chip inputs and outputs, special access mechanisms are required to test them at the system level. An efficient test access architecture should also reduce test cost by minimizing test application time. We address several issues related to the design of optimal test access architectures that minimize testing time., including the assignment of cores to test buses, distribution of test data width between multiple test buses, and analysis of test data width required to satisfy an upper bound on the testing time. Even though the decision versions of all these problems are shown to be NP-complete, they can be solved exactly for practical instances using integer linear programming (ILP). As a case study, the ILP models for two hypothetical but nontrivial systems are solved using a public-domain ILP software package.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
BERKELAAR, M. 1999. lpsolve, version 2.0. Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, Netherlands. E-mail: michel@es.ele.tue.nl
 
3
BRGLEZ, F., BRYANT, D., AND KOZMINSKI, K. 1989. Combinational profiles of sequential benchmark circuits. In Proceedings of the IEEE International Symposium on Circuits and Systems (Portland, OR, May). IEEE Press, Piscataway, NJ, 1929-1934. ACM Transactions on Design Automation of Electronic Systems, Vol. 6, No. 1, January 2001.
 
4
BRGLEZ,F.AND FUJIWARA, H. 1985. A neural netlist of 10 combinational benchmark circuits and a target translator in Fortran. In Proceedings of IEEE International Symposium on Circuits and Systems. IEEE Computer Society, Washington, DC, 695-698.
 
5
CHAKRABARTY, K. 2000a. Test scheduling for core-based systems using mixed-integer linear programming. IEEE Trans. Comput.-Aided Des. 19, 10 (Oct.), 1163-1174.
6
 
7
 
8
FOURER, R., GAY,D.M.,AND KERNIGHAN, B. W. 1993. AMPL: A Modeling Language for Mathematical Programming. Duxbury Press, Boston, MA.
 
9
GAMS DEVELOPMENT CORPORATION. 1993. GAMS: A User's Guide. Boyd and Fraser Publishing Co., Danvers, MA.
 
10
11
 
12
13
 
14
IMMANENI,V.AND RAMAN, S. 1990. Direct access test scheme: Design of block and core cells for embedded ASICs. In Proceedings of the International Test Conference. IEEE Computer Society Press, Los Alamitos, CA, 488-492.
 
15
 
16
 
17
 
18
 
19
WILLIAMS, H. P. 1985. Model Building in Mathematical Programming. 2nd ed. John Wiley, New York, NY.
 
20
 
21
 
22

CITED BY  21

Collaborative Colleagues:
Krishnendu Chakrabarty: colleagues