Patent US6452959B1 successfully refreshed from Google Patents.
US6452959B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of and apparatus for generating data sequences for use in communications
Assignee: Philips Semiconductors Inc
•
Filing: 1999-05-28
•
Granted: 2002-09-17
•
Expires: 2019-05-28
Abstract
Abstract A method of generating one or more pseudorandom noise (PN) sequences for use in spread spectrum communications includes the steps of providing data at an input of memory which stores bits associated with a pseudorandom noise (PN) sequence: changing the data; and for each of a plurality of changes of the data, providing a selected PN bit of the PN sequence at an output of the memory based on the data.
Inventors
- 👤 John G. McDonough
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 23:52
CPC Classifications
H; H04; H04J; H04J13/00; H04J13/0007; H04J13/0022; H04B; H04B1/00; H04B1/69; H04B1/707; H04J13/10
Claims Analysis
Total Claims: 29
Claim 1
Independent Claim
130 words
A data sequence generator suitable for use in spread spectrum communications, comprising: memory; data stored in said memory; the data including a pseudorandom noise (PN) sequence defined as having a length of L; a counter; the counter for use in repeatedly providing L discrete address values to said memory; and an output from said memory to provide selected PN data of the PN sequence responsive to each value of the L discrete address values; the PN sequence being a first PN sequence; the data stored in said memory including a second PN sequence; the first PN sequence being different from the second PN sequence; the first and second PN sequences being stored sequentially; and the first and the second PN sequences being stored in parallel with respect to each other.
Claim 2
Dependent Claim
130 words
A data sequence generator suitable for use in spread spectrum communications, comprising: memory; data stored in said memory; the data including a pseudorandom noise (PN) sequence defined as having a length of L; a counter; the counter for use in repeatedly providing L discrete address values to said memory; and an output from said memory to provide selected PN data of the PN sequence responsive to each value of the L discrete address values; the PN sequence being a first PN sequence; the data stored in said memory including a second PN sequence; the first PN sequence being different from the second PN sequence; the first and second PN sequences being stored sequentially; and the first and the second PN sequences being stored in parallel with respect to each other.
Claim 3
Dependent Claim
48 words
The data sequence generator according to claim 1 , further comprising: an output from said counter coupled to an input of said memory; and an output from said memory to provide selected data of both the first and the second PN sequences based on data at said input.
Claim 4
Independent Claim
164 words
A method of generating one or more data sequences for a spread spectrum receiver, the method comprising: providing counter data at an input to a memory which stores a PN sequence having a length L; repeatedly changing the counter data to provide L discrete values at the input to said memory; and for each value of the L discrete values at the input, providing a selected PN bit of the PN sequence at an output from said memory based on the counter data at said input; wherein the PN sequence is a first PN sequence, the memory stores bits associated with a second PN sequence, bits of the first and second PN sequences are stored sequentially and in parallel with respect to each other, and the method further comprises: for each value of the L discrete values at the input, providing a selected PN bit of the second PN sequence at an output from said memory based on the counter data at said input.
Claim 5
Independent Claim
164 words
A method of generating one or more data sequences for a spread spectrum receiver, the method comprising: providing counter data at an input to a memory which stores a PN sequence having a length L; repeatedly changing the counter data to provide L discrete values at the input to said memory; and for each value of the L discrete values at the input, providing a selected PN bit of the PN sequence at an output from said memory based on the counter data at said input; wherein the PN sequence is a first PN sequence, the memory stores bits associated with a second PN sequence, bits of the first and second PN sequences are stored sequentially and in parallel with respect to each other, and the method further comprises: for each value of the L discrete values at the input, providing a selected PN bit of the second PN sequence at an output from said memory based on the counter data at said input.
Claim 6
Dependent Claim
31 words
The method according to claim 3 , wherein changing the counter data further comprises: changing the value of the counter data in the sequential manner in which the bits are stored.
Claim 7
Dependent Claim
23 words
The method according to claim 3 , wherein changing the counter data further comprises: incrementing the value of the counter data by one.
Claim 8
Dependent Claim
119 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence having a length of L, wherein the PN sequence is based on: P ( X ) =X 15 +X 13 X 9 +X 8 +X 7 +X 5 +1; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; and an output from said memory to provide PN data of the PN sequence for each count value from zero to L−1.
Claim 9
Dependent Claim
119 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence having a length of L, wherein the PN sequence is based on: P ( X ) =X 15 +X 13 X 9 +X 8 +X 7 +X 5 +1; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; and an output from said memory to provide PN data of the PN sequence for each count value from zero to L−1.
Claim 10
Dependent Claim
21 words
The communication device according to claim 6 , wherein the number of bits of the PN sequence is 2 15 −1.
Claim 11
Dependent Claim
21 words
The communication device according to claim 6 , wherein the number of bits of the PN sequence is 2 15 .
Claim 12
Dependent Claim
21 words
The communication device according to claim 6 , wherein the number of bits of the PN sequence is 3×2 15 .
Claim 13
Dependent Claim
38 words
The communication device according to claim 6 , further comprising: an adder; an input of said adder coupled to said output of said binary counter; and an output of said adder coupled to said input of said memory.
Claim 14
Dependent Claim
124 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence sequence having a length of L, wherein the PN sequence is based on: P ( X )= X 15 +X 12 +X 11 +X 10 +X 5 +X 5 +X 4 +X 3 +1; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; and an output from said memory to provide PN data of the PN sequence for each count value from zero to L−1.
Claim 15
Dependent Claim
124 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence sequence having a length of L, wherein the PN sequence is based on: P ( X )= X 15 +X 12 +X 11 +X 10 +X 5 +X 5 +X 4 +X 3 +1; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; and an output from said memory to provide PN data of the PN sequence for each count value from zero to L−1.
Claim 16
Dependent Claim
116 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence sequence having a length of L wherein the PN sequence is based on: P ( X ) =X 20 +X 9 +X 5 +X 3 +1; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; and an output from said memory to provide PN data of the PN sequence for each count value from zero to L−1.
Claim 17
Dependent Claim
116 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence sequence having a length of L wherein the PN sequence is based on: P ( X ) =X 20 +X 9 +X 5 +X 3 +1; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; and an output from said memory to provide PN data of the PN sequence for each count value from zero to L−1.
Claim 18
Dependent Claim
160 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence having a length of L, the PN sequence comprising a first PN sequence based on P(x)=X 15 +X 13 +X 9 +X 8 X 7 +X 5 +1; the data further comprising a second PN sequence based on P(X)=X 15 +X 12 +X 11 +X 10 +X 5 +X 5 +X 4 +X 3 +1; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; and an output from said memory to provide PN data of the PN sequence for each count value from zero to L; and the output from said memory providing both the first and the second PN sequences.
Claim 19
Dependent Claim
160 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence having a length of L, the PN sequence comprising a first PN sequence based on P(x)=X 15 +X 13 +X 9 +X 8 X 7 +X 5 +1; the data further comprising a second PN sequence based on P(X)=X 15 +X 12 +X 11 +X 10 +X 5 +X 5 +X 4 +X 3 +1; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; and an output from said memory to provide PN data of the PN sequence for each count value from zero to L; and the output from said memory providing both the first and the second PN sequences.
Claim 20
Dependent Claim
114 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence having a length of L, the PN sequence comprising a first PN sequence based on P(X)=X 20 +X 9 +X 5 +X 3 +1; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; and an output from said memory to provide PN data of the PN sequence for each count value from zero to L.
Claim 21
Dependent Claim
114 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence having a length of L, the PN sequence comprising a first PN sequence based on P(X)=X 20 +X 9 +X 5 +X 3 +1; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; and an output from said memory to provide PN data of the PN sequence for each count value from zero to L.
Claim 22
Dependent Claim
165 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence having a length of L, the PN sequence comprising a first PN sequence based on P(X)=X 15 +X 13 +X 9 +X 8 +X 7 +X 5 +1; the data further comprising a second PN sequence based on P(X)=X 15 +X 12 +X 11 +X 10 +X 5 +X 5 +X 4 +X 3 +1; and the data further comprising a third PN sequence based on P(X)=X 20 +X 9 +X 5 +X 3 +1; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; and an output from said memory to provide PN data of the PN sequence for each count value from zero to L.
Claim 23
Dependent Claim
165 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence having a length of L, the PN sequence comprising a first PN sequence based on P(X)=X 15 +X 13 +X 9 +X 8 +X 7 +X 5 +1; the data further comprising a second PN sequence based on P(X)=X 15 +X 12 +X 11 +X 10 +X 5 +X 5 +X 4 +X 3 +1; and the data further comprising a third PN sequence based on P(X)=X 20 +X 9 +X 5 +X 3 +1; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; and an output from said memory to provide PN data of the PN sequence for each count value from zero to L.
Claim 24
Dependent Claim
137 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence having a length of L; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; an output from said memory to provide PN data of the PN sequence for each count value from zero to L−1; an adder; a first input of said adder coupled to said output of said binary counter; a second input of said adder coupled to receive a base station offset value; and an output of said adder coupled to said input of said memory.
Claim 25
Dependent Claim
137 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence having a length of L; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; an output from said memory to provide PN data of the PN sequence for each count value from zero to L−1; an adder; a first input of said adder coupled to said output of said binary counter; a second input of said adder coupled to receive a base station offset value; and an output of said adder coupled to said input of said memory.
Claim 26
Dependent Claim
26 words
The communication device according to claim 16 , further comprising: a controller; and said controller having an output coupled to an input of said binary counter.
Claim 27
Dependent Claim
39 words
The communication device according to claim 16 , further comprising: a controller; said controller having an output coupled to an input of said binary counter; and said controller being operative to load said binary counter with a counter value.
Claim 28
Dependent Claim
124 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence having a length of L; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; an output from said memory to provide PN data of the PN sequence for each count value from zero to L−1; a controller; an adder; an output of said adder coupled to an input of said binary counter; and an input of said adder coupled to an output of said controller.
Claim 29
Dependent Claim
124 words
A communication device operative for spread spectrum communications, comprising: a pseudorandom noise (PN) generator, including: memory; data stored in said memory; the data comprising at least one PN sequence having a length of L; a binary counter; the binary counter for use in providing count values from zero to L−1 at an input to said memory; a clock circuit; an output from said clock circuit coupled to an input to said binary counter; an output from said memory to provide PN data of the PN sequence for each count value from zero to L−1; a controller; an adder; an output of said adder coupled to an input of said binary counter; and an input of said adder coupled to an output of said controller.
References Cited (Backward Citations)
US3746847A
Cited
US4295223A
Cited
US4318125A
Cited
US4493046A
Cited
US4817148A
Cited
US5007088A
Cited
US5103459A
Cited
US5103459B1
Cited
US5634085A
Cited
US5504835A
Cited
US5311176A
Cited
US5228054A
Cited
US5337338A
Cited
US5428820A
Cited
US5532695A
Cited
US5651123A
Cited
US5677927A
Cited
US5960031A
Cited
US6031862A
Cited
US5499280A
Cited
US5878075A
Cited
US5883889A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-09-16 | 2006-03-18 | 2006-09-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-09-16 | 2010-03-18 | 2010-09-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-09-16 | 2014-03-18 | 2014-09-17 | $7700.00 | Window Closed / Lapsed |