Abstract
Orders of magnitude of space and time can be saved if hierarchical algorithms are used for automatic synthesis and analysis of regular VLSI circuits. When we tried to apply this technique to compiled simulation of large regular combinational circuits, we observed that hierarchical representations of acyclic circuits often contain cycles. In this paper we study the question of whether this undesired property is necessary or not. We prove, that there are combinational circuits, which have a succinct cyclic hierarchical representation, but where each acyclic hierarchical representation is large. This negative result may be weakened, if we allow the circuits structure to be changed but not its behavior. We also discuss the effect of these observations on hierarchical simulation techniques and the complexity of pragmatic approaches such as the construction of a smallest acyclic refinement of a hierarchical representation.
Similar content being viewed by others
References
Becker, B., Hotz, G., Kolla, R. Molitor, P., Osthof, H.G.: Hierarchical design based on a calculus of nets. In: Proceedings of the 24th Design Automation Conference (DAC87), 649–653, June 1987
Daehn, W.: Hochgeschwindigkeitsfehlersimulation. Technical Report, Institut für theoretische Elektrotechnik, Universität Hannover
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of computer computations. New York: Plenum Press 1972
Lengauer, T.: Exploiting hierarchy in VLSI design. In: Makedon, F. et al. (eds.) Proceedings of AWOC 86. (Lect. Notes Comput. Sci., vol. 227, pp. 180–193) Berlin Heidelberg New York: Springer 1986
Lengauer, T., Wanke, E.: Efficient solution of connectivity problems on hierarchically defined graphs. SIAM J. Comput.6 (17) 1063–1080 (1988)
Serf, B.: Probleme bei der Simulation kombinatorischer Schaltkreise unter Ausnutzung von Hierarchie. Master's thesis, Universität des Saarlandes, Saarbrücken, 1988
Author information
Authors and Affiliations
Additional information
This work was supported by Deutsche Forschungsgemeinschaft under contract SFB 124 B1
Rights and permissions
About this article
Cite this article
Kolla, R., Serf, B. The virtual feedback problem in hierarchical representations of combinational circuits. Acta Informatica 28, 463–476 (1991). https://doi.org/10.1007/BF01178584
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01178584