Cellular automata based synthesis of easily and fully testable FSMs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Cellular automata based synthesis of easily and fully testable FSMs

Full text

Pdf (380 KB)

Source

International Conference on Computer Aided Design archive
Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design table of contents

Santa Clara, California, United States

Pages: 650 - 653

Year of Publication: 1993

ISBN:0-8186-4490-7

Authors

D. Roy Chowdhury	Dept. of Computer Science & Engg., Indian Institute of Technology, Kharagpur - 721 302, India
S. Chakraborty	Dept. of Computer Science & Engg., Indian Institute of Technology, Kharagpur - 721 302, India
B. Vamsi	Dept. of Computer Science & Engg., Indian Institute of Technology, Kharagpur - 721 302, India
B. Pal Chaudhuri	Dept. of Computer Science & Engg., Indian Institute of Technology, Kharagpur - 721 302, India

Sponsors

IEEE-CS : Computer Society
SIGDA: ACM Special Interest Group on Design Automation

Publisher

IEEE Computer Society Press Los Alamitos, CA, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 7, Citation Count: 2

Additional Information:

references cited by collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

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	A. K. Das , P. P. Chaudhuri, Vector Space Theoretic Analysis of Additive Cellular Automata and its Application for Pseudoexhaustive Test Pattern Generation, IEEE Transactions on Computers, v.42 n.3, p.340-352, March 1993 [doi>10.1109/12.210176]
	2	S. Devadas, H.K.T. Ma, A.R. Newton, and A.S. Vincentelli. Mustang: State assignment of finite state machines targeting multi-level logic implementations. IEEE Trans. on CAD, CAD-7:1290-- 1300, December 1988.
	3	S. Devadas, H.K.T. Ma, A.R. Newton, and A.S. Vincentelli. Synthesis and optimization procedures for fully and easily testable sequential machines. In Proc. Intl. Test Conference, pages 621-630, 1988.
	4	B. Eshermann and H.J. Wunderlich. Optimised synthesis of self-testable finite machines. In Proc. FTCS-20, pages 390-397, June 1990.
	5	Hideo Fujiwara, Logic testing and design for testability, Massachusetts Institute of Technology, Cambridge, MA, 1985
	6	H.K.T Ma and S. Devadas et. al. An incomplete scan design approach to test generation for sequential machines. In Proc. Intl. Test Conference, 1988.
	7	S. Misra, B. Mitra, and P. Pal Chaudhuri. Synthesis of self-testable sequential logic using programmable cellular automata. In Proc. of VLSI'92, INDIA, pages 193-198, January 1992.

CITED BY 2

	Prabir Dasgupta , Santanu Chattopadhyay , P. Pal Chaudhuri , Indranil Sengupta, Cellular Automata-Based Recursive Pseudoexhaustive Test Pattern Generator, IEEE Transactions on Computers, v.50 n.2, p.177-185, February 2001
	Supratik Chakraborty , Dipanwita Roy Chowdhury , Parimal Pal Chaudhuri, Theory and Application of Nongroup Cellular Automata for Synthesis of Easily Testable Finite State Machines, IEEE Transactions on Computers, v.45 n.7, p.769-781, July 1996

Collaborative Colleagues:

D. Roy Chowdhury: colleagues

S. Chakraborty: colleagues

B. Vamsi: colleagues

B. Pal Chaudhuri: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player