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.
[1]
G. Masson.
Binomial Switching Networks for Concentration and Distribution
,
1977,
IEEE Trans. Commun..
[2]
P. Hall.
On Representatives of Subsets
,
1935
.
[3]
Z. Galil,et al.
Explicit constructions of linear size superconcentrators
,
1979,
20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[4]
M. Pinsker,et al.
On the complexity of a concentrator
,
1973
.
[5]
Zvi Galil,et al.
Explicit Constructions of Linear-Sized Superconcentrators
,
1981,
J. Comput. Syst. Sci..