Connectivity of Random Logic
- 1 January 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (1) , 29-33
- https://doi.org/10.1109/tc.1982.1675882
Abstract
This paper develops a relation between the partitioning properties of computer logic and the distribution of connection lengths. The computation of length distributions is important for wirability analysis and delay estimation. The principal result is that an exponential partitioning function leads to an inverse power law length distribution.Keywords
This publication has 7 references indexed in Scilit:
- Wire Length Distribution for Placements of Computer LogicIBM Journal of Research and Development, 1981
- Two-dimensional stochastic model for interconnections in master slice integrated circuitsIEEE Transactions on Circuits and Systems, 1981
- Placement and average interconnection lengths of computer logicIEEE Transactions on Circuits and Systems, 1979
- Equivalence of Memory to “Random Logic”IBM Journal of Research and Development, 1974
- On a Pin Versus Block Relationship For Partitions of Logic GraphsIEEE Transactions on Computers, 1971
- A justification of, and an improvement on, a useful rule for predicting circuit-to-pin ratiosPublished by Association for Computing Machinery (ACM) ,1969
- Random Minimal TreesJournal of the Society for Industrial and Applied Mathematics, 1965