Acta Informatica

, Volume 28, Issue 5, pp 463–476 | Cite as

The virtual feedback problem in hierarchical representations of combinational circuits

  • Reiner Kolla
  • Bernd Serf
Article

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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 1987Google Scholar
  2. 2.
    Daehn, W.: Hochgeschwindigkeitsfehlersimulation. Technical Report, Institut für theoretische Elektrotechnik, Universität HannoverGoogle Scholar
  3. 3.
    Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of computer computations. New York: Plenum Press 1972Google Scholar
  4. 4.
    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 1986Google Scholar
  5. 5.
    Lengauer, T., Wanke, E.: Efficient solution of connectivity problems on hierarchically defined graphs. SIAM J. Comput.6 (17) 1063–1080 (1988)Google Scholar
  6. 6.
    Serf, B.: Probleme bei der Simulation kombinatorischer Schaltkreise unter Ausnutzung von Hierarchie. Master's thesis, Universität des Saarlandes, Saarbrücken, 1988Google Scholar

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Reiner Kolla
    • 1
  • Bernd Serf
    • 1
  1. 1.Universität des SaarlandesSaarbrückenFederal Republic of Germany

Personalised recommendations