Loading [MathJax]/extensions/MathMenu.js
Universality considerations in VLSI circuits | IEEE Journals & Magazine | IEEE Xplore

Universality considerations in VLSI circuits

Publisher: IEEE

Abstract:

The problem of embedding the interconnection pattern of a circuit into a two-dimensional surface of minimal area is discussed. Since even for some natural patterns graphs...View more

Abstract:

The problem of embedding the interconnection pattern of a circuit into a two-dimensional surface of minimal area is discussed. Since even for some natural patterns graphs containing m connections may require Ω( m 2 ) area, in order to achieve compact embeddings restricted classes of graphs have to be considered. For example, arbitrary trees (of bounded degree) can be embedded in linear area without edges crossing over. Planar graphs can be embedded efficiently only if crossovers are allowed in the embedding.
Published in: IEEE Transactions on Computers ( Volume: C-30, Issue: 2, February 1981)
Page(s): 135 - 140
Date of Publication: 25 September 2012

ISSN Information:

Publisher: IEEE