Regular CC-banyan networks
D. W. Kim, G. Jack Lipovski, Alfred Hartmann, Roy M. Jenevein · ACM SIGARCH Computer Architecture News · 1988
Construction algorithms for rectangular and nonrectangular CC-Banyan networks are presented. Routing algorithms for double and single-ended rectangular and non-rectangular CC-Banyan networks are also presented. The time complexities of the routing algorithms are O( l ), where l is the number of stages in the network.