Notes on Shuffle/Exchange-Type Switching Networks

DOI10.1109/TC.1980.1675553zbMath0431.94050OpenAlexW2154307687MaRDI QIDQ3869266

D. Stott Parker

Publication date: 1980

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1980.1675553

zbMATH Keywords

fast Fourier transformshuffle-exchange networkomega networkindirect binary n-cubeinterconnection switches

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (13)

A unified theory of interconnection network structure ⋮ A new policy to solve routing conflicts in shuffle-exchange networks ⋮ Interpolation between bases and the shuffle exchange network ⋮ Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks ⋮ Universality of iterated networks ⋮ A lower bound for sorting networks based on the shuffle permutation ⋮ On the construction of balanced matrices ⋮ A layout for the shuffle-exchange network with theta(\(N^ 2\) /log N) area ⋮ Unnamed Item ⋮ Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram ⋮ A unified framework for off-line permutation routing in parallel networks ⋮ An asymptotically optimal layout for the shuffle-exchange graph ⋮ A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network

This page was built for publication: Notes on Shuffle/Exchange-Type Switching Networks