VECTOR OPERATION ON NODES OF PERFECT DIFERENCE NETWORK USING LOGICAL OPERATORS

Abstract

In this paper we are exploring the bitwise connection between the nodes of a interconnection network. We are taking PDN as a model, First of all we are converting the interconnection network into its equivalent connectivity matrix .Then Row/Column vectors of connectivity matrix is used to present the value of a particular node of interconnection network which is shown in Figure 1 as state diagram of PDN which is δ=2. Each bitwise vector shows connectivity with another node in position of bit 1.The vectors also shows the mathematical property of PDN, it means the value of vector of a node in the connectivity matrix preserves the mathematical property of the topology. We assume that each node is connected to itself as a self loop in connectivity matrix. Therefore the diagonal matrix is always 1. The presence of 1’s   in a vector (Excluding the self loop) shows degree of the node .The connectivity and its complexity will be explored by using logical operators between the nodes of a PDN so that we can develop algorithms for automatic switching between two nodes automatically. In the due course of study we found many patterns of binary/logical relationship between the nodes which will be discussed in our future discussion in this paper.