Regular article
A one-copy algorithm for 2-D shuffles for optical omega networks

https://doi.org/10.1016/0743-7315(92)90043-MGet rights and content

Abstract

We present a new procedure called the one-copy algorithm which implements various types of shuffles on a 2-D array of signal channels. Both 2-D folded and separable shuffles are considered. Perfect shuffles and r-shuffles on a 2-D array having rm channels, where r is prime and m is even, are studied. We discuss potential applications of this algorithm to 2-D rk-shuffles and their inverse operations. The one-copy algorithm is important for optical implementation of Omega (shuffle/exchange) networks because it leads to systems with very high light efficiency.

References (15)

  • T.-Y. Feng

    A survey of interconnection networks

    IEEE Comput.

    (1981)
  • C.-L. Wu et al.

    The universitality of the shuffleexchange network

    IEEE Trans. Comput.

    (May 1981)
  • H.S. Stone

    Parallel processing with the perfect shuffle

    IEEE Trans. Comput.

    (1971)
  • A.A. Sawchuk et al.

    Dynamic interconnections for optical processors

  • Cheng, L., and Sawchuk, A. A. 3-D Omega networks for optical implementation, to appear in Appl....
  • A.W. Lohmann

    What classical optics can do for the digital optical computer

    Appl. Opt.

    (May 1986)
  • G.E. Lohman et al.

    Optical interconnection network utilizing diffraction gratings

    Opt. Eng.

    (1988)
There are more references available in the full text version of this article.
View full text
Copyright © 1992 Published by Elsevier Inc.