An Easily Controlled Network for Frequently Used Permutations

Pen Chung Yew; Duncan H. Lawrie

doi:10.1109/TC.1981.1675778

An Easily Controlled Network for Frequently Used Permutations

Pen Chung Yew, Duncan H. Lawrie

Computer Science and Engineering

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	296-298
Number of pages	3
Journal	IEEE Transactions on Computers
Volume	C-30
Issue number	4
DOIs	https://doi.org/10.1109/TC.1981.1675778
State	Published - Apr 1981

Keywords

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

Access

10.1109/TC.1981.1675778

OpenUrl availability

Full text

Cite this

@article{587ec9c23090424aa1a31fc4147e1251,

title = "An Easily Controlled Network for Frequently Used Permutations",

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].",

keywords = "Bit-permute-complement permutations, decomposition algorithms, multiple-pass control algorithm, network partitions, Ω network",

author = "Yew, {Pen Chung} and Lawrie, {Duncan H.}",

year = "1981",

month = apr,

doi = "10.1109/TC.1981.1675778",

language = "English (US)",

volume = "C-30",

pages = "296--298",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "4",

}

TY - JOUR

T1 - An Easily Controlled Network for Frequently Used Permutations

AU - Yew, Pen Chung

AU - Lawrie, Duncan H.

PY - 1981/4

Y1 - 1981/4

N2 - 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].

AB - 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].

KW - Bit-permute-complement permutations

KW - decomposition algorithms

KW - multiple-pass control algorithm

KW - network partitions

KW - Ω network

UR - http://www.scopus.com/inward/record.url?scp=0019555191&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019555191&partnerID=8YFLogxK

U2 - 10.1109/TC.1981.1675778

DO - 10.1109/TC.1981.1675778

M3 - Article

AN - SCOPUS:0019555191

SN - 0018-9340

VL - C-30

SP - 296

EP - 298

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 4

ER -

An Easily Controlled Network for Frequently Used Permutations

Abstract

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this