Patent US5734580A successfully refreshed from Google Patents.
US5734580A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of interconnecting nodes and a hyperstar interconnection structure
Assignee: Individual
•
Filing: 1996-03-13
•
Granted: 1998-03-31
•
Expires: 2016-03-13
Abstract
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 2 +n+1, where n is the order of a Perfect Difference Set of the integers {d 0 , d 1 , . . . d 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 i !(Mod N)) for i=0, 1, . . . , n; and each node (s,j) is coupled to nodes (s+1, j+d 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 0 , d 1 , . . . d 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 2 +n+1. Each node (s,j) is coupled to nodes (s-1, j+d i !(Mod N)) for i=0, 1, . . . , n. Each node (s,j) is coupled to nodes (s+1, j+d 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.
Inventors
- 👤 Mikhail A. Rakov
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 14:32
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17337; G06F15/17343; G06F15/76; G06F15/80; G06F15/8007; G06F15/8023; G06F30/00; G06F30/10; G06F30/18; G06F2111/00; G06F2111/08
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
105 words
A method of interconnecting a plurality of nodes, the method comprising the steps of: selecting an order n; selecting a Perfect Difference Set comprising the set of {d 0 ,d 1 , . . . d n }; arranging a plurality of nodes in a regular array having a preselected number N columns and having a preselected number S rows, the preselected number N=n 2 +n+1; coupling each node (s,j) to nodes (s-1, j+d i !(Mod N)) for i=0, 1, . . . , n; and coupling each node (s,j) to nodes (s+1, j+d i !(Mod N)) for i=0, 1, . . . , n.
Claim 2
Independent Claim
105 words
A method of interconnecting a plurality of nodes, the method comprising the steps of: selecting an order n; selecting a Perfect Difference Set comprising the set of {d 0 ,d 1 , . . . d n }; arranging a plurality of nodes in a regular array having a preselected number N columns and having a preselected number S rows, the preselected number N=n 2 +n+1; coupling each node (s,j) to nodes (s-1, j+d i !(Mod N)) for i=0, 1, . . . , n; and coupling each node (s,j) to nodes (s+1, j+d i !(Mod N)) for i=0, 1, . . . , n.
Claim 3
Dependent Claim
32 words
The method of claim 1 further comprising the step of: coupling information elements to nodes (s,j), for s=0, 1, . . . , S, and j=0, 1, . . . , N-1.
Claim 4
Dependent Claim
88 words
An interconnection structure comprising: a plurality of nodes arranged in a regular array having a preselected number N columns and having a preselected number S rows, each node (s,j) being coupled to nodes (s-1, j+d i !(Mod N)), for i=0, 1, . . . , n, and being coupled to nodes (s+1, (j+d i )(Mod N)), for i=0, 1, . . . , n, where d i are components of a Perfect Difference Set of order n and the preselected number N of columns equals n 2 +n+1.
Claim 5
Dependent Claim
88 words
An interconnection structure comprising: a plurality of nodes arranged in a regular array having a preselected number N columns and having a preselected number S rows, each node (s,j) being coupled to nodes (s-1, j+d i !(Mod N)), for i=0, 1, . . . , n, and being coupled to nodes (s+1, (j+d i )(Mod N)), for i=0, 1, . . . , n, where d i are components of a Perfect Difference Set of order n and the preselected number N of columns equals n 2 +n+1.
Claim 6
Dependent Claim
18 words
The interconnection structure of claim 3 further comprising a plurality of connecting lines providing said coupling between nodes.
Claim 7
Dependent Claim
44 words
The interconnection structure of claim 3 further comprising a plurality of information elements, each of the plurality of information elements being coupled to any of the nodes (s,j), for s=1, 2, . . . , S and j=0, 1, . . . , N-1.
Claim 8
Dependent Claim
27 words
The interconnection structure of claim 5 further comprising a plurality of connecting lines providing said coupling between nodes and between nodes and the plurality of information elements.
Claim 9
Dependent Claim
16 words
The interconnection structure of claim 5 wherein each information element comprises a transmitter and a receiver.
Claim 10
Dependent Claim
33 words
The interconnection structure of claim 3 wherein any of the plurality of nodes comprises a plurality of substructures of order n' and a number N' of inputs, where N'=n '2 +n'+1 and n'≦N.
Claim 11
Dependent Claim
213 words
An interconnection structure comprising: a plurality of hierarchical nodes arranged in a regular array having a preselected number N a columns and having a preselected number S rows, each node (s,j) being coupled to nodes (s-1, j+d i !(Mod N a )), for i=0, 1, . . . , n a , and being coupled to node (s+1, (j+d i )(Mod N a )), for i=0, 1, . . . , n a , where d i are components of a Perfect Difference Set of order n a and the preselected number N a of columns equals n a 2 +n a +1, any of the plurality of hierarchical nodes comprising a plurality of hierarchical nodes arranged in a regular array having a preselected number N b columns and having a preselected number S' rows, each node (s,j) being coupled to node (s'-1, j+d i !(Mod N b )), for i=0, 1, . . . , n b , and being coupled to node (s'+1,(j+d i )(Mod N b )), for i=0, 1, . . . , n b , where d i are components of a Perfect Difference Set of order n b and the preselected number N b =n b 2 +n b +1, the number n b ≦N a .
Claim 12
Dependent Claim
213 words
An interconnection structure comprising: a plurality of hierarchical nodes arranged in a regular array having a preselected number N a columns and having a preselected number S rows, each node (s,j) being coupled to nodes (s-1, j+d i !(Mod N a )), for i=0, 1, . . . , n a , and being coupled to node (s+1, (j+d i )(Mod N a )), for i=0, 1, . . . , n a , where d i are components of a Perfect Difference Set of order n a and the preselected number N a of columns equals n a 2 +n a +1, any of the plurality of hierarchical nodes comprising a plurality of hierarchical nodes arranged in a regular array having a preselected number N b columns and having a preselected number S' rows, each node (s,j) being coupled to node (s'-1, j+d i !(Mod N b )), for i=0, 1, . . . , n b , and being coupled to node (s'+1,(j+d i )(Mod N b )), for i=0, 1, . . . , n b , where d i are components of a Perfect Difference Set of order n b and the preselected number N b =n b 2 +n b +1, the number n b ≦N a .
Claim 13
Dependent Claim
116 words
A bipartite interconnection structure comprising: a preselected number 2N of information elements; and a plurality of nodes arranged in a regular array having the preselected number N of columns and having three rows, each node (0,j) of the first row and each node (2,j) of the third row being coupled to one of the plurality of information elements, each node of the second row (1,j) being coupled to the nodes of the first and second rows ( j+di!(Mod N)) for j=0, . . . ,N and i=0, 1, . . . ,n, where d i are components of a Perfect Difference Set of order n and the preselected number N of columns equals n 2 +n+1.
Claim 14
Dependent Claim
116 words
A bipartite interconnection structure comprising: a preselected number 2N of information elements; and a plurality of nodes arranged in a regular array having the preselected number N of columns and having three rows, each node (0,j) of the first row and each node (2,j) of the third row being coupled to one of the plurality of information elements, each node of the second row (1,j) being coupled to the nodes of the first and second rows ( j+di!(Mod N)) for j=0, . . . ,N and i=0, 1, . . . ,n, where d i are components of a Perfect Difference Set of order n and the preselected number N of columns equals n 2 +n+1.
Claim 15
Dependent Claim
92 words
A complete hyperstar interconnection structure comprising: a preselected number N of information elements; and a plurality of nodes arranged in a regular array having the preselected number N of columns and having two rows, each node (0,j) of the first row being coupled to nodes of the second row (1,(j+d i )(Mod N)), for j=0, 1, . . . ,N and i=0, 1, . . . , n, where d i are components of a Perfect Difference Set of order n, and the preselected number N of columns equals n 2 =n+1.
Claim 16
Dependent Claim
92 words
A complete hyperstar interconnection structure comprising: a preselected number N of information elements; and a plurality of nodes arranged in a regular array having the preselected number N of columns and having two rows, each node (0,j) of the first row being coupled to nodes of the second row (1,(j+d i )(Mod N)), for j=0, 1, . . . ,N and i=0, 1, . . . , n, where d i are components of a Perfect Difference Set of order n, and the preselected number N of columns equals n 2 =n+1.
Claim 17
Dependent Claim
26 words
The interconnection structure of claim 11 wherein for j=0, . . . , N, node (0,j) and node (1,j) are integral with a bi-directional node j.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-03-30 | 2001-09-29 | 2002-03-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-03-30 | 2005-09-29 | 2006-03-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-03-30 | 2009-09-29 | 2010-03-31 | $7700.00 | Window Closed / Lapsed |