An Easily Controlled Network for Frequently Used Permutations

Pen Chung Yew, Duncan H. Lawrie

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

Abstract

A x 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 O(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].

Original languageEnglish (US)
Pages (from-to)296-298
Number of pages3
JournalIEEE Transactions on Computers
VolumeC-30
Issue number4
DOIs
StatePublished - Apr 1981

Keywords

  • Bit-permute-complement permutations
  • decomposition algorithms
  • multiple-pass control algorithm
  • network partitions
  • Ω network

Fingerprint Dive into the research topics of 'An Easily Controlled Network for Frequently Used Permutations'. Together they form a unique fingerprint.

Cite this