Cited By
View all- Hao Li Katkoori SZhipeng Liu (2005)Feedback Driven High Level Synthesis for Performance Optimization2005 6th International Conference on ASIC10.1109/ICASIC.2005.1611468(882-885)Online publication date: 2005
Facet: A procedure for the automated synthesis of digital systems
Pages 566 - 572
References
[1]
A.V. Aho and J.D. Ullman, "Principles of Compiler Design," Addison-Wesley, Reading, MA, 1977.
[2]
J. G. Augustson and J. Minker, "An Analysis of Some Graph Theoretical Cluster Techniques," Journal of the ACM 17(4):571.588, October 1970.
[3]
M. R. Barbacci, G. E. Barnes, R. G. Cattell, and D. P. Siewiorek, "The Symbolic Manipulation of Computer Descriptions: The ISPS Computer Description Language," Technical Report, Department of Computer Science, Carnegie-Mellon University, March 1978.
[4]
C. Bron and J. Kerbosch, "Finding All Cliques of an Undirected Graph -- Algorithm 457", Communications of the ACM 16(9):575-577, September 1973.
[5]
S. Davidson, D. Landskov, B. D. Shriver, and P. W. Mallett, "Some Experiments in Local Microcode Compaction for Horizontal Machines," IEEE Transactions on Computers, C-30(7), July 1981.
[6]
S. W. Director, A, C, Parker, D.P. Siewiorek, and D. E. Thomas, "A Design Methodology and Computer Aids for Digital VLSI Systems," IEEE Transactions on Circuits and Systems, CAS.28(7), July 1981.
[7]
M. McFarland, "The Value Trace: A Data Base for Automated Digital Design," Master Thesis, Department of Electrical Engineering, Carnegie-Mellon University, December 1978.
[8]
J. W. Moon and L. Moser, "On Cliques in Graphs," Israel Journal of Mathematics (3):23-28, March 1965.
[9]
G. D. MulLigan and D.G. Corneil, "Corrections to Bierstone's Algorithm for Generating Cliques," Journal of the ACM 19(2):244-247, April 1972.
[10]
M. C. Paull and S. H. Unger, "Minimizing the Number of States in Incompletely Specified Sequential Switching Function3," IRE Transactions on Electronic Computers (EC-8):356-367, September 1959.-
[11]
E.M. Reingotd, J. Nievergelt, and N. Deo, "Combinatorial Algorithms: Theory and Practice," Prentice.Hall, 1977.
[12]
E. A. Snow, "Automation of Module Set Independent Register- Transfer Design," Ph.D. Thesis, Department of Electrical Engineering, Carnegie-Mellon University, April 1978.
[13]
C. J. Tseng and D. P. Siewiorek, "The Modeling and Synthesis of Bus Systems," Proceedings of the Eighteenth Design Automation Conf_=rence, pages 471-478, ACM SIGDA and IEEE Computer Society DATC, June 1981.
[14]
C.J. Tseng and D.P. Siewiorek, "A Note on the Automated Synthes=s of Bus Style Systems," Technical Report, Department of Electrical Engineering, October t982.
[15]
S. Tsukiyama, M. lde, H. Ariyoshi, and I. Shirakawa, "A New Algorithm for Generating All the Maximal Independent Sets," SIAM Journal of Computing 6(3):505-517, September 1977.
Index Terms
- Facet: A procedure for the automated synthesis of digital systems
Recommendations
Automated Synthesis of Digital systems
This tutorial describes the automatic synthesis of digital implementations from higher-level specifications. The synthesis process is described in terms of four mechanisms: resource allocation, design transformation, composition, and scheduling. These ...
Automated Synthesis of Data Paths in Digital Systems
This paper presents a unifying procedure, called Facet, for the automated synthesis of data paths at the register-transfer level. The procedure minimizes the number of storage elements, data operators, and interconnection units. A design generator named ...
A procedure of facet composition for the symmetric traveling salesman polytope
Combinatorial optimization - Eureka, you shrink!We propose a new procedure of facet composition for the Symmetric Traveling Salesman Polytope(STSP). Applying this procedure to the well-known comb inequalities, we obtain completely or partially known classes of inequalities like clique-tree, star, ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1988 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 June 1988
Check for updates
Qualifiers
- Article
Conference
DAC88
Sponsor:
Upcoming Conference
DAC '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 216Total Downloads
- Downloads (Last 12 months)27
- Downloads (Last 6 weeks)5
Reflects downloads up to 18 Nov 2024
Other Metrics
Citations
Cited By
View all- Hao Li Katkoori SZhipeng Liu (2005)Feedback Driven High Level Synthesis for Performance Optimization2005 6th International Conference on ASIC10.1109/ICASIC.2005.1611468(882-885)Online publication date: 2005
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in