A fast state assignment procedure for large FSMs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A fast state assignment procedure for large FSMs

Full text

Pdf (68 KB)

Source

Annual ACM IEEE Design Automation Conference archive
Proceedings of the 32nd annual ACM/IEEE Design Automation Conference table of contents

San Francisco, California, United States

Pages: 327 - 332

Year of Publication: 1995

ISBN:0-89791-725-1

Authors

Shihming Liu	Department of Electrical Engineering - Systems, University of Southern California, Los Angeles, CA
Massoud Pedram	Department of Electrical Engineering - Systems, University of Southern California, Los Angeles, CA
Alvin M. Despain	Department of Electrical Engineering - Systems, University of Southern California, Los Angeles, CA

Sponsors

EDAC : Electronic Design Automation Consortium
SIGDA: ACM Special Interest Group on Design Automation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 9, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

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

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/217474.217550 What is a DOI?

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	D. B. Armstrong, "A programmed algorithm tbr assigning internal codes to sequential machines," IRE Trans. Elect. Comp., vol. EC-11, pp. 466-472, 1962.
	2	J. E. Brandenburg and D. S. Scott, "Embeddings of communication trees and grids into hypercubes, Intel Scientific Computers Report #280182-001, 1985.
	3	Robert King Brayton , Alberto L. Sangiovanni-Vincentelli , Curtis T. McMullen , Gary D. Hachtel, Logic Minimization Algorithms for VLSI Synthesis, Kluwer Academic Publishers, Norwell, MA, 1984
	4	M. Y. Chan, "Dilation-2 embeddings of grids into hypercubes," Proceedings of the 1988 International conference on Parallel Processing, pp. 295-298, 1988.
	5	George Cybenko , David W. Krumme , K. N. Venkataraman, Fixed Hypercube embedding, Information Processing Letters, v.25 n.1, p.35-39, 20 April 1987 [doi>10.1016/0020-0190(87)90090-1]
	6	G. De Micheli, R. K. Brayton and A. L. Sangiovanni Vincentelli, "Optimal state assignment for finite state machines," IEEE Trans. on CAD, pp.269-284, 1986.
	7	S. Devadas, H. T. Ma, A. R. Newton and A. L. Sangiovanni Vincentelli, "MUSTANG: state assignment of finite state machines for multi-level logic implementations," IEEE Trans. on CAD, pp. 1290-1300, 1988.
	8	S. Devadas, H. T. Ma, A. R. Newton and A. L. Sangiovanni Vincentelli, "A synthesis and optimization procedure for fully and easily testable sequential machines," IEEE Trans. on CAD, pp. 1100-1107, 1989.
	9	S. Devadas, A. R. Wang, A. R. Newton and A. L. Sangiovanni Vincentelli, "Boolean decomposition in multilevel logic optimization," IEEE Journal of Solid-State Circuits, vol. 24, pp. 399-407, 1989.
	10	D. Z. Djokovic, "Distance-preserving subgraphs of hypercubes," J. Combinatorial Theory (B), pp.263-267, 1973.
	11	T. A. Dolotta and E. G. McCluskey, "The coding of internal states of sequential machines," IEEE Trans. Elect. Comput., vol. EC-13, pp.549-562, 1964.
	12	C. Duff and G. Saucier, "State assignment based on the reduced dependency theory and recent experimental results," ICCAD-91, pp. 222-225, 1991.
	13	K. M. Hall, "An r-Dimensional Quadratic Placement Algorithm," Management Science, vol. 17, pp.219-229, 1970.
	14	J. M. Kleinhans, G. Sigl and E M. Johannes, "GORDIAN: A new global optimization/rectangle dissection method for cell placement," ICCAD-88, pp. 506-509, 1988.
	15	D. W. Krumme, N. Venkataraman and G. Cybenko, "Hypercube embedding is NP-complete," Proc. Hypercube Conf., SIAM, 1985.
	16	D. Lewin, Computer-aided design of digital systems, Crane/ Russak, 1977.
	17	Kaushik Roy , Sharat Prasad, SYCLOP: Synthesis of CMOS Logic for Low Power Applications, Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors, p.464-467, October 11-14, 1992
	18	Y. Saad and M. H. Schultz, "Topological properties of hypercubes," Res. Report 389, Department of Computer Science, Yale univ., 1985
	19	Georg Sigl , Konrad Doll , Frank M. Johannes, Analytical placement: A linear or a quadratic objective function?, Proceedings of the 28th conference on ACM/IEEE design automation, p.427-432, June 17-22, 1991, San Francisco, California, United States [doi>10.1145/127601.127707]
	20	R. E. Stearns and J. Hartmanis, "On the state assignment problem for sequential machines II," IRE Trans. Elect. Cornput., vol. EC-10, pp.593-603, 1961.
	21	Ren-Song Tsay , Ernest S. Kuh , Chi-Ping Hsu, PROUD: A Sea-Of-Gates Placement Algorithm, IEEE Design & Test, v.5 n.6, p.44-56, November 1988 [doi>10.1109/54.9271]
	22	T. Villa and A. L. Sangiovanni-Vincentelli, "NOVA: State Assignment of Finite State Machines for Optimal Two-Level Logic Implementations," IEEE Trans. on CAD, pp. 905-924, 1990.
	23	S. Yang, "Logic synthesis and optimization benchmarks user guide," Version 3.0, MCNC, 1991.