Efficient single-hop directional multichannel system
First Claim
1. A shared directional multichannel system for scheduled uniform traffic of up to k concurrent transmissions from m source stations to n destination stations, each said destination station including one receiver input, each said source station including p transmitter outputs and all said source stations being partitioned into at least one source station group such that no more than one said source station group contains less than k source stations, wherein k, m, n and p are positive nonzero integers and m≧
- k=( logp n choose (p-1)), the system comprising;
a first stage including at least (p*k) first directional couplers, each said first directional coupler having n/p outputs and no more m/k inputs, all said inputs of each said first directional coupler being connected to transmitter outputs from a respective source station group;
a second stage including n second directional couplers, each said second directional coupler having at least k inputs and one output, said output being connected to a destination station receiver input; and
interconnection means for coupling said first stage to said second stage by connecting said first directional coupler outputs to said second directional coupler inputs in a manner such that the lth transmitter output of the ith source station within each said source station group is connected to the receiver input of the jth destination station, where the modulo p sum of the digits of (j modulo p) in positions corresponding to unit digit positions in (i radix
2) is equal to (1-1).
4 Assignments
0 Petitions
Accused Products
Abstract
A shared directional multichannel for efficiently transmitting k=( logp n choose (p-1)) concurrent, non-interfering transmissions from a set of m≧k source stations, each having p transmitters, to a set of n destination stations, each having one receiver, without active repeater components. The multichannel architecture permits implementation of an efficient single-hop multichannel system using optical star couplers in a manner that limits the power spreading loss to the n/p value known for bus-oriented networks instead of n2 /p. Several coupling stages are employed, each stage having a plurality of identical substantially-square directional couplers, to obtain channel concurrency k, which is an improvement over the concurrency p available in bus-oriented networks, without the higher power spreading loss normally arising from the larger number of connections between each source station and every destination station.
-
Citations
32 Claims
-
1. A shared directional multichannel system for scheduled uniform traffic of up to k concurrent transmissions from m source stations to n destination stations, each said destination station including one receiver input, each said source station including p transmitter outputs and all said source stations being partitioned into at least one source station group such that no more than one said source station group contains less than k source stations, wherein k, m, n and p are positive nonzero integers and m≧
- k=( logp n choose (p-1)), the system comprising;
a first stage including at least (p*k) first directional couplers, each said first directional coupler having n/p outputs and no more m/k inputs, all said inputs of each said first directional coupler being connected to transmitter outputs from a respective source station group; a second stage including n second directional couplers, each said second directional coupler having at least k inputs and one output, said output being connected to a destination station receiver input; and interconnection means for coupling said first stage to said second stage by connecting said first directional coupler outputs to said second directional coupler inputs in a manner such that the lth transmitter output of the ith source station within each said source station group is connected to the receiver input of the jth destination station, where the modulo p sum of the digits of (j modulo p) in positions corresponding to unit digit positions in (i radix
2) is equal to (1-1). - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
- k=( logp n choose (p-1)), the system comprising;
-
9. A shared directional multichannel system for scheduled uniform traffic of up to k concurrent transmissions from m source stations to n destination stations, each said destination station having one receiver input, each said source station having two transmitter outputs and all said source stations being partitioned into at least one source station group such that no more than one said source station group contains less than k source stations and all said source station groups being partitioned into z clusters of no more than m/kz groups, wherein k, m, n, and z are positive nonzero integers, m≧
- k= log2 n and z=m/kx is selected to minimize the value of {max(x,y)*max(m/(2x), n/(2y))} where y=√
n/2, said system comprising;a first stage including 2kz first directional couplers, each said first directional coupler having √
n/2 outputs and no more than m/kz inputs, all said inputs of each said first directional coupler being connected to transmitter outputs from a respective source station group;a second stage including 2√
n second directional couplers, each said second directional coupler having at least kz/2 inputs and √
n outputs;first interconnection means between said first stage and said second stage for connecting said first directional coupler outputs to said second directional coupler inputs such that the lth transmitter output of the ith source station within each said source station group is connected to the receiver input of the jth destination station, where the ith digit of binary integer j is equal to (1-1); a third stage of n third directional couplers, each said third directional coupler having two inputs and one output, said output being connected to a destination station receiver input; and second interconnection means between said second stage and said third stage for connecting said second directional coupler outputs to said third directional coupler inputs such that the lth transmitter output of the ith source station within each said source station group is connected to the receiver input of the jth destination station, where the ith digit of binary integer j is equal to (1-1). - View Dependent Claims (10, 11, 12, 13, 14, 15)
- k= log2 n and z=m/kx is selected to minimize the value of {max(x,y)*max(m/(2x), n/(2y))} where y=√
-
16. A method for interconnecting a first set of m source stations of k types, each said source station having p transmitter outputs, to a second set of n destination stations, each said destination station having one receiver input, such that each source station is uniquely connected to every destination station by a single-hop directional connection whereby collision can be avoided by scheduling no more than k concurrent transmissions from said m source stations, wherein k, m, n and p are positive nonzero integers and m≧
- k=( logp n choose (p-1)), the method comprising the steps of;
partitioning said m source stations into at least one source station group such that no more than one said source station group contains less than k source stations; and connecting the lth transmitter output of the ith source station within each said source station group to the receiver input of the jth destination station, where the modulo p sum of the digits of (j modulo p) corresponding to unit digit positions in (i radix
2) is equal to (1-1), each said connection includinga first link between said lth transmitter output and an input of the first in a series of at least two coupling stages, each said coupling stage having a plurality of substantially square directional couplers, each said substantially square directional coupler including a first plurality of coupler inputs and a second plurality of coupler outputs where said first and second pluralities are substantially equal, with the outputs of each said coupling stage connected to the inputs of the immediately subsequent coupling stage, a penultimate link between an output of the last in said series of at least two coupling stages and an input of a final coupling stage of at least n number of final directional couplers, each said final directional coupler having p inputs and a single output, and a final link between the jth output of said final coupling stage and the receiver input of said jth destination station. - View Dependent Claims (17, 18, 19, 20, 21, 22)
- k=( logp n choose (p-1)), the method comprising the steps of;
-
23. A method for interconnecting a first set of m source stations of k types, each said source station having p transmitter outputs, to a second set of n destination stations, each said destination station having one receiver input, such that each source station is uniquely connected to every destination station by a single-hop directional connection whereby collision can be avoided by scheduling no more than k concurrent transmissions from said m source stations, wherein k, m, n and p are positive nonzero integers m≧
- k=( logp n choose (p-1)), the method comprising the steps of;
partitioning m source stations into at least one source station group such that no more than one said source station group contains less than k source stations; and connecting the lth transmitter output of the ith source station within each said source station group to the receiver input of the jth destination station, where the modulo p sum of the digits of (j modulo p) in positions corresponding to unit digit positions in (i radix
2) is equal to (1-1), each said connection includinga first link between said lth transmitter output of the ith source station and an input of a first coupling stage of at least (p*k) number of directional couplers each having n/p outputs and no more than n/k inputs, a second link between an output of said first coupling stage and an input of a second coupling stage of at least n number of directional couplers having no less than k inputs and one output, and a third link between an output of said second coupling stage and the receiver input of said jth destination station. - View Dependent Claims (24, 25, 26, 27, 28)
- k=( logp n choose (p-1)), the method comprising the steps of;
-
29. A shared directional multichannel system for scheduled uniform traffic of up to k concurrent transmissions from m source stations to n destination stations, each said destination station including one receiver input, each said source station including p transmitter outputs and all said source stations being partitioned into at least one source station group such that no more than one said source station group contains less than k source stations, wherein k, m, n and p are positive nonzero integers and m≧
- k=( logp n choose (p-1)), the system comprising;
means for passively coupling optical signals from said source stations to said destination stations such that the power received at each said receiver is greater than p/n2 times the power transmitted from the respective said transmitter. - View Dependent Claims (30)
- k=( logp n choose (p-1)), the system comprising;
-
31. A shared directional multichannel system for scheduled uniform traffic of up to k concurrent transmissions from m source stations to n destination stations, each said destination station having one receiver input, each said source station having two transmitter outputs and all said source stations being partitioned into at least one source station group such that no more than one said source station group contains less than k source stations wherein k, m, and n are positive nonzero integers, and m≧
- k= log2 n , said system comprising;
means for passively coupling optical signals from said source stations to said destination stations such that the power received at each said receiver is greater than 2/n2 times the power transmitted from the respective said transmitter. - View Dependent Claims (32)
- k= log2 n , said system comprising;
Specification