For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Formal Construction of Joel's Permutation Networks and Their Setting Algorithms
Shoji SAKURAZAWA Yoshihide IGARASHI
IEICE TRANSACTIONS (1976-1990)
Publication Date: 1981/04/25
Print ISSN: 0000-0000
Type of Manuscript: PAPER
Category: Automata and Languages
Full Text: PDF>>
Formal descriptions for constructing a Joel's permutation network are discussed. We show that a setting algorithm of the network can be described in terms of bipartite graphs. We then study a fast parallel algorithm for setting the network. We show that it can be implemented by a parallel computer with N processors in O((log2 N)2) time, where N is the size of permutations produced on the network.