EASILY CONTROLLED NETWORK FOR FREQUENTLY USED PERMUTATIONS.

Pen Chung Yew, Duncan H. Lawrie

Research output: Contribution to conferencePaper

Abstract

A pi network, which is a concatenation of 2 OMEGA networks, along with a simple control algorithm is proposed. This network is capable of performing all OMEGA network passable permutations and the Bit-Permute-Complement (PBC) class of permutations (which include all Lenfant's Frequently-Used-Bijections (FUB) in O(log n) time. The control algorithm can also be used as a multiple-pass control algorithm on the OMEGA network which is more general than Pease's LU decomposition method and Lenfant's decomposition method.

Original languageEnglish (US)
Pages72-73
Number of pages2
StatePublished - Jan 1 2017
EventProc of the Workshop on Interconnect Networks for Parallel and Distrib Process - Lafeyette, IN, USA
Duration: Apr 21 1980Apr 22 1980

Other

OtherProc of the Workshop on Interconnect Networks for Parallel and Distrib Process
CityLafeyette, IN, USA
Period4/21/804/22/80

Fingerprint Dive into the research topics of 'EASILY CONTROLLED NETWORK FOR FREQUENTLY USED PERMUTATIONS.'. Together they form a unique fingerprint.

  • Cite this

    Yew, P. C., & Lawrie, D. H. (2017). EASILY CONTROLLED NETWORK FOR FREQUENTLY USED PERMUTATIONS.. 72-73. Paper presented at Proc of the Workshop on Interconnect Networks for Parallel and Distrib Process, Lafeyette, IN, USA, .