An Easily Controlled Network for Frequently Used Permutations | IEEE Journals & Magazine | IEEE Xplore

An Easily Controlled Network for Frequently Used Permutations


Abstract:

A π network, which is a concatenation of 2 Ω networks [2], along with a simple control algorithm is proposed. This network is capable of performing all Ω network realizab...Show More

Abstract:

A π network, which is a concatenation of 2 Ω networks [2], along with a simple control algorithm is proposed. This network is capable of performing all Ω 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 Ω network, which is more general than Pease's LU decomposition method [6] and Lenfant's decomposition method[4].
Published in: IEEE Transactions on Computers ( Volume: C-30, Issue: 4, April 1981)
Page(s): 296 - 298
Date of Publication: 30 April 1981

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.