| A branching process model for observability analysis of combinational circuits |
| Full text |
Pdf
(602 KB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 28th ACM/IEEE Design Automation Conference
table of contents
San Francisco, California, United States
Pages: 452 - 457
Year of Publication: 1991
ISBN:0-89791-395-7
|
|
Authors
|
|
Sarma Sastry
|
Electrical Engineering Systems Department, University of Southern California, Los Angeles, CA
|
|
Amitava Majumdar
|
Electrical Engineering Systems Department, University of Southern California, Los Angeles, CA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 3, Citation Count: 1
|
|
|
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
|
P. Agrawal and V. D. Agrawal, Probabilistic Analysis of Random Test Generation Method for lrredundant Combinational Logic Networks, IEEE Trans. on Computers, Vol. C-24, July 1975, pp. 691-695.
|
| |
2
|
V. D. Agrawal, H. Farhat and S. Seth, Test Generation by Fault Sampling, Proc. ICCD '88, Oct. 1988, pp 58-61.
|
| |
3
|
F. Brglez and H. Fujiwara, A neutral netlist o.f ten combinational benchmark circuits and a target simulator in Fortran, Proc. IEEE Intl. Sym. on Circuits and Systems, June 1985, Kyoto, Japan.
|
 |
4
|
|
| |
5
|
W. Feller,An Introduction to Probability Theory and its Applicaions, Vol-I, John Wiley & Sons, New York, NY. 1968.
|
| |
6
|
N. L. Johnson and S. Kotz, Discrete Distributions, Houghton Mifflin Co., Boston, MA. 1969.
|
| |
7
|
|
| |
8
|
E. J. McCluskey, Built-In Self-Test Techniques, Design and Test of Computers, Vol. 2, No. 2, pp. 21-28, 1985.
|
| |
9
|
E. J. McCluskey, S. Makar, S. Mourad and K. D. Wagner, Probability Models .for Pseudorandom Test Sequences, IEEE Trans. on Computer Aided Design, Vol. 7, Jan. 1988, pp 68-74.
|
| |
10
|
J. Savir, G. S. Ditlow and P. H. Bardell, Random Pattern Testability, IEEE Trans. on Computers, Vol. C-33, Jan. 1984, pp. 79-90.
|
| |
11
|
S. C. Seth, L. Pan and V. D. Agrawal, PREDICT: Probabilistic Estimation of Digital Circuit Testability, Proc. FTCS-15, 1985, pp. 220-225.
|
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
|