This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Easily Controlled Network for Frequently Used Permutations
April 1981 (vol. 30 no. 4)
pp. 296-298
null Pen-Chung Yew, Department of Computer Science, University of Illinois
A p network, which is a concatenation of 2 O networks [2], 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[5] 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 [6] and Lenfant's decomposition method[4].
Index Terms:
O network, Bit-permute-complement permutations, decomposition algorithms, multiple-pass control algorithm, network partitions
Citation:
null Pen-Chung Yew, D.H. Lawrie, "An Easily Controlled Network for Frequently Used Permutations," IEEE Transactions on Computers, vol. 30, no. 4, pp. 296-298, April 1981, doi:10.1109/TC.1981.1675778
Usage of this product signifies your acceptance of the Terms of Use.