Optimization of Cost and Delay in Cellular Permutation Networks
Christian Ronse · SIAM Journal on Computing · 1982
Among all known cellular permutation networks built from 2-cells, the network of Waksman and Green on n bits, built with $n\lceil \log _2 (n) \rceil - 2^{\lceil \log _2 (n) \rceil } + 1$ binary cells, has the lowest cost and delay. We show here that among a new class of cellular permutation networks it also has the lowest cost and delay.