Elsevier

Integration

Volume 2, Issue 3, September 1984, Pages 213-225
Integration

A recursive design methodology for VLSI: Theory and example

https://doi.org/10.1016/0167-9260(84)90042-7Get rights and content

Abstract

A novel VLSI (Very Large Scale Integration) methodology based on the hierarchical design of computational and system blocks is presented. The underlying algorithms used are shown to optimise the area-time complexity (AT2) of the computational units and at the system design level. The technique is illustrated for a matrix-matrix multiplication by using an image processing window convolver. This paper describes the performance of the recursive design technique comparing it to a typical systolic array, and demonstrates how data word size and convolution size may be expanded by movement up the architectural hierarchy. A prototype CAD (Computer Aided Design) autolayout program is described which maps directly into the hierarchical design environment. Using such design aids, flexible and correct designs may be generated which offer very simple data flow and highly local interconnection, with high performance.

References (13)

  • A. Reisman

    Device. circuit, and technology scaling to micron and submicron dimensions

  • M.J. Foster et al.

    Design of special purpose VLSI chips: Examples and opinions

    (1979)
  • R.P. Brent et al.

    Area-time complexity of binary multiplication

    (1979)
  • C.L. Seitz

    Ensemble architecture for VLSI—A survey and taxonomy

  • M.M. McCabe

    New algorithms and architectures for VLSI

    GEC J. Sci. & Tech

    (1982)
  • H.J. Siegel

    The theory underlying the partitioning of permutation networks

    IEEE Tran. Comput

    (1980)
There are more references available in the full text version of this article.

Cited by (3)

  • A practical IC design system for VLSI technology

    1988, Integration, the VLSI Journal
  • Second generation' silicon compilers

    1987, Microelectronics Journal
  • The Cut Theorem—A Tool for Design of Systolic Algorithms

    1988, International Journal of Computer Mathematics
View full text