nD-dBPN: new self-routing permutation networks based on the de Bruijn digraphs
Azman Samsudin, K.Y. Lee · 2002
A new class of self-routing permutation networks based on the de Bruijn digraphs is proposed. The new networks are modular and scalable, and have an optimal crosspoint complexity. Compared to the crossbar switches of the same size, nD-dBPN uses less cross-points, and operates faster. With its optimal configuration, the new network uses O (N log N) cross-points compared to O (N/sup 2/) cross-points of the crossbar switches. The 2D-dBPN has the same crosspoint complexity as the 3-stage Clos network, but it has a constant control complexity compared to /spl Omega/(N/sup 3/2/) of the Clos network.