Lower Bounds on Crosspoints in Concentrators
- 1 December 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (12) , 1173-1179
- https://doi.org/10.1109/tc.1982.1675941
Abstract
Lower bounds on the required number of crosspoints in concentrators, a class of interconnection networks, are given. The lower bounds are obtained from a straightforward necessary condition on the number of crosspoints in sparse crossbar full capacity concentrators. Because this condition must be satisfied by all full capacity concentrators embedded in more general concentrators, the general necessary condition is established. Several sparse crossbar designs that contain the minimum number of crosspoints are presented. An extension of the results to a more general class of interconnection networks is described.Keywords
This publication has 3 references indexed in Scilit:
- Binomial Switching Networks for Concentration and DistributionIEEE Transactions on Communications, 1977
- SuperconcentratorsSIAM Journal on Computing, 1977
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935