Browsing by Subject "BPC permutations"
Results Per Page
ItemAn approach for exploring combinatorial properties of R-path omega Interconnection networks(Assumption University, 2010) Veselovsky, Gennady ; Assumption University. Vincent Mary School of Science and TechnologyMultiple path multistage interconnection networks as compared to their parental one path cube-type networks provide better permutation capability and offer such important property as fault-tolerance. In this paper an approach for investigation permuting ability of R-path Omega networks is proposed. The analysis as concerned to arbitrary permutations is done with the help of number theory methods. As to BPC (bit-permute-complement) permutations admissibility check to the aforementioned type of networks, the modified window method is proposed. The aforementioned method reduces drastically the time complexity of admissibility check. The results of computational experiments with applying the technique to some permutations of BPC class are given.
ItemDecomposing BPC Permutations into Semi- Permutations for Crosstalk Avoidance in Multistage Optical Interconnection Networks( 2015) Veselovsky, Gennady ; Jain, RituThis 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 in an input and output stages of the network to be used with only one optical signal at a time. It provides avoiding crosstalk in the first and the last stages of a network and creates the potential for crosstalk-free realization of a semi-permutation, and finally the whole permutation in question. The algorithm is based on employment the periodicity of appearing 1’s and 0’s in columns of transition matrices for BPC permutations.