← Back to Patent Explorer
US5878075A Expired / Lapsed US ⏱️ 0.0 years remaining

Method of and apparatus for generating a pseudorandom noise sequence

Assignee: Motorola Solutions Inc
•
Filing: 1996-07-26
•
Granted: 1999-03-02
•
Expires: 2016-07-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An augmenting circuit (153) augments an embedded PN sequence of 2 N -1 chips generated by an N-bit LSSR (111) to provide an augmented PN sequence of 2 N chips and an augmented PN sequence of 2 N chips shifted by D chips. The augmenting circuit comprises a N-bit counter (123) that counts a plurality of clock bits. The N-bit counter provides a pre-carry signal that changes state when the counter's index equals a predetermined value and provides a value of the N-k most-significant-bits (MSB) of the index. A logic circuit (107,119) receives the plurality of clock bits and responds to the pre-carry signal to gate the plurality of clock bits. A comparator (135) receives the value of the N-k MSB and a threshold value to output a select signal that controls a multiplexer (139).

Inventors

  • 👤 Colin D. Frank
  • 👤 Fuyun Ling

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 11:00
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/06; H04L9/065; H04L9/0656; G; G06; G06F; G06F7/00; G06F7/58; G06F7/582; G06F7/584; H04L9/0662; G06F2207/00; G06F2207/58; G06F2207/583; H04L2209/00; H04L2209/04; H04L2209/12; H04L2209/80; H04L2209/805

Claims Analysis

