On the construction of balanced matrices

Abstract

This paper generalizes the construction mechanism of balanced matrices. This construction principle is then used to provide a parallel routing algorithm for Shuffle-Exchange networks and to find an improved upper bound on the number of stages for the rearrangeability of Shuffle-Exchange networks.

Keywords:

• Routing algorithm
• Shuffle-exchange network
• balanced matrix

C.R.Categories:

• C.1.2
• F.2.2