| Hierarchical test generation and design for testability of ASPPs and ASIPs |
| Full text |
Pdf
(145 KB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 34th annual Design Automation Conference
table of contents
Anaheim, California, United States
Pages: 534 - 539
Year of Publication: 1997
ISBN:0-89791-920-3
|
|
Authors
|
|
Indradeep Ghosh
|
Department of Electrical Engineering, Princeton University, Princeton, NJ
|
|
Anand Raghunathan
|
Department of Electrical Engineering, Princeton University, Princeton, NJ
|
|
Niraj K. Jha
|
Department of Electrical Engineering, Princeton University, Princeton, NJ
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 9, Citation Count: 2
|
|
|
ABSTRACT
In this paper, we present design for testability (DFT) and hierarchicaltest generation techniques for facilitating the testingof application-specific programmable processors (ASPPs) andapplication-specific instruction processors (ASIPs). The methodutilizes the register transfer level (RTL) circuit description of anASPP or ASIP and tries to generate a set of test microcode patternswhich can be written into the instruction read-only memory(ROM) of the processor. These lines of microcode dictate a newcontrol/data flow in the circuit and can be used to test moduleswhich are not easily testable. The new control/data flow is used tojustify precomputed test sets of a module from the system primaryinputs to the module inputs and propagate output responses fromthe module output to the system primary outputs. If the derived testmicrocode cannot test all untested modules in the circuit, then testmultiplexers are added to the data path to test these modules andthus testability of all modules is guaranteed. This scheme has theadvantages of low area and delay overheads (average of 3.1% and0.4% respectively), high fault coverage (>99.6% for all cases) andat-speed testing. Test generation times are about three orders ofmagnitude smaller than an efficient gate-level sequential test generator.Only one external test pin is required for the DFT method.
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
|
I.J. Huang and A. Despain,"Synthesis of application specific instruction sets," IEEE Trans. Computer-Aided Design, vol. 14, pp. 663- 675, June 1995.
|
 |
3
|
|
| |
4
|
B.T. Murray and J.E Hayes, "Hierarchical test generation using precomputed tests for modules," IEEE Trans. Computer-Aided Design, vol. 9, pp. 594-603, June 1990.
|
| |
5
|
|
| |
6
|
S. Bhatia and N.K. Jha, "Genesis: A behavioral synthesis system for hierarchical testability," in Proc. European Design and Test Conf., pp. 272-276, Feb. 1994.
|
| |
7
|
Indradeep Ghosh , Anand Raghunathan , Niraj K. Jha, A design for testability technique for RTL circuits using control/data flow extraction, Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, p.329-336, November 10-14, 1996, San Jose, California, United States
|
| |
8
|
|
| |
9
|
I. Pomeranz, L.N. Reddy, and S.M. Reddy, "COMPACTEST: A method to generate compact test set for combinational circuits," IEEE Trans. Computer-Aided Design, pp. 1040-1049, July 1993.
|
| |
10
|
|
| |
11
|
I. Ghosh, A. Raghunathan, and N.K. Jha, "Hierarchical test generation and design for testability for ASPPs and ASIPs," Technical Report CE-J96-O01, EE Dept., Princeton University, Oct, 1996.
|
 |
12
|
|
| |
13
|
Ellen Sentovich , Kanwar Jit Singh , Cho W. Moon , Hamid Savoj , Robert K. Brayton , Alberto L. Sangiovanni-Vincentelli, Sequential Circuit Design Using Synthesis and Optimization, Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors, p.328-333, October 11-14, 1992
|
| |
14
|
A. Greiner and E Pecheux, "ALLIANCE: A complete set of CAD tools for teaching VLSI design," Technical Report: Laboratoire MASI/CAO-VLSI, Institut de Programmation, Universite Pierre et Marie Curie, Paris, 1993.
|
| |
15
|
|
 |
16
|
Thomas M. Niermann , Wu-Tung Cheng , Janak H. Patel, Proofs: a fast, memory efficient sequential circuit fault simulator, Proceedings of the 27th ACM/IEEE conference on Design automation, p.535-540, June 24-27, 1990, Orlando, Florida, United States
[doi> 10.1145/123186.123396]
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|