Total Claims: 29
Claim 1
Independent Claim 93 words
A N-bit pseudorandom (PN) sequence generator comprising: a clock providing a plurality of clock bits; a suppression circuit including a N-bit binary counter responding to the plurality of clock bits to increment an index of the N-bit binary counter for each clock bit, the N-bit binary counter passing the plurality of clock bits except a one clock bit of the plurality of clock bits when the index equals a predetermined value; and a N-bit Linear Sequence Shift Register (LSSR) responding to the passed clock bits to generate an augmented PN sequence of chips.
Claim 2
Dependent Claim 93 words
A N-bit pseudorandom (PN) sequence generator comprising: a clock providing a plurality of clock bits; a suppression circuit including a N-bit binary counter responding to the plurality of clock bits to increment an index of the N-bit binary counter for each clock bit, the N-bit binary counter passing the plurality of clock bits except a one clock bit of the plurality of clock bits when the index equals a predetermined value; and a N-bit Linear Sequence Shift Register (LSSR) responding to the passed clock bits to generate an augmented PN sequence of chips.
Claim 3
Dependent Claim 81 words
The N-bit PN sequence generator of claim 1, wherein the suppression circuit further includes: the N-bit binary counter provides a pre-carry signal that changes state when the index equals the predetermined value of 2 N -1; a D-type flip-flop for delaying the pre-carry signal by one clock bit to thus create an inhibit signal; and an AND gate receiving the plurality of clock bits and the inhibit signal to suppress the one clock bit when the index equals 2 N .
Claim 4
Dependent Claim 111 words
The N-bit PN sequence generator of claim 1 further comprising: the N-bit LSSR is of a respective state for each chip generated; a mask circuit, receiving the respective state, responding to a mask to provide a shifted PN sequence of chips; a D-type flip-flop, receiving the shifted PN sequence of chips, to provide a delayed, shifted PN sequence of chips; a selector providing a select signal; and a multiplexer, receiving as input the shifted PN sequence of chips and the delayed, shifted PN sequence of chips, responding to the select signal to output a selected one of the shifted PN sequence of chips and the delayed, shifted PN sequence of chips.
Claim 5
Dependent Claim 287 words
An N-bit pseudorandom (PN) sequence generator comprising: a clock providing a plurality of clock bits: a suppression circuit including a N-bit binary counter responding to the plurality of clock bits to increment an index of the N-bit binary counter for each clock bit, wherein the N-bit binary counter provides a value of an N-k most-significant-bits (MSB) of the index, the suppression circuit passing the plurality of clock bits except a one clock bit of the plurality of clock bits when the index equals a predetermined value; a N-bit Linear Sequence Shift Register (LSSR) responding to the passed clock bits to generate an augmented PN sequence of chips, wherein the N-bit LSSR is of a respective state for each chip generated; a mask circuit, receiving the respective state, responding to a mask to provide a shifted PN sequence of chips that is shifted by an integer multiple of 2 k chips; a D-type flip-flop, receiving the shifted PN sequence of chips, to provide a delayed, shifted PN sequence of chips; a selector including a comparator, wherein the selector receives the value of the N-k MSB and the integer multiple of 2 k chips minus one, to output a select signal at a first state when the value of the N-k MSB is equal to or less than the integer multiple of 2 k chips minus one and at a second state otherwise; and a multiplexer, receiving as input the shifted PN sequence of chips and the delayed, shifted PN sequence of chips, responding to the select signal to output a selected one of the shifted PN sequence of chips when the select signal is a first state and to output the delayed, shifted PN sequence of chips otherwise.
Claim 6
Dependent Claim 287 words
An N-bit pseudorandom (PN) sequence generator comprising: a clock providing a plurality of clock bits: a suppression circuit including a N-bit binary counter responding to the plurality of clock bits to increment an index of the N-bit binary counter for each clock bit, wherein the N-bit binary counter provides a value of an N-k most-significant-bits (MSB) of the index, the suppression circuit passing the plurality of clock bits except a one clock bit of the plurality of clock bits when the index equals a predetermined value; a N-bit Linear Sequence Shift Register (LSSR) responding to the passed clock bits to generate an augmented PN sequence of chips, wherein the N-bit LSSR is of a respective state for each chip generated; a mask circuit, receiving the respective state, responding to a mask to provide a shifted PN sequence of chips that is shifted by an integer multiple of 2 k chips; a D-type flip-flop, receiving the shifted PN sequence of chips, to provide a delayed, shifted PN sequence of chips; a selector including a comparator, wherein the selector receives the value of the N-k MSB and the integer multiple of 2 k chips minus one, to output a select signal at a first state when the value of the N-k MSB is equal to or less than the integer multiple of 2 k chips minus one and at a second state otherwise; and a multiplexer, receiving as input the shifted PN sequence of chips and the delayed, shifted PN sequence of chips, responding to the select signal to output a selected one of the shifted PN sequence of chips when the select signal is a first state and to output the delayed, shifted PN sequence of chips otherwise.
Claim 7
Dependent Claim 72 words
A suppression circuit for augmenting an embedded PN sequence of chips, the suppression circuit comprising: a counter including an index that is incremented for each clock bit of a plurality of clock bits, the counter provides a pre-carry signal that changes state when the index equals a predetermined value; and a logic circuit receiving the plurality of clock bits and responding to the pre-carry signal to gate the plurality of clock bits.
Claim 8
Dependent Claim 72 words
A suppression circuit for augmenting an embedded PN sequence of chips, the suppression circuit comprising: a counter including an index that is incremented for each clock bit of a plurality of clock bits, the counter provides a pre-carry signal that changes state when the index equals a predetermined value; and a logic circuit receiving the plurality of clock bits and responding to the pre-carry signal to gate the plurality of clock bits.
Claim 9
Dependent Claim 28 words
The suppression circuit of claim 5 wherein the logic circuit suppresses a one clock bit of the plurality of clock bits bit after the pre-carry signal changes state.
Claim 10
Dependent Claim 40 words
The suppression circuit of claim 5 wherein the embedded PN sequence of chips has a length 2 N -1, and the counter changes the state of the pre-carry signal when the index equals the predetermined value of 2 N -1.
Claim 11
Dependent Claim 55 words
The suppression circuit of claim 5 wherein the logic circuit comprises: a D-type flip-flop to delay the pre-carry signal by one clock bit to create an inhibit signal; and an AND gate responding to the inhibit signal to suppress a one clock bit of the plurality of clock bits when the inhibit signal changes state.
Claim 12
Dependent Claim 102 words
A selector for augmenting an embedded PN sequence of 2 N -1 chips shifted by n2 k -1 chips, the selector comprising: a N-bit binary counter including an index that is incremented for each clock bit of a plurality of clock bits, the N-bit binary counter provides a value of the N-k most-significant-bits (MSB) of the index; and a comparator receiving the value of the N-k MSB and a threshold value to output a select signal at a first state when the value of the N-k MSB is equal to or less than a threshold value and at a second state otherwise.
Claim 13
Dependent Claim 102 words
A selector for augmenting an embedded PN sequence of 2 N -1 chips shifted by n2 k -1 chips, the selector comprising: a N-bit binary counter including an index that is incremented for each clock bit of a plurality of clock bits, the N-bit binary counter provides a value of the N-k most-significant-bits (MSB) of the index; and a comparator receiving the value of the N-k MSB and a threshold value to output a select signal at a first state when the value of the N-k MSB is equal to or less than a threshold value and at a second state otherwise.
Claim 14
Dependent Claim 12 words
The selector of claim 9 the threshold value is equal to n-1.
Claim 15
Dependent Claim 133 words
An augmenting circuit for augmenting an embedded PN sequence of 2 N -1 chips, the augmenting circuit comprising: a N-bit counter including an index that is incremented for each clock bit of a plurality of clock bits, the N-bit counter provides a pre-carry signal that changes state when the index equals a predetermined value and provides a value of the N-k most-significant-bits (MSB) of the index; a logic circuit receiving the plurality of clock bits and responding to the pre-carry signal to gate the plurality of clock bits; and a comparator receiving the value of the N-k MSB and a threshold value to output a select signal at a first state when the value of the N-k MSB is equal to or less than the threshold value and at a second state otherwise.
Claim 16
Dependent Claim 133 words
An augmenting circuit for augmenting an embedded PN sequence of 2 N -1 chips, the augmenting circuit comprising: a N-bit counter including an index that is incremented for each clock bit of a plurality of clock bits, the N-bit counter provides a pre-carry signal that changes state when the index equals a predetermined value and provides a value of the N-k most-significant-bits (MSB) of the index; a logic circuit receiving the plurality of clock bits and responding to the pre-carry signal to gate the plurality of clock bits; and a comparator receiving the value of the N-k MSB and a threshold value to output a select signal at a first state when the value of the N-k MSB is equal to or less than the threshold value and at a second state otherwise.
Claim 17
Independent Claim 80 words
A method of generating a pseudorandom sequence of 2 N chips, the method comprising the steps of: providing 2 N clock bits; counting the 2 N clock bits; providing a pre-carry signal on a 2 N -1 clock bit; delaying the pre-carry signal by one clock bit to provide an inhibit signal on the 2 N th clock bit: gating the 2 N clock bits: and providing the gated 2 N clock bits to a N-bit Linear Sequence Shift Register.
Claim 18
Independent Claim 80 words
A method of generating a pseudorandom sequence of 2 N chips, the method comprising the steps of: providing 2 N clock bits; counting the 2 N clock bits; providing a pre-carry signal on a 2 N -1 clock bit; delaying the pre-carry signal by one clock bit to provide an inhibit signal on the 2 N th clock bit: gating the 2 N clock bits: and providing the gated 2 N clock bits to a N-bit Linear Sequence Shift Register.
Claim 19
Independent Claim 94 words
A method of generating a pseudorandom (PN) sequence of 2 N chips shifted by D chips, the method comprising the steps of: providing 2 N clock bits; counting the 2 N clock bits; determining whether the count is equal to or less than D-1; outputting an embedded PN sequence of 2 N -1 chips shifted by D-1 chips when the count is equal to or less than D-1; and outputting an embedded PN sequence of 2 N -1 chips shifted by D chips when the count is not equal to or less than D.
Claim 20
Independent Claim 94 words
A method of generating a pseudorandom (PN) sequence of 2 N chips shifted by D chips, the method comprising the steps of: providing 2 N clock bits; counting the 2 N clock bits; determining whether the count is equal to or less than D-1; outputting an embedded PN sequence of 2 N -1 chips shifted by D-1 chips when the count is equal to or less than D-1; and outputting an embedded PN sequence of 2 N -1 chips shifted by D chips when the count is not equal to or less than D.
Claim 21
Dependent Claim 51 words
The method of claim 13 further comprising the steps of: generating an embedded PN sequence of 2 N -1 chips; providing each state corresponding to each chip of the embedded PN sequence of 2 N -1 chips; and shifting by D-1 chips the embedded PN sequence of 2 N -1 chips.
Claim 22
Dependent Claim 27 words
The method of claim 14 further comprising the step of shifting by one chip the embedded PN sequence of 2 N -1 chips shifted by D-1 chips.
Claim 23
Dependent Claim 81 words
The method of claim 13, wherein D equals n2 k and n and k are integers, the method further comprising the steps of: providing the value of the N-k most-significant-bits (MSB) of the count; and providing the value of n2 k -1; wherein the step determining whether the count is equal to or less than D-1 includes the sub-step of determining whether the value of the N-k MSB of the count is equal to or less than the value of n-1.
Claim 24
Independent Claim 176 words
A method of generating a pseudorandom (PN) sequence of 2 N chips and the PN sequence of 2 N chips shifted by D chips, the method comprising the steps of: providing 2 N clock bits; counting the 2 N clock bits; providing an inhibit signal on the 2 N th clock bit; gating the 2 N clock bits; providing the gated 2 N clock bits to a N-bit Linear Sequence Shift Register 111 to generate an embedded PN sequence of 2 N -1 chips; shifting by D-1 chips embedded PN sequence of 2 N -1 chips; delaying by one chip the embedded PN sequence of 2 N -1 chips shifted by D-1 chips; determining whether the count is equal to or less than D-1; and either outputting the embedded PN sequence of 2 N -1 chips shifted by D-1 chips when the count is equal to or less than D-1, or outputting the embedded PN sequence of 2 N -1 chips shifted by D chips when the count is not equal to or less than D-1.
Claim 25
Independent Claim 176 words
A method of generating a pseudorandom (PN) sequence of 2 N chips and the PN sequence of 2 N chips shifted by D chips, the method comprising the steps of: providing 2 N clock bits; counting the 2 N clock bits; providing an inhibit signal on the 2 N th clock bit; gating the 2 N clock bits; providing the gated 2 N clock bits to a N-bit Linear Sequence Shift Register 111 to generate an embedded PN sequence of 2 N -1 chips; shifting by D-1 chips embedded PN sequence of 2 N -1 chips; delaying by one chip the embedded PN sequence of 2 N -1 chips shifted by D-1 chips; determining whether the count is equal to or less than D-1; and either outputting the embedded PN sequence of 2 N -1 chips shifted by D-1 chips when the count is equal to or less than D-1, or outputting the embedded PN sequence of 2 N -1 chips shifted by D chips when the count is not equal to or less than D-1.
Claim 26
Dependent Claim 35 words
The method of claim 17 further comprising the steps of: providing a pre-carry signal on the 2 N -1 clock bit; and delaying the pre-carry signal by one clock bit to provide the inhibit signal.
Claim 27
Dependent Claim 81 words
The method of claim 18, wherein D equals n2 k and n and k are integers, the method further comprising the steps of: providing the value of the N-k most-significant-bits (MSB) of the count; and providing the value of n2 k -1; wherein the step determining whether the count is equal to or less than D-1 includes the sub-step of determining whether the value of the N-k MSB of the count is equal to or less than the value of n-1.
Claim 28
Dependent Claim 335 words
A radiotelephone comprising: a clock providing a plurality of clock bits; a suppression circuit including a N-bit binary counter responding to the plurality of clock bits to increment an index of the N-bit binary counter for each clock bit, wherein the N-bit binary counter provides a value of an N-k most-significant-bits (MSB) of the index, the suppression circuit passing the plurality of clock bits except a one clock bit of the plurality of clock bits when the index equals a predetermined value; an N-bit Linear Sequence Shift Register (LSSR) responding to the passed clock bits to generate an augmented PN sequence of chips, the N-bit LSSR is of a respective state for each chip generated; a mask circuit, receiving the respective state, responding to a mask to provide a shifted PN sequence of chips that is shifted by an integer multiple of 2 k chips; a D-type flip-flop, receiving the shifted PN sequence of chips, to provide a delayed, shifted PN sequence of chips; a selector including a comparator, wherein the selector receives the value of the N-k MSB and the integer multiple of 2 k chips minus one, to output a select signal at a first state when the value of the N-k MSB is equal to or less than the integer multiple of 2 k chips minus one and to output a select signal at a second state otherwise; a multiplexer, receiving as input the shifted PN sequence of chips and the delayed, shifted PN sequence of chips, responding to the select signal to output a selected one of the shifted PN sequence of chips when the select signal is a first state and to output the delayed, shifted PN sequence of chips otherwise; an antenna for receiving an encoded signal; a first frequency downconvertor for downconverting the encoded signal; and a second frequency downconvertor receiving the downconverted encoded signal and the selected one of the shifted PN sequence of chips and the delayed, shifted PN sequence of chips to decode the downconverted
Claim 29
Dependent Claim 335 words
A radiotelephone comprising: a clock providing a plurality of clock bits; a suppression circuit including a N-bit binary counter responding to the plurality of clock bits to increment an index of the N-bit binary counter for each clock bit, wherein the N-bit binary counter provides a value of an N-k most-significant-bits (MSB) of the index, the suppression circuit passing the plurality of clock bits except a one clock bit of the plurality of clock bits when the index equals a predetermined value; an N-bit Linear Sequence Shift Register (LSSR) responding to the passed clock bits to generate an augmented PN sequence of chips, the N-bit LSSR is of a respective state for each chip generated; a mask circuit, receiving the respective state, responding to a mask to provide a shifted PN sequence of chips that is shifted by an integer multiple of 2 k chips; a D-type flip-flop, receiving the shifted PN sequence of chips, to provide a delayed, shifted PN sequence of chips; a selector including a comparator, wherein the selector receives the value of the N-k MSB and the integer multiple of 2 k chips minus one, to output a select signal at a first state when the value of the N-k MSB is equal to or less than the integer multiple of 2 k chips minus one and to output a select signal at a second state otherwise; a multiplexer, receiving as input the shifted PN sequence of chips and the delayed, shifted PN sequence of chips, responding to the select signal to output a selected one of the shifted PN sequence of chips when the select signal is a first state and to output the delayed, shifted PN sequence of chips otherwise; an antenna for receiving an encoded signal; a first frequency downconvertor for downconverting the encoded signal; and a second frequency downconvertor receiving the downconverted encoded signal and the selected one of the shifted PN sequence of chips and the delayed, shifted PN sequence of chips to decode the downconverted

References Cited (Backward Citations)

US4912721A Cited
US5228054A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-03-01 2002-08-31 2003-03-02 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-03-01 2006-08-31 2007-03-02 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-03-01 2010-08-31 2011-03-02 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag