Issue No. 04 - April (1981 vol. 30)
null Pen-Chung Yew , Department of Computer Science, University of Illinois
A p network, which is a concatenation of 2 O networks , along with a simple control algorithm is proposed. This network is capable of performing all O network realizable permutations and the bit-permute-complement (BPC) class of permutations in 0(log N) time. The control algorithm is actually a multiple-pass control algorithm on the O network, which is more general than Pease's LU decomposition method  and Lenfant's decomposition method.
O network, Bit-permute-complement permutations, decomposition algorithms, multiple-pass control algorithm, network partitions
null Pen-Chung Yew, D.H. Lawrie, "An Easily Controlled Network for Frequently Used Permutations", IEEE Transactions on Computers, vol. 30, no. , pp. 296-298, April 1981, doi:10.1109/TC.1981.1675778