Abstract
This paper proposes a class of rearrangeable networks, called generalized rearrangeable networks(GRNs). GRNs are obtained from the Benes network by rearranging the connections between states and the switches within each stage. The GRNs constitute all of the rearrangeable networks which have the recursive decomposition structure and can be routed by the outside-in decomposition of permutations as the Bene network. This paper also presents a necessary condition for a network to be a GRN and a network labeling scheme to check if a network satisfies the condition. the general routing algorithm for the GRNs is given by modifying slightly the looping algorithm of the Benes network.