Recursive Implementation of VLSI Circuits

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 …

FullText(HTML)

[1]	M.Fischer and R.Ladner, Parallel prefix computation, Journal of the ,ACM, 27:4 (1980).
[2]	S.M.German, K.J.Lieberherr, Zeus:a language for expressing algorithms in hardware, Computers, 1985.
[3]	J.Ousterhout, Caesar: An interactive layout editor for VLSI design, VLSI Design Fourth Quarter 1981, 34-38.
[4]	L.Johnson, U.Weiser, et al Towards a formal treatment of VLSI arrays, Caltech Conference on VLSI, January,1981, 375-398.
[5]	S.E.Fahlman and S.P.Harbison, The SPICE project, in Interactive Programming Environments, ed.D.R.Barstow,et al, McGraw-Hill, 1984.
[6]	R.J.Lipton, S.C.North, R.Sedgewick; et al, ALI: a procedural language to describe VLSI layouts, 19th Design Automation Conference, IEEE, 1982, 467-474.
[7]	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.
[8]	C.A.Mead, L.A.Conway, Introduction to VLSI systems, Addison-Wesley, 1980.
[9]	Mary Sheeran, muFP-An algebraic VLSI design language. PRG-39, Oxford University Computing Lab., November, 1984.
[10]	P.Henderson, Functional geometry. Symposium on LISP and Functional Programming, ACM, 1982, 179一187.
[11]	C.D.Thompson, Fourier transforms in VLSI, IEEE Transrzctiorz orz Computers, C-32:11 (1983), 1047-1057.

Get Citation

PDF

XML

Article views (18) PDF downloads (1342)

Export File