Patent US3821944A successfully refreshed from Google Patents.
Patent EP0366938A2 successfully refreshed from Google Patents.
EP0366938A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
High speed switch as for an optical communication system
Assignee: International Business Machines Corp
•
Filing: 1989-09-29
•
Granted: —
•
Expires: 2009-09-29
Abstract
Abstract In a data communications network the routing of data items from a group of eight source processors to a group of eight destination processors is controlled by code values assigned to each of the data values. The data items to be routed are bit-serial binary signals. These are encoded by the source processor using a pair of code values, one for each value of a bit of the binary signal. The eight source processors each encode eight bit-serial signals using respectively different code tables. The code tables are generated as different permutations of a basic code set. Each code table has the property that any additive combination of encoded values for all of the data items in a group produces a unique sum. The eight encoded values produced by each processor are summed to produce a set of analog channel symbols that are transmitted over an analog channel to a central switch fabric. In the switch fabric, the channel symbols are partially decoded to recover the encoded data values. The data values are regrouped according to their destination processors and summed to produce further sets of channel symbols which are transmitted to the destination processors. At the destination processors, the data values are completely decoded and assigned to separate input terminals of the destination processors based on their source processor.
Inventors
- 👤 Yeong-Chang Sa-S72 Lien
- 👤 Roch Andre Guerin
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-27 21:00
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17356; G06F15/17368; G06F15/17375; H; H04; H04J; H04J14/00; H04J14/005
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
171 words
A method of routing data items provided by a plurality of source nodes to a plurality of destination nodes, comprising the steps of: A. assigning basic code values to each data item provided by each of said plurality of source nodes, where the code values indicate the desired destination node of each of said data items; B. combining the basic code values representing data items provided by each of said plurality of source nodes to generate a respective plurality of sets of channel symbols; C. separating said plurality of sets of channel symbols into their respective constituent basic code values; D. associating the separated basic code values indicating a predetermined one of said plurality of destination nodes to form a group of basic code values, wherein each code value in said group of basic code values indicates a respectively different source node; E. decoding each code value in said group of basic code values to recover the data items directed to said one destination node by each of the source nodes.
Claim 2
Independent Claim
171 words
A method of routing data items provided by a plurality of source nodes to a plurality of destination nodes, comprising the steps of: A. assigning basic code values to each data item provided by each of said plurality of source nodes, where the code values indicate the desired destination node of each of said data items; B. combining the basic code values representing data items provided by each of said plurality of source nodes to generate a respective plurality of sets of channel symbols; C. separating said plurality of sets of channel symbols into their respective constituent basic code values; D. associating the separated basic code values indicating a predetermined one of said plurality of destination nodes to form a group of basic code values, wherein each code value in said group of basic code values indicates a respectively different source node; E. decoding each code value in said group of basic code values to recover the data items directed to said one destination node by each of the source nodes.
Claim 3
Dependent Claim
106 words
The method of routing data set forth in Claim 1 wherein said data items represent one of first and second values and the step A comprises, encoding the data items produced by a predetermined source node and destined for said plurality of destination nodes with a respective plurality of pairs of N-bit binary code values from a code set, one code value of a pair being assigned when said data item has said first value and the other code value of said pair being assigned when said data item has said second value, wherein said code set defines a multiple access code for an additive channel.
Claim 4
Dependent Claim
69 words
The method of routing data set forth in Claim 2, wherein the step B comprises the steps of: converting said plurality of assigned code values into a respective plurality of N-bit bit-serial signals; converting said plurality of N-bit bit-serial signals into a respective plurality of sequences of N analog values; and additively combining said plurality of sequences of analog values to generate said plurality of sequences of channel symbols.
Claim 5
Dependent Claim
205 words
The method of routing data set forth in Claim 1 wherein: said step B includes the steps of: additively combining the basic code values representing data items provided by each of said plurality of source nodes to generate said respective plurality of sets of channel symbols; and transmitting said plurality of sets of channel symbols via a respective plurality of data transmission channels; said step C includes the steps of: receiving said plurality of sets of channel symbols via said plurality of data transmission channels; and separating said received plurality of sets of channel symbols into their respective constituent basic code values; and said step D includes the steps of: associating the separated basic code values indicating said predetermined destination node to form a group of basic code values, wherein each code value in said group of basic code values indicates a respectively different source node; additively combining the code values in said group of basic code values to generate a further set of channel symbols; transmitting said further set of channel symbols via a further transmission channel; receiving said further set of channel symbols via said further transmission channel; and separating said further set of channel symbols into said group of basic code values.
Claim 6
Dependent Claim
49 words
The method of routing data set forth in Claim 3, wherein plurality of source nodes includes K source nodes and said plurality of sets of channel symbols includes K sets, each set containing N channel symbols where N and K are integers and N is not greater than K.
Claim 7
Dependent Claim
18 words
The method of routing data set forth in Claim 5, wherein K equals eight and N equals four.
Claim 8
Dependent Claim
196 words
A data communications network for routing data items provided by a plurality of source nodes to a plurality of destination nodes, comprising: encoding means for encoding each data item provided by each of said plurality of source nodes to indicate the value of the data item and a desired destination node for the data item; combining means, coupled to said encoding means, for combining the encoded data items provided by each one of said plurality of source nodes to generate a respective plurality of sequences of channel symbols; separating means, coupled to said combining means, for separating said plurality of sequences of channel symbols into their respective constituent encoded data items; grouping means, coupled to said separating means, for associating ones of said encoded data items indicating a predetermined one of said plurality of destination nodes to form a group of encoded data items, wherein each encoded data item in said group of encoded data items indicates a respectively different source node; decoding means for decoding said group of encoded data items to recover data items directed to said predetermined one of said plurality of destination nodes by each one of said plurality of source nodes.
Claim 9
Dependent Claim
196 words
A data communications network for routing data items provided by a plurality of source nodes to a plurality of destination nodes, comprising: encoding means for encoding each data item provided by each of said plurality of source nodes to indicate the value of the data item and a desired destination node for the data item; combining means, coupled to said encoding means, for combining the encoded data items provided by each one of said plurality of source nodes to generate a respective plurality of sequences of channel symbols; separating means, coupled to said combining means, for separating said plurality of sequences of channel symbols into their respective constituent encoded data items; grouping means, coupled to said separating means, for associating ones of said encoded data items indicating a predetermined one of said plurality of destination nodes to form a group of encoded data items, wherein each encoded data item in said group of encoded data items indicates a respectively different source node; decoding means for decoding said group of encoded data items to recover data items directed to said predetermined one of said plurality of destination nodes by each one of said plurality of source nodes.
Claim 10
Dependent Claim
124 words
The data communications system set forth in Claim 7, further comprising: a plurality of data transmission means coupled for conveying said respective plurality of sequences of channel symbols from said combining means to said separating means; further combining means, coupled to said grouping means, for combining the encoded data items in said group of encoded data items to generate a further sequence of channel symbols; further data transmission means coupled to said further combining means for conveying said further sequence of channel symbols; further separating means, coupled to receive said further sequence of channel symbols from said further data transmission means, for regenerating said group of encoded data items therefrom and for providing said regenerated group of encoded data items to said decoding means.
Claim 11
Dependent Claim
132 words
The data communications system set forth in Claim 7 wherein: each of said data items may represent one of first and second values; each of said plurality of encoding means includes means for applying the data items provided by a predetermined one of said source nodes and destined for said plurality of destination nodes to a plurality of data encoders, respectively, wherein each of said plurality of data encoders uses a respectively different pair of code values from a code set to encode the respective first and second values of said data items; each of said plurality of combining means includes means for additively combining the encoded data items produced by the plurality of data encoders of the respective encoding means to generate one of said plurality of sequences of channel symbols;
Claim 12
Dependent Claim
45 words
The data communications network set forth in Claim 9, wherein: The code sets used by each of said plurality of encoding means are respectively different permutations of a basic code set; and said basic code set is a multiple access code for an additive channel.
Claim 13
Dependent Claim
111 words
A data communications network for routing data items provided by R source nodes to S destination nodes, where S is greater than R, comprising: a first R by R data communications network coupled to route data items provided by said R source nodes to a first group of N of said destination nodes during a first time period; and a second R by R data communications network coupled to route data items provided by said R source nodes to a second group of M of said destination nodes during a second time period, exclusive of said first time period, where the sum of M and N is not greater than S.
Claim 14
Dependent Claim
111 words
A data communications network for routing data items provided by R source nodes to S destination nodes, where S is greater than R, comprising: a first R by R data communications network coupled to route data items provided by said R source nodes to a first group of N of said destination nodes during a first time period; and a second R by R data communications network coupled to route data items provided by said R source nodes to a second group of M of said destination nodes during a second time period, exclusive of said first time period, where the sum of M and N is not greater than S.
Claim 15
Dependent Claim
188 words
A data communications network for routing data items provided by S source nodes to S destination nodes, comprising: a first R by R data communications network, R being not greater than S, coupled for routing data items provided by a first group of said source nodes to a first group of said destination nodes during a first time period; a second R by R data communications network, coupled for routing data items provided by said the first group of said source nodes to a second group of said destination nodes, exclusive of said first group of destination nodes, during a second time period, exclusive of said first time period; a third R by R data communications network, coupled for routing data items provided by a second group of said source nodes, exclusive of said first group of soruce nodes, to the second group of said destination nodes during said first time period; and a fourth R by R data communications network, coupled for routing data items provided by the second group of said source nodes to the first group of said destination nodes during said second time period;
Claim 16
Dependent Claim
188 words
A data communications network for routing data items provided by S source nodes to S destination nodes, comprising: a first R by R data communications network, R being not greater than S, coupled for routing data items provided by a first group of said source nodes to a first group of said destination nodes during a first time period; a second R by R data communications network, coupled for routing data items provided by said the first group of said source nodes to a second group of said destination nodes, exclusive of said first group of destination nodes, during a second time period, exclusive of said first time period; a third R by R data communications network, coupled for routing data items provided by a second group of said source nodes, exclusive of said first group of soruce nodes, to the second group of said destination nodes during said first time period; and a fourth R by R data communications network, coupled for routing data items provided by the second group of said source nodes to the first group of said destination nodes during said second time period;
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.