### 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 language | English (US) |
---|---|

Pages | 72-73 |

Number of pages | 2 |

State | Published - Jan 1 2017 |

Event | Proc of the Workshop on Interconnect Networks for Parallel and Distrib Process - Lafeyette, IN, USA Duration: Apr 21 1980 → Apr 22 1980 |

### Other

Other | Proc of the Workshop on Interconnect Networks for Parallel and Distrib Process |
---|---|

City | Lafeyette, IN, USA |

Period | 4/21/80 → 4/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, .