Issue No. 07 - July (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.256455
<p>It is shown that the bisectional interconnection network (BIN) of 2/sup n/ nodes for any even n is isomorphic to the n-dimensional folded hypercube (FHC), an n-dimensional hypercube with additional edges between any two nodes that are of Hamming distance n apart. This observation leads to simplification for the proofs of many interesting properties for the BIN. Inspired by the isomorphism between BIN and FHC, the class of topologies in which nodes are represented by bit strings and two nodes are adjacent if and only if the bitwise Exclusive-OR of their addresses fall in a set of predefined bit string patterns are studied. A few theorems are given to characterize the topology from the mathematical properties of the binary matrix derived from the definition of edges.</p>
observation; bisectional interconnection networks; n-dimensional folded hypercube; Hamming distance; isomorphism; bitwise Exclusive-OR; predefined bit string patterns; binary matrix; hypercube networks.
C. Ho, "An Observation on the Bisectional Interconnection Networks," in IEEE Transactions on Computers, vol. 41, no. , pp. 873-877, 1992.