×

Efficient single-hop interconnection network employing merged shared directional multichannels

  • US 5,278,927 A
  • Filed: 05/26/1992
  • Issued: 01/11/1994
  • Est. Priority Date: 05/26/1992
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method for interconnecting m1 groups of m2 first Source Stations (SSs) each said first SS having at least a1 groups of a2 outputs for transmitting message signals to n2 groups of n1 first Destination Stations (DSs) each said first DS having at least b2 groups of b1 inputs for receiving said message signals, such that each said first SS is uniquely connected to every said first DS by a single-hop directional connection whereby up to k3 concurrent non-interfering message signal transmissions can be scheduled from said m2 *m1 =m3 first SSs to said n2 *n1 =n3 first DSs, wherein k3 =k1 *k2, ni >

  • ki and mi >

    ki, and wherein ki, mi, ni, ai and bi are positive non-zero integers for i=1, 2 or 3, said method comprising the steps of;

    (a) composing said interconnection of said first SSs and said first DSs by performing the steps of(a.1) abutting a first plurality of first Shared Directional Multichannels (SDMs) to a second plurality of second SDMs, each said first SDM having a first plurality of coupling stages each having one or more couplers, said each first SDM having capacity for scheduled uniform message signal traffic of up to k1 concurrent signals from m1 second SSs, each said second SS having at least a1 outputs for transmitting said signals to n1 second DSs, each said second DS having at least b1 inputs for receiving said signals, each said second SDM having a second plurality of coupling stages each having one or more couplers, said each second SDM having capacity for scheduled uniform message signal traffic of up to k2 concurrent signals from m2 third SSs, each said third SS having at least a2 outputs for transmitting said signals to n2 third DSs, each said third DS having at least b2 inputs for receiving said signals, wherein said first plurality of first SDMs is at least (n2 *b2) in number and said second plurality of second SDMs is at least (m1 *a1) in number,(a.2) assigning a second SDM index to every said second SDM in said second plurality according to the concatenation (s1, t1) of an index s1

    m1 for one said first SS group and an index t1

    a1 for one said first SS output group, where s1 and t1 are positive non-zero integers and said second SDM index is the concatenation (s1,t1),(a.3) assigning a second output index to every output of each said second SDM having said second SDM index (s1, t1) according to the concatenation (d2, r2) of an index d2 <

    n2 for one said third DS and an index r2 <

    b2 for one said third DS input, where d2 and r2 are positive non-zero integers and said second output index is the concatenation (s1, t1, d2, r2),(a.4) assigning a first SDM index to every said first SDM in said first plurality according to the concatenation (d2, r2) of an index d2

    n2 for one said first DS group and an index r2

    b2 for one said first DS input group, where d2 and r2 are positive non-zero integers and said first SDM index is the concatenation (d2,r2),(a.5) assigning a first input index to every input of each first SDM having said first SDM index (d2, r2) according to the concatenation (s1, t1) of an index s1

    m1 for one said second SS and an index t1

    a1 for one said second SS output, where s1 and t1 are positive non-zero integers and said first input index is the concatenation (s1, t1, d2, d2), and(a.6) connecting each said output from said second plurality of second SDMs having a second output index (s1,t1,d2,r2) to all said inputs of said first plurality of first SDMs having said first input index (s1, t1, d2, r2).

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×