Generation of permutations with nearest-neighbour interconnected switches

Josef Giglmayr, J. Guther · 2002

The generation of arbitrary permutations (/spl equiv/rearrangeable-nonblocking interconnections) by 2-D multistage architectures with nearest-neighbours interconnected switches is analysed. Two different networks are presented and their relationship is shown by means of a transformation.

Read the paper · More papers on PaperTik