Abstract
Register-Transfer (RT-) level netlists are said to be isomorphic if they can be made identical by relabeling RT-components. RT-netlists can be generated by architectural synthesis. In order to consider just the essential design decisions, architectural synthesis should consider only a single representative of sets of isomorphic netlists. In this paper, we are using netlist isomorphism for the very first time in architectural synthesis. Furthermore, we describe how an integer-programming (IP-) based synthesis technique can be extended to take advantage of netlist isomorphism.
Chapter PDF
References
Arnstein, L. F. and Thomas, D. (1994) The Attributed Behavior Abstraction and Synthesis Tools, 31th Design Automation Conference, 557–561
Berkelaar, M.R.C.M. (1992) UNIX TM Manual Page of LP_SOLVE, Eindhoven University of Technology, Design Automation Section
Devadas, S. and Newton, R. A. (1989) Algorithms for Allocation in Data-Path Synthesis, IEEE Trans. on CAD, vol. 8, 768–781
Gajski, D. D. and Kuhn, R. H. (1983) New VLSI Tools, IEEE Computer, 11–1.4
Gebotys, C. H. and Elmasry, M. I. (1991) Simultaneous Scheduling and Allocation for Cost Constrained Optimal Architectural Synthesis, 28th Design Automation Conference, 2–7
Hafer L. and Parker A. C. (1983) A Formal Method for the Specification, Analysis and Design of Register-Transfer Level Digital Logic, IEEE Trans. on Computer-Aided Design, Vol. 2, 4–18
Jerraya, A. A. and Park, I. and O’Brien, K. (1993) AMICAL: an Interactive High Level Synthesis Environment, Proceedings EDAC, 58–62
Kohavi, Z. (1987) Switching and Finite Automata Theory, Tata McGraw-Hill Publishing Company, New Delhi, 9th reprint
Landwehr, B. and Marwedel, P. and Dömer, R. (1994), OSCAR: Optimum Simultaneous Scheduling, Allocation and Resource Binding Based on Integer Programming, Euro-DAC’94
Marwedel, P. and Schenk, W. (1989) Improving the Performance of High-Level Synthesis, Microprogramming and Microprocessing, Vol.27, 381–388
Marwedel, P and Bashford S. and Dömer R. and Landwehr B. and Markhof I. (1995) A Technique for Avoiding Isomorphic Netlists in Architectural Synthesis, Report 95–28, Dept. of Information and Computer Science, University of California at Irvine
Marwedel, P. Landwehr, B. and Dömer, R. (1996) Built-in chaining: Introducing Complex Components into Architectural Synthesis, Report 611, Computer Science Dpt., University of Dortmund
McFarland, M. C. (1987) Reevaluating the Design Space for Register Transfer Level Synthesis, IEEE Int. Conf.on Computer-Aided Design(ICCAD), 262–265
Ohm, S. Y. and Kurdahi, F. J. and Dutt, N. and Xu, M. (1995) A Comprehensive Estimation Technique for High-Level Synthesis Int. Symp. on System Synthesis (ISSS)
Stok, L. (1990) A Generalized Interconnect Model For Data Path Synthesis, Proc. CompEuro 90, Tel Aviv, 461–465
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Landwehr, B., Marwedel, P., Markhof, I., Dömer, R. (1997). Exploiting Isomorphism for Speeding-Up Instance-Binding in an Integrated Scheduling, Allocation and Assignment Approach to Architectural Synthesis. In: Kloos, C.D., Cerny, E. (eds) Hardware Description Languages and their Applications. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35064-6_19
Download citation
DOI: https://doi.org/10.1007/978-0-387-35064-6_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5387-5
Online ISBN: 978-0-387-35064-6
eBook Packages: Springer Book Archive