US6266331B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Device for generating multiple spreading sequences in reverse high speed data channels
Assignee: Nokia of America Corp
•
Filing: 1998-07-01
•
Granted: 2001-07-24
•
Expires: 2018-07-01
Abstract
Abstract The present invention discloses a device for generating multiple spreading sequences efficiently.In a preferred embodiment, the eight different spreading sequences are generated in parallel. In this embodiment, the spreading sequence generator comprises a master sequence generator and eight secondary sequence generators. The spreading sequence generator also comprises eight different modulo-2 adders which are used for generating parity check sum outputs.The master sequence generator is responsible for creating a master output from the first subgroup. The secondary sequence generators create eight different secondary outputs. Each of the secondary outputs is combined with the master output through one of the eight modulo-2 adders to create eight different spreading sequences.In an alternative embodiment, the principles of the present invention may be used to generate such spreading sequences in a sequential manner. Both embodiments provide efficiency and power savings over the prior art method and apparatus.
Inventors
- 👤 Thomas W. Baker
- 👤 Richard A. Cesari
- 👤 Xiao-an Wang
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 18:55
CPC Classifications
H; H04; H04J; H04J13/00; H04J13/10; H04B; H04B1/00; H04B1/69; H04B1/707
Claims Analysis
Total Claims: 57
Claim 1
Independent Claim
106 words
A method for generating multiple spreading sequences for a spread spectrum communication system, said system having multiple code channels for transmission of data, said method comprising the steps of: receiving multiple long codes, each long code associated with one of said multiple code channels and having a first subset of bits that are identical for each of said multiple long codes and having a second subset of bits that differ for each of said multiple long codes; and logically combining said first subset of long code bits with said second subset of long code bits to generate multiple spreading sequences for a spread spectrum communication system.
Claim 2
Independent Claim
106 words
A method for generating multiple spreading sequences for a spread spectrum communication system, said system having multiple code channels for transmission of data, said method comprising the steps of: receiving multiple long codes, each long code associated with one of said multiple code channels and having a first subset of bits that are identical for each of said multiple long codes and having a second subset of bits that differ for each of said multiple long codes; and logically combining said first subset of long code bits with said second subset of long code bits to generate multiple spreading sequences for a spread spectrum communication system.
Claim 3
Independent Claim
174 words
A method for generating multiple spreading sequences for a spread spectrum communication system, said system having simultaneous transmission of multiple code channels, each code channel having a code channel index number, said method comprising the steps of: receiving multiple long codes wherein each long code is associated with one of said code channels, and wherein each said long code comprises multiple bits and multiple states; selecting a first subgroup of bits and states comprising bits and states that are identical to each of said long codes; selecting a second subgroup of bits and states for comprising bits and states that are unique to each of said code long codes; logically combining said bits with said states of said first subgroup to generate a first output; logically combining said bits of said second subgroup with said corresponding code channel index number to generate a second output; logically combining said states of said second subgroup with said second output to generate a third output; logically combining said first and third outputs to generate a spreading sequence.
Claim 4
Independent Claim
174 words
A method for generating multiple spreading sequences for a spread spectrum communication system, said system having simultaneous transmission of multiple code channels, each code channel having a code channel index number, said method comprising the steps of: receiving multiple long codes wherein each long code is associated with one of said code channels, and wherein each said long code comprises multiple bits and multiple states; selecting a first subgroup of bits and states comprising bits and states that are identical to each of said long codes; selecting a second subgroup of bits and states for comprising bits and states that are unique to each of said code long codes; logically combining said bits with said states of said first subgroup to generate a first output; logically combining said bits of said second subgroup with said corresponding code channel index number to generate a second output; logically combining said states of said second subgroup with said second output to generate a third output; logically combining said first and third outputs to generate a spreading sequence.
Claim 5
Dependent Claim
26 words
The method of claim 2 , wherein said step of combining said first and third output is performed eight times to generate eight different spreading sequences.
Claim 6
Dependent Claim
28 words
The method of claim 2 , wherein said step of combining said first and third outputs is repeated eight times in parallel to generate eight different spreading sequences.
Claim 7
Dependent Claim
27 words
The method of claim 2 , wherein said step of logically combining said first and third outputs comprises modulo-2 adding said first output and said third output.
Claim 8
Dependent Claim
27 words
The method of claim 2 , wherein said step of logically combining said bits and states of said first subgroup comprises ANDing said bits and said states.
Claim 9
Dependent Claim
32 words
The method of claim 2 , wherein said step of logically combining said bits of said second subgroup with said code channel index number comprises XORing said bits of said second subgroup.
Claim 10
Dependent Claim
30 words
The method of claim 2 , wherein said step of logically combining said states of said second subgroup with said second output comprises ANDing said states with said second output.
Claim 11
Dependent Claim
24 words
The method of claim 2 , wherein said step of logically combining said first and third outputs comprises ANDing said first and third outputs.
Claim 12
Independent Claim
115 words
A device for generating multiple spreading sequences for a spread spectrum communication system, said system providing simultaneous transmission of multiple code channels, each of said code channels having a code channel index number and having a long code comprising multiple bits and multiple states, said device comprising: a first sequence generator for generating a,first output by logically combining the bits and states that are identical to each of said long codes; a second sequence generator for generating a second output by logically combining the states and bits that are unique to each of said long codes; and a first modulo-2 adder for logically combining said first and said second outputs to generate said spreading sequence.
Claim 13
Independent Claim
115 words
A device for generating multiple spreading sequences for a spread spectrum communication system, said system providing simultaneous transmission of multiple code channels, each of said code channels having a code channel index number and having a long code comprising multiple bits and multiple states, said device comprising: a first sequence generator for generating a,first output by logically combining the bits and states that are identical to each of said long codes; a second sequence generator for generating a second output by logically combining the states and bits that are unique to each of said long codes; and a first modulo-2 adder for logically combining said first and said second outputs to generate said spreading sequence.
Claim 14
Dependent Claim
59 words
The device of claim 10 , wherein said first sequence generator further comprises a first long code state generator to generate a first state output comprising multiple states that are identical to each of said long codes, and a first mask register to generate a first mask comprising multiple bits that are identical to each of said long codes.
Claim 15
Dependent Claim
34 words
The device of claim 11 , wherein said first sequence generator further comprises an first AND operator to combine said first state output and said first mask and to generate a first AND output.
Claim 16
Dependent Claim
28 words
The device of claim 12 , wherein said first sequence generator further comprises a second modulo-2 adder to receive said AND output and to generate said first output.
Claim 17
Dependent Claim
54 words
The device of claim 10 , wherein said second sequence generator further comprises a second long code generator to generate a second state output comprising multiple states that are unique to each of said long codes, and a second mask register to generate masking bits that are unique to each of said long codes.
Claim 18
Dependent Claim
29 words
The device of claim 14 wherein said second sequence generator further comprises a code channel register to generates said code channel index number associated with each said code channel.
Claim 19
Dependent Claim
33 words
The device of claim 15 , wherein said second sequence generator further comprises an XOR operator to combine said masking bits and said code channel index number and to generate a second mask.
Claim 20
Dependent Claim
33 words
The device of claim 16 , wherein said second sequence generator further comprises a second AND operator to combine said second state output and said second mask and to generate a second output.
Claim 21
Dependent Claim
22 words
The device of claim 10 , wherein said first modulo-2 adder comprises a plurality of modulo-2 adders to handle the multiple combinations.
Claim 22
Independent Claim
122 words
A device for generating eight spreading sequences for a spread spectrum communication system, said system providing simultaneous transmission of eight code channels, each of said code channels having a code channel index number and having a long code comprising forty-two bits and forty-two states, said device comprising: a master sequence generator for generating a master output by logically combining thirty-nine bits and thirty-nine states that are identical to each of said long codes; eight secondary sequence generators for generating eight secondary outputs by logically combining three states and three bits that are unique to each of said long codes; and eight modulo-2 adders for logically combining said master output with each of said eight secondary outputs and generating said eight spreading sequences.
Claim 23
Independent Claim
122 words
A device for generating eight spreading sequences for a spread spectrum communication system, said system providing simultaneous transmission of eight code channels, each of said code channels having a code channel index number and having a long code comprising forty-two bits and forty-two states, said device comprising: a master sequence generator for generating a master output by logically combining thirty-nine bits and thirty-nine states that are identical to each of said long codes; eight secondary sequence generators for generating eight secondary outputs by logically combining three states and three bits that are unique to each of said long codes; and eight modulo-2 adders for logically combining said master output with each of said eight secondary outputs and generating said eight spreading sequences.
Claim 24
Dependent Claim
58 words
The device of claim 19 , wherein said master sequence generator further comprises a long code state generator to generate a first state output comprising said thirty-nine states that are identical to each of said long codes, and a mask register to generates a first mask comprising thirty-nine bits that are identical to each of said long codes.
Claim 25
Dependent Claim
33 words
The device of claim 20 , wherein said master sequence generator further comprises a first AND operator to combine said state output and said m ask, and to generate said first AND output.
Claim 26
Dependent Claim
29 words
The device of claim 21 , wherein said master sequence generator further comprises a master modulo-2 adder to receive said first AND output and to generate said master output.
Claim 27
Dependent Claim
55 words
The device of claim 19 , wherein said secondary sequence generator further comprises a second long code generator to generate a second state output comprising said three states that are unique to each of said long codes, and a second mask register to generate masking bits that are unique to each of said long codes.
Claim 28
Dependent Claim
31 words
The device of claim 23 , wherein said secondary sequence generator further comprises a cod e channel register to generates said code channel index number associated with each said code channel.
Claim 29
Dependent Claim
33 words
The device of claim 24 , wherein said secondary sequence generator further comprises an XOR operator to combine said masking bits and said code channel index number and to generate a second mask.
Claim 30
Dependent Claim
33 words
The device of claim 25 , wherein said secondary sequence generator further comprises a second AND operator to combine said second state output and said second mask and to generate a secondary output.
Claim 31
Dependent Claim
13 words
The device of claim 25 wherein said XOR operator comprises three XOR gates.
Claim 32
Dependent Claim
14 words
The device of claim 26 wherein said second AND operator comprises three AND gates.
Claim 33
Independent Claim
197 words
A method for generating eight spreading sequences for a spread spectrum communication system, said system providing simultaneous transmission of eight code channels, each code channel having a code channel index number, said method comprising: (i) receiving eight long codes wherein each long code is associated with one of said code channels, and wherein each said long code comprises forty-two bits and forty-two states; (ii) creating a first subgroup comprising thirty-nine bits and thirty-nine states identical to each of said long codes; (iii) creating a second subgroup comprising three bits and three states which are unique to each of said code long codes; (iv) logically combining said thirty-nine bits of said first subgroup with said thirty-nine s tates of said first subgroup to generate a master output; (v) logically combining said three bits of said second subgroup with said co responding code channel index number to generate a mask; (vi) logically combining said three states of said second subgroup with said mask to generate a secondary output; (vii) repeating step(v) and step (vi) eight times to generate eight different secondary outputs; (viii) logically combining said master output with each of secondary outputs to generate eight different spreading sequences.
Claim 34
Independent Claim
197 words
A method for generating eight spreading sequences for a spread spectrum communication system, said system providing simultaneous transmission of eight code channels, each code channel having a code channel index number, said method comprising: (i) receiving eight long codes wherein each long code is associated with one of said code channels, and wherein each said long code comprises forty-two bits and forty-two states; (ii) creating a first subgroup comprising thirty-nine bits and thirty-nine states identical to each of said long codes; (iii) creating a second subgroup comprising three bits and three states which are unique to each of said code long codes; (iv) logically combining said thirty-nine bits of said first subgroup with said thirty-nine s tates of said first subgroup to generate a master output; (v) logically combining said three bits of said second subgroup with said co responding code channel index number to generate a mask; (vi) logically combining said three states of said second subgroup with said mask to generate a secondary output; (vii) repeating step(v) and step (vi) eight times to generate eight different secondary outputs; (viii) logically combining said master output with each of secondary outputs to generate eight different spreading sequences.
Claim 35
Dependent Claim
21 words
The method of claim 29 , wherein step (vii) comprises repeating step (v) and step(vi) eight times in a sequential manner.
Claim 36
Dependent Claim
20 words
The method of claim 30 , wherein step (vii) comprises repeating step (v) and step (vi) eight times in parallel.
Claim 37
Dependent Claim
120 words
An integrated circuit including a device for generating multiple spreading sequences for a spread spectrum communication system, said system providing simultaneous transmission of multiple code channels, each of said code channels having a code channel index number and having a long code comprising multiple bits and multiple states, said device comprising: a first sequence generator for generating a first output by logically combining the bits and states that are identical to each of said long codes; a second sequence generator for generating a second output by logically combining the states and bits that are unique to each of said long codes; and a first modulo-2 adder for logically combining said first and said second outputs to generate said spreading sequence.
Claim 38
Dependent Claim
120 words
An integrated circuit including a device for generating multiple spreading sequences for a spread spectrum communication system, said system providing simultaneous transmission of multiple code channels, each of said code channels having a code channel index number and having a long code comprising multiple bits and multiple states, said device comprising: a first sequence generator for generating a first output by logically combining the bits and states that are identical to each of said long codes; a second sequence generator for generating a second output by logically combining the states and bits that are unique to each of said long codes; and a first modulo-2 adder for logically combining said first and said second outputs to generate said spreading sequence.
Claim 39
Dependent Claim
60 words
The integrated circuit of claim 32 , wherein said first sequence generator further comprises a first long code state generator to generate a first state output comprising multiple states that are identical to each of said long codes, and a first mask register to generate a first mask comprising multiple bits that are identical to each of said long codes.
Claim 40
Dependent Claim
35 words
The integrated circuit of claim 33 , wherein said first sequence generator further comprises an first AND operator to combine said first state output and said first mask and to generate a first AND output.
Claim 41
Dependent Claim
29 words
The integrated circuit of claim 34 , wherein said first sequence generator further comprises a second modulo-2 adder to receive said AND output and to generate said first output.
Claim 42
Dependent Claim
55 words
The integrated circuit of claim 32 , wherein said second sequence generator further comprises a second long code generator to generate a second state output comprising multiple states that are unique to each of said long codes, and a second mask register to generate masking bits that are unique to each of said long codes.
Claim 43
Dependent Claim
31 words
The integrated circuit of claim 36 , wherein said second sequence generator further comprises a code channel register to generates said code channel index number associated with each said code channel.
Claim 44
Dependent Claim
34 words
The integrated circuit of claim 37 , wherein said second sequence generator further comprises an XOR operator to combine said masking bits and said code channel index number and to generate a second mask.
Claim 45
Dependent Claim
34 words
The integrated circuit of claim 38 , wherein said second sequence generator further comprises a second AND operator to combine said second state output and said second mask and to generate a second output.
Claim 46
Dependent Claim
23 words
The integrated circuit of claim 39 , wherein said first modulo-2 adder comprises a plurality of modulo-2 adders to handle the multiple combinations.
Claim 47
Dependent Claim
126 words
An integrated circuit including a device for generating eight spreading sequences for a spread spectrum communication system, said system providing simultaneous transmission of eight code channels, each of said code channels having a code channel index number and having a long code comprising forty-two bits and forty-two states, said device comprising: a master sequence generator for generating a master output by logically combining thirty-nine bits and thirty-nine states that are identical to each of said long codes; eight secondary sequence generators for generating eight secondary outputs by logically combining three states and three bits that are unique to each of said long codes; and eight modulo-2 adders for logically combining said master output with each of said eight secondary outputs and generating said eight spreading sequences.
Claim 48
Dependent Claim
126 words
An integrated circuit including a device for generating eight spreading sequences for a spread spectrum communication system, said system providing simultaneous transmission of eight code channels, each of said code channels having a code channel index number and having a long code comprising forty-two bits and forty-two states, said device comprising: a master sequence generator for generating a master output by logically combining thirty-nine bits and thirty-nine states that are identical to each of said long codes; eight secondary sequence generators for generating eight secondary outputs by logically combining three states and three bits that are unique to each of said long codes; and eight modulo-2 adders for logically combining said master output with each of said eight secondary outputs and generating said eight spreading sequences.
Claim 49
Dependent Claim
59 words
The integrated circuit of claim 41 , wherein said master sequence generator further comprises a long code state generator to generate a first state output comprising said thirty-nine states that are identical to each of said long codes, and a mask register to generates a first mask comprising thirty-nine bits that are identical to each of said long codes.
Claim 50
Dependent Claim
33 words
The integrated circuit of claim 42 , wherein said master sequence generator further comprises a first AND operator to combine said state output and said mask, and to generate said first AND output.
Claim 51
Dependent Claim
30 words
The integrated circuit of claim 43 , wherein said master sequence generator further comprises a master modulo-2 adder to receive said first AND output and to generate said master output.
Claim 52
Dependent Claim
56 words
The integrated circuit of claim 41 , wherein said secondary sequence generator further comprises a second long code generator to generate a second state output comprising said three states that are unique to each of said long codes, and a second mask register to generate masking bits that are unique to each of said long codes.
Claim 53
Dependent Claim
31 words
The integrated circuit of claim 45 , wherein said secondary sequence generator further comprises a code channel register to generates said code channel index number associated with each said code channel.
Claim 54
Dependent Claim
34 words
The integrated circuit of claim 46 , wherein said secondary sequence generator further comprises an XOR operator to combine said masking bits and said code channel index number and to generate a second mask.
Claim 55
Dependent Claim
34 words
The integrated circuit of claim 47 , wherein said secondary sequence generator further comprises a second AND operator to combine said second state output and said second mask and to generate a secondary output.
Claim 56
Dependent Claim
14 words
The integrated circuit of claim 47 wherein said XOR operator comprises three XOR gates.
Claim 57
Dependent Claim
15 words
The integrated circuit of claim 48 wherein said second AND operator comprises three AND gates.
References Cited (Backward Citations)
US5444648A
Cited
US5434807A
Cited
US5559829A
Cited
US5574673A
Cited
US5438622A
Cited
US5631922A
Cited
US5835488A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-07-23 | 2005-01-22 | 2005-07-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-07-23 | 2009-01-22 | 2009-07-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-07-23 | 2013-01-22 | 2013-07-24 | $7700.00 | Window Closed / Lapsed |