Method of interconnecting nodes and a hyperstar interconnection structure

Abstract

An interconnection structure includes a plurality of nodes and a plurality of information elements. The plurality of nodes are arranged in a regular array having a preselected number N columns and having a preselected number S rows. The preselected number N equals n.sup.2 +n+1, where n is the order of a Perfect Difference Set of the integers {d.sub.0, d.sub.1, . . . d.sub.n }. Each node is coupled to nodes in the previous row and the subsequent row according to a diagram of interconnections. In particular, each node (s,j) is coupled to nodes (s-1, �j+d.sub.i !(Mod N)) for i=0, 1, . . . , n; and each node (s,j) is coupled to nodes (s+1,�j+d.sub.i !(Mod N)) for i=0, 1, . . . , n. In a method of interconnecting a plurality of nodes, an order n is selected. A Perfect Difference Set comprising the set of {d.sub.0, d.sub.1, . . . d.sub.n } is selected. A plurality of nodes are arranged in a regular array having a preselected number N columns and having a preselected number S rows, the preselected number N=n.sup.2 +n+1. Each node (s,j) is coupled to nodes (s-1, �j+d.sub.i !(Mod N)) for i=0, 1, . . . , n. Each node (s,j) is coupled to nodes (s+1, �j+d.sub.i !(Mod N)) for i=0, 1, . . . , n. Information elements are coupled to any of the nodes (s,j), for s=0, 1, . . . , S and j=0, 1, . . . , N-1.