Abstract
This is an introduction for Escher—the geometrical layout system. An Escher circuit description is a hierarchical structure composed of cells, wires, connectors between wires, and pins that connect wires to cells. Cells may correspond to primitive circuit elements, or they may be defined in terms of lower level subcells. Unlike other geometrical layout systems, a subcell may be instance of the cell being defined. When such a recursive cell definition is instantiated, the recursion is unwound in a manner reminiscent of the procedure call copy rule in Algol-like programming languages. Cell specifications may have parameters that are used to control the unwinding of recursive cells and to provide for cell families with varying numbers of pins and other internal components. With examples we illustrate how the Escher system might be used. We also briefly describe some basic rules for moving circuit components around in obtaining a layout.
Similar content being viewed by others
References
M. Fischer and R. Ladner, Parallel prefix computation,Journal of the ACM,27:4 (1980).
S. M. German, K. J. Lieberherr, Zeus: a language for expressing algorithms in hardware,Computers, 1985.
J. Ousterhout, Caesar: An interactive layout editor for VLSI design, VLSI Design Fourth Quarter 1981, 34–38.
L. Johnson, U. Weiser,et al., Towards a formal treatment of VLSI arrays, Caltech Conference on VLSI, January, 1981, 375–398.
S. E. Fahlman and S. P. Harbison, The SPICE project, in Interactive Programming Environments, ed. D. R. Barstow,et al., McGraw-Hill, 1984.
R. J. Lipton, S. C. North, R. Sedgewicket al., ALI: a procedural language to describe VLSI layouts, 19th Design Automation Conference,IEEE, 1982, 467–474.
W. K. Luk, J. E. Vuillemin, Recursive implementation of optimal time VLSI integer multipliers, VLSI Design of Digital Systems, ed. F. Anceau & E. J. Aas, 1983, 155–168.
C. A. Mead, L. A. Conway, Introduction to VLSI systems, Addison-Wesley, 1980.
Mary Sheeran, muFP-An algebraic VLSI design language. PRG-39, Oxford University Computing Lab., November, 1984.
P. Henderson, Functional geometry. Symposium on LISP and Functional Programming,ACM, 1982, 179–187.
C. D. Thompson, Fourier transforms in VLSI,IEEE Transaction on Computers, C-32:11 (1983), 1047–1057.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Feng, Y. Recursive implementation of VLSI circuits. J. of Compt. Sci. & Technol. 1, 72–82 (1986). https://doi.org/10.1007/BF02943274
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02943274