Method of interconnecting nodes and a hyperstar interconnection structure
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 n2+n+1, where n is the order of a P...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | RAKOV MIKHAIL A |
| description | 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 n2+n+1, where n is the order of a Perfect Difference Set of the integers {d0, d1, . . . dn}. 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+di](Mod N)) for i=0, 1, . . . , n; and each node (s,j) is coupled to nodes (s+1,[j+di](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 {d0, d1, . . . dn} 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=n2+n+1. Each node (s,j) is coupled to nodes (s-1, [j+di](Mod N)) for i=0, 1, . . . , n. Each node (s,j) is coupled to nodes (s+1, [j+di](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. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US5734580A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US5734580A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US5734580A3</originalsourceid><addsrcrecordid>eNrjZPD0TS3JyE9RyE9TyMwrSS1Kzs_LS00uycxLV8jLT0ktVkjMS1FIVMioLEgtKi5JLEJVlZ-nUFxSVJpcUlqUysPAmpaYU5zKC6W5GeTdXEOcPXRTC_LjU4sLEpNT81JL4kODTc2NTUwtDByNCasAAG4LNOw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method of interconnecting nodes and a hyperstar interconnection structure</title><source>esp@cenet</source><creator>RAKOV; MIKHAIL A</creator><creatorcontrib>RAKOV; MIKHAIL A</creatorcontrib><description>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 n2+n+1, where n is the order of a Perfect Difference Set of the integers {d0, d1, . . . dn}. 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+di](Mod N)) for i=0, 1, . . . , n; and each node (s,j) is coupled to nodes (s+1,[j+di](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 {d0, d1, . . . dn} 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=n2+n+1. Each node (s,j) is coupled to nodes (s-1, [j+di](Mod N)) for i=0, 1, . . . , n. Each node (s,j) is coupled to nodes (s+1, [j+di](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.</description><edition>6</edition><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>1998</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=19980331&DB=EPODOC&CC=US&NR=5734580A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76318</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=19980331&DB=EPODOC&CC=US&NR=5734580A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>RAKOV; MIKHAIL A</creatorcontrib><title>Method of interconnecting nodes and a hyperstar interconnection structure</title><description>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 n2+n+1, where n is the order of a Perfect Difference Set of the integers {d0, d1, . . . dn}. 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+di](Mod N)) for i=0, 1, . . . , n; and each node (s,j) is coupled to nodes (s+1,[j+di](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 {d0, d1, . . . dn} 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=n2+n+1. Each node (s,j) is coupled to nodes (s-1, [j+di](Mod N)) for i=0, 1, . . . , n. Each node (s,j) is coupled to nodes (s+1, [j+di](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.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>1998</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZPD0TS3JyE9RyE9TyMwrSS1Kzs_LS00uycxLV8jLT0ktVkjMS1FIVMioLEgtKi5JLEJVlZ-nUFxSVJpcUlqUysPAmpaYU5zKC6W5GeTdXEOcPXRTC_LjU4sLEpNT81JL4kODTc2NTUwtDByNCasAAG4LNOw</recordid><startdate>19980331</startdate><enddate>19980331</enddate><creator>RAKOV; MIKHAIL A</creator><scope>EVB</scope></search><sort><creationdate>19980331</creationdate><title>Method of interconnecting nodes and a hyperstar interconnection structure</title><author>RAKOV; MIKHAIL A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US5734580A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>1998</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>RAKOV; MIKHAIL A</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>RAKOV; MIKHAIL A</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method of interconnecting nodes and a hyperstar interconnection structure</title><date>1998-03-31</date><risdate>1998</risdate><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 n2+n+1, where n is the order of a Perfect Difference Set of the integers {d0, d1, . . . dn}. 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+di](Mod N)) for i=0, 1, . . . , n; and each node (s,j) is coupled to nodes (s+1,[j+di](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 {d0, d1, . . . dn} 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=n2+n+1. Each node (s,j) is coupled to nodes (s-1, [j+di](Mod N)) for i=0, 1, . . . , n. Each node (s,j) is coupled to nodes (s+1, [j+di](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.</abstract><edition>6</edition><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US5734580A |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | Method of interconnecting nodes and a hyperstar interconnection structure |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T00%3A17%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=RAKOV;%20MIKHAIL%20A&rft.date=1998-03-31&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS5734580A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |