A graphical system for hierarchical specifications and checkups of VLSI circuits

ABSTRACT

The two most important frontend components of the VLSI design system CADIC are presented. The first one allows graphical specification of recursively defined circuits. The other one allows the designer to navigate across the synthesized layout following the hierarchical specification to check e.g. CADIC's hierarchical optimizations or to control the outcome of test (generation) algorithms.

REFERENCES

• 1: B. Becker. An easily testable optimal time VLSI-multiplier. ACTA INFORMATICA 24:363--380, 1987.
• 2: B. Becker , G. Hotz , R. Kolla , P. Molitor , H.-G. Osthof, Hierarchical design based on a calculus of nets, Proceedings of the 24th ACM/IEEE conference on Design automation, p.649-653, June 28-July 01, 1987, Miami Beach, Florida, United States [doi>10.1145/37888.37992]
• 3: L. Budach , E. G. Glessman , H. Grassmann , B. Graw , C. Meinel, RELACS—A recursive layout computing system, Proc. of an international workshop on Parallel algorithms and architectures, p.86-88, July 1987, Suhl, Germany
• 4: Th. Burch. Ein grafisches Eingabesystem für CADIC. Master's thesis, Universität des Saarlandes, 1988.
• 5: Edmund Clarke , Yulin Feng, Escher—a geometrical layout system for recursively defined circuits, Proceedings of the 23rd ACM/IEEE conference on Design automation, p.650-653, July 1986, Las Vegas, Nevada, United States
• 6: Th. Fettig, U. Sparmann, G. Wannemacher, and W. Weber. Entwurf von kombinatorischen Schaltkreisen für schnelle Gleitkommaarithmetik. Documentation of CADIC Designs 1989.
• 7: H. Fujiwara and S. Toida. The complexity of fault detection problems for combinational logic circuits. IEEE Transactions on Computers, C-31, 1982.
• 8: B. Grünewald, B. Grande, R. Kolla, and J. Schnabel. Entwurf eines Stringspeichers für COMSKEE. Documentation of CADIC Designs 1989.
• 9: R. Hahn, R. Krieger, U. Sparmann, and B. Becker. Strukturbasierte Selbsttests für arithmetische Schaltkreise. Documentation of CADIC Designs 1988.
• 10: E. Hörbst, M. Nett, and H. Schwärtsel. VENUS: Entwurf von VLSI-Schaltungen. Springer Verlag, 1986.
• 11: Günter Hotz , Reiner Kolla , Paul Molitor, On Network Algebras and Recursive Equations, Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science, p.250-261, December 02-06, 1986
• 12: Reiner Kolla, A dynamic programming approach to the power supply net sizing problem, Proceedings of the conference on European design automation, March 12-15, 1990, Glasgow, Scotland
• 13: R. Kolla. Spezifikation und Expansion logisch topologischer Netze. PhD thesis, Universität des Saarlandes, 1986.
• 14: R. Kolla , P. Molitor, A note on hierarchical layer-assignment, Integration, the VLSI Journal, v.7 n.3, p.213-230, Sep. 1989 [doi>10.1016/0167-9260(89)90002-3]
• 15: R. Kolla, P. Molitor, and H. G. Osthof. Einführung in den VLSI-Entwurf. B. G. Teubner Verlag, 1989.
• 16: W. K. Luk and J. Vuillemin. Recursive implementation of optimal time VLSI integer multipliers. In Proceedings IFIP Congress 83, pages 155--168, 1983.
• 17: P. Molitor. Constrained via minimization for systolic arrays. IEEE Transactions on CAD/ICAS. (Will appear in 1990.)
• 18: P. Molitor. Free net algebras in VLSI-theory. Fundamenta Informaticae, XI:117--142, 1988.
• 19: P. Molitor, On the contact-minimization problem, 4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87, p.420-431, February 1987, Passau, Germany
• 20: M. H. Schulz and E. Auth. Advanced automatic test pattern generation and redundancy identification techniques. In 18th Symposium on Fault-Tolerant Computing, pages 30--35, 1988.
• 21: M. H. Schulz, E. Trischler, and T. M. Sarfert. Socrates: a highly efficient automatic test pattern generation system. In Proceedings of 1987 International Test Conference, pages 1016--1026, 1987.
• 22: C. S. Wallace. A suggestion for a fast multiplier. IEEE, 13:14--17, 1964.