• Corpus ID: 32956874

Decomposing BPC Permutations into Semi- Permutations for Crosstalk Avoidance in Multistage Optical Interconnection Networks

@inproceedings{Veselovsky2015DecomposingBP,
  title={Decomposing BPC Permutations into Semi- Permutations for Crosstalk Avoidance in Multistage Optical Interconnection Networks},
  author={Gennady Veselovsky and Ritu Jain},
  year={2015}
}
The research has been funded by Assumption University of Thailand Abstract This paper introduces a simple O(N) algorithm that decomposes BPC (bit-permutecomplement) permutations into semi-permutations for avoiding crosstalk when realizing them in N × N optical multistage interconnection networks (OMINs). Crosstalk means that two optical signals, sharing an optical switch, undergo a kind of undesired coupling. A semipermutation is a partial permutation which meets the requirement for each switch… 

Figures and Tables from this paper

Crosstalk-Free BPC Semi-Permutation Routing in Optical Multistage Interconnection Networks
TLDR
This work is concentrated on semi-permutations received as a result of decomposing BPC (bit-permute-complement) permutations needed in many scientific applications.

References

SHOWING 1-10 OF 16 REFERENCES
ON CROSSTALK-FREE BPC PERMUTATIONS ROUTING IN AN OPTICAL VARIABLE-STAGE SHUFFLE-EXCHANGE NETWORK
The paper introduces an approach for crosstalk-free bitpermute-complement (BPC) permutations routing in hybrid optical variable-stage shuffle-exchange networks (SENs) of size where N=2 n , and the
Permutation Capability of Optical Multistage Interconnection Networks
TLDR
A new concept, semi-permutation, is introduced to analyze the permutation capability of optical MINs under the constraint of avoiding crosstalk, and it is applied to two examples of opticalMINs, the banyan network and the Benes network.
On path dependent loss and switch crosstalk reduction in optical networks
Optimal Realization of Any BPC Permutation on K-Extra-Stage Omega Networks
TLDR
This paper generalizes Raghavendra and Varma's result to a k-Omega where k can be any integer between 0 and n-1 and an O(NlgN) algorithm is given which realizes any BPC permutation in a minimum number of passes on a k/spl/k/spl les/n-1.
Optical multistage interconnection networks: new challenges and approaches
TLDR
Although optical MINs hold great promise and have demonstrated advantages over their electronic counterparts, they also introduce new challenges such as how to deal with the unique problem of avoiding crosstalk in the SEs.
Architectures of optical interconnection networks for high performance computing
TLDR
Two optical interconnection network architectures are presented, in an attempt to address the requirements of HPC systems in terms of bandwidth, latency, and power while understanding and abiding by the properties and limitations of optical switching and transmission technologies.
A Versatile Mechanism to Move Data in an Array Processor
  • J. Lenfant
  • Computer Science
    IEEE Transactions on Computers
  • 1985
TLDR
This work presents algorithms to control a Benes network and perform manipulations on vectors whose length is equal to the number of processing elements, and proposes a mechanism to rearrange vectors of any size, stored according to several schemes.
Analysis of Various Crosstalk Avoidance Techniques in Optical Multistage Interconnection Networks
........................................................................................................................... iii Table of
Overview of Optical Interconnect Technology
TLDR
There are many promising optical interconnect technologies and this paper presents a brief analysis of current state of optical interConnect technology.
Parallel Processing with the Perfect Shuffle
  • H. Stone
  • Mathematics
    IEEE Transactions on Computers
  • 1971
Given a vector of N elements, the perfect shuffle of this vector is a permutation of the elements that are identical to a perfect shuffle of a deck of cards. Elements of the first half of the vector
...
1
2
...