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

Multiple-signal spread-spectrum transceiver

Assignee: Lockheed Martin Corp
•
Filing: 1991-09-27
•
Granted: 1993-05-11
•
Expires: 2011-09-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for communication in a spread spectrum network are disclosed. Blocks of bits embodying information are assigned to corresponding subsets of binary spreading code sequences and at least one of the subsets of binary spreading code sequences contains more than one binary spreading code sequence. Selected subsets of the binary spreading code sequences are then simultaneously transmitted from a transmitting node to a receiving node.

Inventors

  • 👤 Bart F. Rice

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 10:01
CPC Classifications
H; H04; H04J; H04J13/00; H04J13/0074; H04B; H04B1/00; H04B1/69; H04B1/707; H04B1/7073; H04B1/7075; H04J13/10; H04J13/102; H04J13/0077; H04J13/16

Claims Analysis

Total Claims: 49
Claim 1
Independent Claim 84 words
A method for communicating information between a transmitting node and a receiving node of a multi-node communication network, said method comprising: a) assigning blocks of bits embodying said information to corresponding subsets of a set of binary spreading-code sequences, at least one of said subsets of said set of binary spreading-code sequences containing more than one of said binary spreading-code sequences; and b) transmitting simultaneous signals containing selected subsets of said set of binary spreading-code sequences from said transmitting node to said receiving node.
Claim 2
Independent Claim 84 words
A method for communicating information between a transmitting node and a receiving node of a multi-node communication network, said method comprising: a) assigning blocks of bits embodying said information to corresponding subsets of a set of binary spreading-code sequences, at least one of said subsets of said set of binary spreading-code sequences containing more than one of said binary spreading-code sequences; and b) transmitting simultaneous signals containing selected subsets of said set of binary spreading-code sequences from said transmitting node to said receiving node.
Claim 3
Dependent Claim 35 words
The method of claim 1 wherein said binary spreading-code sequences are generated by combining contents of specified stages of a first binary shift register with contents of specified stages of a second binary shift register.
Claim 4
Dependent Claim 20 words
The method of claim 1 wherein all of said blocks of bits embodying said information are of equal fixed length.
Claim 5
Dependent Claim 35 words
The method of claim 1 wherein one bit of each of said blocks of bits embodying said information determines a polarity at which the corresponding subset of said set of binary spreading-code sequences is transmitted.
Claim 6
Dependent Claim 46 words
The method of claim 1 wherein an additional bit of information is conveyed by transmitting the binary spreading-code sequences in each of said subsets of said set of binary spreading-code sequences with a polarity that is related to the polarity of said additional bit of information.
Claim 7
Dependent Claim 26 words
The method of claim 1 wherein each of said selected subsets of said set of binary spreading-code sequences comprises precisely two of said binary spreading-code sequences.
Claim 8
Dependent Claim 70 words
The method of claim 6 wherein the two binary sequences comprising each of said selected subsets are transmitted simultaneously by modulating a first one of said two binary sequences onto a first sinusoidal carrier, and by modulating a second one of said two binary sequences onto a second sinusoidal carrier, said first and second sinusoidal carriers being of the same frequency but out of phase with respect to each other.
Claim 9
Dependent Claim 23 words
The method of claim 7 wherein said first and second sinusoidal carriers are out of phase with respect to each other by 90°.
Claim 10
Dependent Claim 26 words
The method of claim 1 wherein each of said selected subsets of said set of binary spreading-code sequences comprises precisely three of said binary spreading-code sequences.
Claim 11
Dependent Claim 86 words
The method of claim 9 wherein the three binary sequences comprising each of said selected subsets are transmitted simultaneously by modulating a first one of said three binary sequences onto a first sinusoidal carrier, by modulating a second one of said three binary sequences onto a second sinusoidal carrier, and by modulating a third one of said three binary sequences onto a third sinusoidal carrier, said first, second and third sinusoidal carriers being of the same frequency but out of phase with respect to each other.
Claim 12
Dependent Claim 58 words
The method of claim 10 wherein said first and second sinusoidal carriers are out of phase with respect to each other by 60°, said second and third sinusoidal carriers are out of phase with respect to each other by 60°, and said first and third sinusoidal carriers are out of phase with respect to each other by 120°.
Claim 13
Dependent Claim 26 words
The method of claim 1 wherein each of said selected subsets of said set of binary spreading-code sequences comprises precisely four of said binary spreading-code sequences.
Claim 14
Dependent Claim 102 words
The method of claim 12 wherein the four binary sequences comprising each of said selected subsets are transmitted simultaneously by modulating a first one of said four binary sequences onto a first sinusoidal carrier, by modulating a second one of said four binary sequences onto a second sinusoidal carrier, by modulating a third one of said four binary sequences onto a third sinusoidal carrier, and by modulating a fourth one of said four binary sequences onto a fourth sinusoidal carrier, said first, second, third and fourth sinusoidal carriers being of the same frequency but out of phase with respect to each other.
Claim 15
Dependent Claim 109 words
The method of claim 13 wherein said first and second sinusoidal carriers are out of phase with respect to each other by 45°, said second and third sinusoidal carriers are out of phase with respect to each other by 45°, said third and fourth sinusoidal carriers are out of phase with respect to each other by 45°, said first and third sinusoidal carriers are out of phase with respect to each other by 90°, said second and fourth sinusoidal carriers are out of phase with respect to each other by 90°, and said first and fourth sinusoidal carriers are out of phase with respect to each other by 135°.
Claim 16
Dependent Claim 94 words
The method of claim 1 wherein: a) each of said subsets of said set of binary sequences received at said receiving node is correlated with each binary sequence of said set of binary sequences so as to produce a set of correlation outputs, each correlation output corresponding to a specified one of said binary sequences; and b) said set of correlation outputs is evaluated to identify a particular one of said subsets of said set of binary sequences as being most likely to have been transmitted from said transmitting node to said receiving node.
Claim 17
Dependent Claim 61 words
The method of claim 15 wherein said set of correlation outputs is evaluated according to a selection rule in which a particular one of said subsets for which a sum of the correlation outputs corresponding to said binary sequences is largest is identified as being the subset most likely to have been transmitted from said transmitting node to said receiving node.
Claim 18
Dependent Claim 122 words
The method of claim 15 wherein, when each one of said subsets of said set of binary sequences comprises the same number of binary sequences as every other one of said subsets, said set of correlation outputs is evaluated according to a selection rule in which a particular one of said subsets for which a ratio of the largest sum of the correlation outputs corresponding to a first one of said subsets of said binary sequences to the next-largest sum of the correlation outputs corresponding to a second one of said subsets of said binary sequences is greater than a predetermined threshold is identified as being the subset most likely to have been transmitted from said transmitting node to said receiving node.
Claim 19
Dependent Claim 30 words
The method of claim 17 wherein polarity of the subset identified as being most likely to have been transmitted from said transmitting node to said receiving node conveys additional information.
Claim 20
Dependent Claim 121 words
A communication network comprising a transmitting node and a receiving node, said transmitting node simultaneously transmitting signals containing individual spreading-code sequences in a designated first subset of a set of spreading-code sequences during a specified first time interval, and simultaneously transmitting signals containing individual spreading-code sequences in a designated second subset of said set of spreading-code sequences during a specified second time interval, each of said designated first and second subsets of said set of spreading-code sequences being selected from a plurality of subsets of said set of spreading-code sequences identified with one of said transmitting and receiving nodes, at least one of said designated first and second subsets of said set of spreading-code sequences containing more than one spreading-code sequence.
Claim 21
Dependent Claim 121 words
A communication network comprising a transmitting node and a receiving node, said transmitting node simultaneously transmitting signals containing individual spreading-code sequences in a designated first subset of a set of spreading-code sequences during a specified first time interval, and simultaneously transmitting signals containing individual spreading-code sequences in a designated second subset of said set of spreading-code sequences during a specified second time interval, each of said designated first and second subsets of said set of spreading-code sequences being selected from a plurality of subsets of said set of spreading-code sequences identified with one of said transmitting and receiving nodes, at least one of said designated first and second subsets of said set of spreading-code sequences containing more than one spreading-code sequence.
Claim 22
Dependent Claim 62 words
The communication network of claim 19 wherein each of said designated first and second subsets of said set of spreading-code sequences comprises more than one spreading-code sequence, said transmitting node comprising means for modulating the sequences of each of said designated first and second subsets of said set of spreading-code sequences onto corresponding carriers of the same frequency but of different phases.
Claim 23
Dependent Claim 58 words
The communication network of claim 20 wherein each of said designated first and second subsets of said set of spreading-code sequences consists of two sequences, said transmitting node comprising means for modulating the two sequences of each of said designated first and second subsets of said set of spreading-code sequences onto two corresponding carriers of the same frequency.
Claim 24
Dependent Claim 17 words
The communication network of claim 21 wherein said two corresponding carriers are out of phase by 90°.
Claim 25
Dependent Claim 58 words
The communication network of claim 20 wherein each of said designated first and second subsets of said set of spreading-code sequences consists of three sequences, said transmitting node comprising means for modulating the three sequences of each of said designated first and second subsets of said set of spreading-code sequences onto three corresponding carriers of the same frequency.
Claim 26
Dependent Claim 62 words
The communication network of claim 23 wherein a first one and a second one of said three corresponding carriers are out of phase by 60°, the second one and a third one of said three corresponding carriers are out of phase by 60°, and the first one and the third one of said three corresponding carriers are out of phase by 120°.
Claim 27
Dependent Claim 201 words
The communication network of claim 20 wherein each of said designated first and second subsets of said set of spreading-code sequences consists of three sequences, said transmitting node comprising means for combining the three sequences of each of said designated first and second subsets of said set of spreading-code sequences into two output sequences, and for modulating the two output sequences onto two corresponding carriers of the same frequency, said two corresponding carriers being out of phase by 90°, the combining of said three sequences of each of said designated first and second subsets of said set of spreading-code sequences into said two output sequences and the modulating of said two output sequences onto said two corresponding carriers being equivalent to modulating each of said three sequences of each of said designated first and second subsets of said set of spreading-code sequences onto three carriers of the same frequency, a first one and a second one of said three carriers being out of phase by 60°, the second one and a third one of said three carriers being out of phase by 60°, and the first one and the third one of said three carriers being out of phase by 120°.
Claim 28
Dependent Claim 58 words
The communication network of claim 20 wherein each of said designated first and second subsets of said set of spreading-code sequences consists of four sequences, said transmitting node comprising means for modulating the four sequences of each of said designated first and second subsets of said set of spreading-code sequences onto four corresponding carriers of the same frequency.
Claim 29
Dependent Claim 116 words
The communication network of claim 26 wherein a first one and a second one of said four corresponding carriers are out of phase by 45°, the second one and a third one of said four corresponding carriers are out of phase by 45°, the third one and a fourth one of said four corresponding carriers are out of phase by 45°, the first one and the third one of said four corresponding carriers are out of phase by 90°, the second one and the fourth one of said four corresponding carriers are out of phase by 90°, and the first one and the fourth one of said four corresponding carriers are out of phase by 135°.
Claim 30
Dependent Claim 252 words
The communication network of claim 20 wherein each of said designated first and second subsets of said set of spreading-code sequences consists of four sequences, said transmitting node comprising means for combining the four sequences of each of said designated first and second subsets of said set of spreading-code sequences into two output sequences, and for modulating the two output sequences onto two corresponding carriers of the same frequency, said two corresponding carriers being out of phase by 90°, the combining of said four sequences of each of said designated first and second subsets of said set of spreading-code sequences into said two output sequences and the modulating of said two output sequences onto said two corresponding carriers being equivalent to modulating each of said four sequences of each of said designated first and second subsets of said set of spreading-code sequences onto four carriers of the same frequency, a first one and a second one of said four carriers being out of phase by 45°, the second one and a third one of said four carriers being out of phase by 45°, the third one and a fourth one of said four carriers being out of phase by 45°, the first one and the third one of said four carriers being out of phase by 90°, the second one and the fourth one of said four carriers being out of phase by 90°, and the first one and the fourth one of said four carriers being out of phase by 135°.
Claim 31
Independent Claim 125 words
A method for communicating information between a transmitting node and a receiving node of a multi-node communication network, said method comprising: a) generating a set of binary spreading-code sequences by combining contents of specified stages of a first binary shift register with contents of specified stages of a second binary shift register, said set of binary spreading-code sequences containing more than one binary spreading-code sequence; b) assigning blocks of bits embodying said information to corresponding subsets of said set of binary spreading-code sequences, each of said subsets of said set of binary spreading-code sequences containing at least one of said binary spreading-code sequences; and c) transmitting signals containing selected subsets of said set of binary spreading-code sequences from said transmitting node to said receiving node.
Claim 32
Independent Claim 125 words
A method for communicating information between a transmitting node and a receiving node of a multi-node communication network, said method comprising: a) generating a set of binary spreading-code sequences by combining contents of specified stages of a first binary shift register with contents of specified stages of a second binary shift register, said set of binary spreading-code sequences containing more than one binary spreading-code sequence; b) assigning blocks of bits embodying said information to corresponding subsets of said set of binary spreading-code sequences, each of said subsets of said set of binary spreading-code sequences containing at least one of said binary spreading-code sequences; and c) transmitting signals containing selected subsets of said set of binary spreading-code sequences from said transmitting node to said receiving node.
Claim 33
Dependent Claim 20 words
The method of claim 29 wherein all of said blocks of bits embodying said information are of equal fixed length.
Claim 34
Dependent Claim 35 words
The method of claim 29 wherein one bit of each of said blocks of bits embodying said information determines a polarity at which the corresponding subset of said set of binary spreading-code sequences is transmitted.
Claim 35
Dependent Claim 46 words
The method of claim 29 wherein an additional bit of information is conveyed by transmitting the binary spreading-code sequences in each of said subsets of said set of binary spreading-code sequences with a polarity that is related to the polarity of said additional bit of information.
Claim 36
Dependent Claim 22 words
The method of claim 29 wherein each of said selected subsets of said set of binary sequences comprises precisely one binary sequence.
Claim 37
Dependent Claim 24 words
The method of claim 29 wherein each of said selected subsets of said set of binary sequences comprises precisely two of said binary sequences.
Claim 38
Dependent Claim 70 words
The method of claim 34 wherein the two binary sequences comprising each of said selected subsets are transmitted simultaneously by modulating a first one of said two binary sequences onto a first sinusoidal carrier, and by modulating a second one of said two binary sequences onto a second sinusoidal carrier, said first and second sinusoidal carriers being of the same frequency but out of phase with respect to each other.
Claim 39
Dependent Claim 23 words
The method of claim 35 wherein said first and second sinusoidal carriers are out of phase with respect to each other by 90°.
Claim 40
Dependent Claim 24 words
The method of claim 29 wherein each of said selected subsets of said set of binary sequences comprises precisely three of said binary sequences.
Claim 41
Dependent Claim 86 words
The method of claim 37 wherein the three binary sequences comprising each of said selected subsets are transmitted simultaneously by modulating a first one of said three binary sequences onto a first sinusoidal carrier, by modulating a second one of said three binary sequences onto a second sinusoidal carrier, and by modulating a third one of said three binary sequences onto a third sinusoidal carrier, said first, second and third sinusoidal carriers being of the same frequency but out of phase with respect to each other.
Claim 42
Dependent Claim 58 words
The method of claim 38 wherein said first and second sinusoidal carriers are out of phase with respect to each other by 60°, said second and third sinusoidal carriers are out of phase with respect to each other by 60°, and said first and third sinusoidal carriers are out of phase with respect to each other by 120°.
Claim 43
Dependent Claim 24 words
The method of claim 29 wherein each of said selected subsets of said set of binary sequences comprises precisely four of said binary sequences.
Claim 44
Dependent Claim 102 words
The method of claim 40 wherein the four binary sequences comprising each of said selected subsets are transmitted simultaneously by modulating a first one of said four binary sequences onto a first sinusoidal carrier, by modulating a second one of said four binary sequences onto a second sinusoidal carrier, by modulating a third one of said four binary sequences onto a third sinusoidal carrier, and by modulating a fourth one of said four binary sequences onto a fourth sinusoidal carrier, said first, second, third and fourth sinusoidal carriers being of the same frequency but out of phase with respect to each other.
Claim 45
Dependent Claim 109 words
The method of claim 41 wherein said first and second sinusoidal carriers are out of phase with respect to each other by 45°, said second and third sinusoidal carriers are out of phase with respect to each other by 45°, said third and fourth sinusoidal carriers are out of phase with respect to each other by 45°, said first and third sinusoidal carriers are out of phase with respect to each other by 90°, said second and fourth sinusoidal carriers are out of phase with respect to each other by 90°, and said first and fourth sinusoidal carriers are out of phase with respect to each other by 135°.
Claim 46
Dependent Claim 111 words
The method of claim 29 wherein, when at least one subset of said set of binary spreading-code sequences comprises more than one sequence: a) each of said subsets of said set of binary sequences received at said receiving node is correlated with each binary sequence of said set of binary sequences so as to produce a set of correlation outputs, each correlation output corresponding to a specified one of said binary sequences; and b) said set of correlation outputs is evaluated to identify a particular one of said subsets of said set of binary sequences as being most likely to have been transmitted from said transmitting node to said receiving node.
Claim 47
Dependent Claim 87 words
The method of claim 43 wherein, when each one of said subsets of said set of binary sequences comprises the same number of binary sequences as every other one of said subsets, said set of correlation outputs is evaluated according to a selection rule in which a particular one of said subsets for which a sum of the correlation outputs corresponding to said binary sequences is largest is identified as being the subset most likely to have been transmitted from said transmitting node to said receiving node.
Claim 48
Dependent Claim 96 words
The method of claim 43 wherein said set of correlation outputs is evaluated according to a selection rule in which a particular one of said subsets for which a ratio of the largest sum of the correlation outputs corresponding to a first one of said subsets of said binary sequences to the next-largest sum of the correlation outputs corresponding to a second one of said subsets of said binary sequences is greater than a predetermined threshold is identified as being the subset most likely to have been transmitted from said transmitting node to said receiving node.
Claim 49
Dependent Claim 30 words
The method of claim 45 wherein polarity of the subset identified as being most likely to have been transmitted from said transmitting node to said receiving node conveys additional information.

References Cited (Backward Citations)

US4730340A Cited
US4872200A Cited
US4984247A Cited
US5029180A Cited
US5031173A Cited
US5084900A Cited
US5063571A Cited
US5099493A Cited
US5111478A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-05-10 1996-11-09 1997-05-11 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-05-10 2000-11-09 2001-05-11 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-05-10 2004-11-09 2005-05-11 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag