On Beneš Rearrangeable Networks
F. K. Hwang · Bell System Technical Journal · 1971
V. E. Beneš considered a class of multi-stage switching networks1and proved that if the linkage pattern between two stages is chosen in a specific way, then the resulting networks are rearrangeable. We offer a simpler proof by pointing out the relation between Beneš class networks and the Slepian-Duguid Theorem on three-stage Clos networks.