Patent US4779265A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4779265A Expired / Lapsed US ⏱️ 0.0 years remaining

Multiple access communication system

Assignee: Iconectiv LLC
•
Filing: 1986-10-27
•
Granted: 1988-10-18
•
Expires: 2006-10-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Methodology, and associated circuitry, for encoding and decoding signals utilize bistate orthogonal code techniques that effect autonomy of communications and simplified signal processing, thereby improving reliability. Encoder (121) processes an incoming data stream by associating a bistate orthogonal code with each binary one in the input stream and then by transmitting a series of rate-increased pulses over a path during intervals determined by the code for each of the binary ones. Decoder (131), in synchronism with encoder (121), is generally arranged as a correlation detector in that the decoder only responds to the particular bistate orthogonal code for which it is configured. Sensors in energy transfer relation to the path are positioned at detection points on the path in correspondence to an assigned code. The outputs of the sensors are processed to produce a rate-decreased detected signal at the rate of the input stream whenever a rate-increased stream corresponding to the decoder configuration is propagating along the path.

Inventors

  • 👤 Mary G. O'Connor
  • 👤 Jawad A. Salehi
  • 👤 Martin Kerner

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 13:41
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/0001; H04J; H04J14/00; H04J14/005

Claims Analysis

Total Claims: 23
Claim 1
Independent Claim 220 words
In a system comprising synchronized encoders and decoders, a method for encoding an input data stream partitioned into frames in each of the encoders to produce a corresponding output data stream at a given rate detectable by at least one of the decoders, with each data stream comprising zero and non-zero states, said method of CHARACTERIZED BY THE STEPS OF associating a code vector from a bistate orthogonal code with the input stream, said code selected in correspondence to predetermined transmission characteristics of the system, and for each non-zero state in the input stream, generating a rate-increased data stream as determined by said code vector to represent said each non-zero state in the output stream, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M<K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . , d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU14## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by differenct ones of the decoders are distinct , and (ii) a delay detected by some of the decoders occurs at most once in the K intervals.
Claim 2
Dependent Claim 220 words
In a system comprising synchronized encoders and decoders, a method for encoding an input data stream partitioned into frames in each of the encoders to produce a corresponding output data stream at a given rate detectable by at least one of the decoders, with each data stream comprising zero and non-zero states, said method of CHARACTERIZED BY THE STEPS OF associating a code vector from a bistate orthogonal code with the input stream, said code selected in correspondence to predetermined transmission characteristics of the system, and for each non-zero state in the input stream, generating a rate-increased data stream as determined by said code vector to represent said each non-zero state in the output stream, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M<K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . , d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU14## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by differenct ones of the decoders are distinct , and (ii) a delay detected by some of the decoders occurs at most once in the K intervals.
Claim 3
Dependent Claim 67 words
The method as recited in claim 1 wherein said chip intervals have an associated chip propagation rate and wherein the step of generating a rate-increased data stream comprises the steps of assigning each chip interval a zero or non-zero state in correspondence to the elements of said code vector, and sequentially emitting the asigned chip interval states at said chip rate to form said rate-increased data stream.
Claim 4
Dependent Claim 25 words
The method as recited in claim 2 wherein each data stream is composed of binary bits with logic one level corresponding to said non-zero state.
Claim 5
Independent Claim 216 words
A method comprising the step of encoding a plurality of input mark-space binary streams partitioned into frames emitted by a plurality of transmitters to produce a corresponding plurality of output mark-space binary streams detectable by preselected receivers, said method further CHARACTERIZED BY THE STEPS OF synchronizing the receivers and the transmitters associating a bistate orthogonal code vector from a preselected code with each of the input streams, said code selected in correspondence to predetermined system requirements, and for each mark in each of the input streams, synchronously generating a rate-increased binary stream as determined by said associated code vector to represent said each mark in the corresponding one of the output streams, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M≦K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . , d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU15## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by differenct ones of the receivers are distrinct, and (ii) a delay detected by some of the receivers occurs at most once in the K intervals.
Claim 6
Independent Claim 216 words
A method comprising the step of encoding a plurality of input mark-space binary streams partitioned into frames emitted by a plurality of transmitters to produce a corresponding plurality of output mark-space binary streams detectable by preselected receivers, said method further CHARACTERIZED BY THE STEPS OF synchronizing the receivers and the transmitters associating a bistate orthogonal code vector from a preselected code with each of the input streams, said code selected in correspondence to predetermined system requirements, and for each mark in each of the input streams, synchronously generating a rate-increased binary stream as determined by said associated code vector to represent said each mark in the corresponding one of the output streams, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M≦K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . , d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU15## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by differenct ones of the receivers are distrinct, and (ii) a delay detected by some of the receivers occurs at most once in the K intervals.
Claim 7
Dependent Claim 247 words
In a synchronized system comprising transmitters and receivers, a method for encoding a plurality of input binary streams partitioned into frames in each transmitter to produce a corresponding plurality of output data streams detectable by predetermined receivers, said method CHARACTERIZED BY THE STEPS OF storing a set of bistate orthogonal code vectors from a preselected code in an addressable memory in each of the transmitters and assigning each said code vectors to one of said input streams, said set selected in correspondence to predetermined system requirements, and for each binary one in each of the input streams, accessing said memory to identify said assigned code vector associated with said each of the input streams and syschronously generating a rate-increased binary stream in correspondence to said identified code vector as the substitute for said binary one in the corresponding stream from the output streams, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M≦K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . , d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1>i≦M-1 and ##EQU16## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by different ones of the decoders are distinct, and (ii) a delay detected by some of the decoders occurs at most once in the K intervals.
Claim 8
Dependent Claim 247 words
In a synchronized system comprising transmitters and receivers, a method for encoding a plurality of input binary streams partitioned into frames in each transmitter to produce a corresponding plurality of output data streams detectable by predetermined receivers, said method CHARACTERIZED BY THE STEPS OF storing a set of bistate orthogonal code vectors from a preselected code in an addressable memory in each of the transmitters and assigning each said code vectors to one of said input streams, said set selected in correspondence to predetermined system requirements, and for each binary one in each of the input streams, accessing said memory to identify said assigned code vector associated with said each of the input streams and syschronously generating a rate-increased binary stream in correspondence to said identified code vector as the substitute for said binary one in the corresponding stream from the output streams, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M≦K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . , d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1>i≦M-1 and ##EQU16## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by different ones of the decoders are distinct, and (ii) a delay detected by some of the decoders occurs at most once in the K intervals.
Claim 9
Independent Claim 242 words
A method for communicating information partitioned into frames at a given rate between encoder and decoder pairs asa a binary stream transmitted over a path interconnecting the encoders and decoders, said method CHARACTERIZED BY THE STEPS OF synchronizing the encoders and decoders associating a code vector from a bistate orthogonal code with each of the encoders, said codes selected in correspondence to predetermined communication requirements including the number of users coupled to the path and the bandwidth of the path, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M<K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . ,d.sub.M > with d i equaling the delay, between the i th and (i+1) st pulses for 1>i>M-1 and ##EQU17## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by differenct ones of the decoders are distint, and (ii) a delay detected by some of the decoders occurs at most once in the K intervals, for each binary one received by each of the encoders, propagating over the path a rate-increased binary stream as determined by said code vector, and arranging each of the decoders in energy transfer relation to the path at detection points determined by the code vector to produce a detected signal whenever said rate-increased stream is propagating over the path.
Claim 10
Independent Claim 242 words
A method for communicating information partitioned into frames at a given rate between encoder and decoder pairs asa a binary stream transmitted over a path interconnecting the encoders and decoders, said method CHARACTERIZED BY THE STEPS OF synchronizing the encoders and decoders associating a code vector from a bistate orthogonal code with each of the encoders, said codes selected in correspondence to predetermined communication requirements including the number of users coupled to the path and the bandwidth of the path, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M<K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . ,d.sub.M > with d i equaling the delay, between the i th and (i+1) st pulses for 1>i>M-1 and ##EQU17## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by differenct ones of the decoders are distint, and (ii) a delay detected by some of the decoders occurs at most once in the K intervals, for each binary one received by each of the encoders, propagating over the path a rate-increased binary stream as determined by said code vector, and arranging each of the decoders in energy transfer relation to the path at detection points determined by the code vector to produce a detected signal whenever said rate-increased stream is propagating over the path.
Claim 11
Dependent Claim 197 words
In combination, an optical communication path, a plurality of encoders and decoders, each of the encoders comprising a source of light pulses, means responsive to an input binary stream partitioned into frames for enabling said source to generate light pulses in correspondence to components of a code vector from a bistate orthogonal code, and means, coupled to said means for enabling, for propagating said pulses as a rate-increased output stream onto said path, and means for synchronizing said encoders and decoders to detect said output stream with a corresponding one of the decoders, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M<K pulses, and wherein each code vector is expresses as <d.sub.1, d.sub.2, . . . , d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU18## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by different ones of the decoders are distinct, and (ii) a delay detected by some of the decoders occurs at most once in the K intervals.
Claim 12
Dependent Claim 197 words
In combination, an optical communication path, a plurality of encoders and decoders, each of the encoders comprising a source of light pulses, means responsive to an input binary stream partitioned into frames for enabling said source to generate light pulses in correspondence to components of a code vector from a bistate orthogonal code, and means, coupled to said means for enabling, for propagating said pulses as a rate-increased output stream onto said path, and means for synchronizing said encoders and decoders to detect said output stream with a corresponding one of the decoders, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M<K pulses, and wherein each code vector is expresses as <d.sub.1, d.sub.2, . . . , d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU18## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by different ones of the decoders are distinct, and (ii) a delay detected by some of the decoders occurs at most once in the K intervals.
Claim 13
Dependent Claim 253 words
Circuitry comprising decoders for decoding a rate-increased data stream partitioned into frames propagating over a communication path, the stream formed in each of a plurality of encoders by associating a code vector from a bistate orthogonal code with each binary one in an input data stream and by transmitting a series of pulses during intervals determined by the code for each binary one in the input stream, said circuitry CHARACTERIZED BY means for synchronizing the decoders and the encoders, means associated with each of the decoders, in energy transfer relation to the path at the detection points corresponding to the distribution of components of the code vector, for sensing on the path an array of sensed signals, and means, coupled to said means for sensing, for processing said sensed signals and for providing a decoded signal whenever a series of pulses corrsponding to the code vector propagates along the path, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M<K puses, and wherein each code vector is expresses as <d.sub.1, d.sub.2, . . . d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU19## said vector selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by differenct ones of the decoders are distinct, and (ii) a delay detected by some of the decoders occurs at most once in the K intervals.
Claim 14
Dependent Claim 253 words
Circuitry comprising decoders for decoding a rate-increased data stream partitioned into frames propagating over a communication path, the stream formed in each of a plurality of encoders by associating a code vector from a bistate orthogonal code with each binary one in an input data stream and by transmitting a series of pulses during intervals determined by the code for each binary one in the input stream, said circuitry CHARACTERIZED BY means for synchronizing the decoders and the encoders, means associated with each of the decoders, in energy transfer relation to the path at the detection points corresponding to the distribution of components of the code vector, for sensing on the path an array of sensed signals, and means, coupled to said means for sensing, for processing said sensed signals and for providing a decoded signal whenever a series of pulses corrsponding to the code vector propagates along the path, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M<K puses, and wherein each code vector is expresses as <d.sub.1, d.sub.2, . . . d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU19## said vector selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by differenct ones of the decoders are distinct, and (ii) a delay detected by some of the decoders occurs at most once in the K intervals.
Claim 15
Independent Claim 181 words
A system for transmitting information from a plurality of synchronized electrical sources to a plurality of synchronized receivers over a common optical channel, said system comprising an electrooptical encoder connected to each of said sources, each of said encoders comprising means for generating a unique pattern of rate-increased optical pulses partitioned into frames for each corresponding electrical pulse from its connected electrical source, said unique pattern selected in correspondence to one code vector of a bistte orthogonal code, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M<K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU20## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by different ones of the receivers are distinct, and (ii) a delay detected by some of the receivers occurs at most once in the K intervals.
Claim 16
Independent Claim 181 words
A system for transmitting information from a plurality of synchronized electrical sources to a plurality of synchronized receivers over a common optical channel, said system comprising an electrooptical encoder connected to each of said sources, each of said encoders comprising means for generating a unique pattern of rate-increased optical pulses partitioned into frames for each corresponding electrical pulse from its connected electrical source, said unique pattern selected in correspondence to one code vector of a bistte orthogonal code, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M<K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU20## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by different ones of the receivers are distinct, and (ii) a delay detected by some of the receivers occurs at most once in the K intervals.
Claim 17
Dependent Claim 193 words
In a binary communication system having a plurality of autonomous encoders and decoders connected to a common channel, a method comprising the steps of associating a unique decoder and a code vector from a bistate orthogonal code pattern with each encoder and configuring each decoder according to the code vector of its associated encoder, synchronizing the encoders and decoders, and for each binary one input to each encoder, propagating over the channel a rate-increased data stream partitioned into frames as determined by the code vector associated with the encoder, wherein each of the frames is subdivided into K chip intervals and said code comprises vectors having M<K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . , d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU21## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by different ones of the decoders are distinct , and (ii) a delay detected by some of the decoders occurs at most once in the K intervals.
Claim 18
Dependent Claim 193 words
In a binary communication system having a plurality of autonomous encoders and decoders connected to a common channel, a method comprising the steps of associating a unique decoder and a code vector from a bistate orthogonal code pattern with each encoder and configuring each decoder according to the code vector of its associated encoder, synchronizing the encoders and decoders, and for each binary one input to each encoder, propagating over the channel a rate-increased data stream partitioned into frames as determined by the code vector associated with the encoder, wherein each of the frames is subdivided into K chip intervals and said code comprises vectors having M<K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . , d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU21## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by different ones of the decoders are distinct , and (ii) a delay detected by some of the decoders occurs at most once in the K intervals.
Claim 19
Independent Claim 249 words
A method for decoding in each of a plurality of decoders a rate-increased data stream CHARACTERIZED BY THE STEPS OF forming the stream in each of a plurality of encoders by associating a code vector from a bistate orthogonal code with each binary one in an input data stream and by transmitting over a path interconnecting the encoders and decoders a series of pulses during intervals determined by the code vector for each binary one in the input stream, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M<K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU22## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by different ones of the decoders are distinct, and (ii) a delay detected by some of the decoders occurs at most once in the K intervals, synchronizing the encoders and decoders for rate-increased transmission, for each of the decoders, arranging a sensor array in energy transfer relation to the path at detection points determined by its associated code vector from the bistate orthogonal code, and processing the output of said sensor array to produce a decoder signal whenever a series of pulses corresponding to said associated code vector is propagating along the path.
Claim 20
Independent Claim 249 words
A method for decoding in each of a plurality of decoders a rate-increased data stream CHARACTERIZED BY THE STEPS OF forming the stream in each of a plurality of encoders by associating a code vector from a bistate orthogonal code with each binary one in an input data stream and by transmitting over a path interconnecting the encoders and decoders a series of pulses during intervals determined by the code vector for each binary one in the input stream, wherein each of the frames is subdivided into K chip intervals and said code comprises code vectors having M<K pulses, and wherein each code vector is expressed as <d.sub.1, d.sub.2, . . . d.sub.M > with d i equaling the delay between the i th and (i+1) st pulses for 1≦i≦M-1 and ##EQU22## said vectors selected so that, when superimposed and continuously processed over successive ones of the frames, exhibit the following two properties: (i) delays detected by different ones of the decoders are distinct, and (ii) a delay detected by some of the decoders occurs at most once in the K intervals, synchronizing the encoders and decoders for rate-increased transmission, for each of the decoders, arranging a sensor array in energy transfer relation to the path at detection points determined by its associated code vector from the bistate orthogonal code, and processing the output of said sensor array to produce a decoder signal whenever a series of pulses corresponding to said associated code vector is propagating along the path.
Claim 21
Dependent Claim 28 words
The method as recited in claim 11 wherein the step of processing includes the step of enabling said sensor array for preselected durations in correspondence to said frames.
Claim 22
Dependent Claim 33 words
The method as recited in claim 11 wherein the step of arranging a sensor array in energy transfer relation comprises the step of coupling energy detectors to the path at said detection points.
Claim 23
Dependent Claim 99 words
The method as recited in claim 11 wherein said path comprises a fiber optic cable, wherein the step of arranging a sensor array i energy transfer relation to the path includes the steps of tapping electro-optical energy from said cable at said detection points, and feeding said electro-optical energy to a photodetectpr arrangement to provide a received signal as said output of said sensor array, and wherein said step of processing includes the steps of threshold detecting said received signal to produce a threshold signal, and generating said decoded signal whenever said threshold signal is above a predetermined threshold.

References Cited (Backward Citations)

US3496546A Cited
US3715508A Cited
US3906348A Cited
US4281409A Cited
US4442550A Cited
US4426662A Cited
US4563774A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1991-10-18 1992-04-18 1992-10-18 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1995-10-18 1996-04-18 1996-10-18 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1999-10-18 2000-04-18 2000-10-18 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag