Paradigms of connectivity for computer circuits and networks

Haldun M. Ozaktas

doi:10.1117/12.57685

1 July 1992 Paradigms of connectivity for computer circuits and networks

Haldun M. Ozaktas

Author Affiliations +

Optical Engineering, Vol. 31, Issue 7, (July 1992). https://doi.org/10.1117/12.57685

Abstract

We discuss several concepts of connectivity for circuit graphs, including Rent's rule, line length distributions, and separators, all of which we argue are fractal concepts. We provide generalizations for systems for which the Rent exponent is not constant throughout the interconnection hierarchy.

Citation Download Citation

Haldun M. Ozaktas "Paradigms of connectivity for computer circuits and networks," Optical Engineering 31(7), (1 July 1992). https://doi.org/10.1117/12.57685

Published: 1 July 1992

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE