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

Signal comprising binary spreading-code sequences

Assignee: Unwired Broadband Inc
•
Filing: 1995-05-31
•
Granted: 1998-09-29
•
Expires: 2015-05-31
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for electrically generating sets of binary spreading-code sequences for use in a multi-node communication network. Also, a method for assigning disjoint sets of binary spreading-code sequences to different nodes of such a network. Each set of binary spreading-code sequences consists of multiple sequences, which are generated using two binary shift registers. The sequences can be generated simultaneously, or sequence segments can be generated sequentially. To generate sequences simultaneously, the contents of multiple pairs of stages of two linear-feedback binary shift registers are combined by modulo-2 addition, where each pair of stages consists of one stage from each of the two binary shift registers. To generate sequence segments sequentially, the contents of a single stage of a first binary shift register are combined by modulo-2 addition with the contents of a single stage of a second binary shift register, where new fills are switched into each of the registers at the beginning of each period. To assign disjoint sets of binary spreading-code sequences to different nodes of the network, the initial fill of the first binary shift register is fixed and different initial fills are specified for the second binary shift register.

Inventors

  • 👤 Bart F. Rice

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 02:05
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: 4
Claim 1
Independent Claim 246 words
A signal comprising a set of binary spreading-code sequences modulated onto a sinusoidal carrier, said set of binary spreading-code sequences being produced by a process of simultaneously: a) combining contents of a single stage of a first multi-stage binary shift register with contents of each stage of a plurality of stages of a second multi-stage binary shift register, the contents of each stage of each of said first and second binary shift registers having a period of (2 n -1), where n is a fixed integer having the same value for each of said first and second binary shift registers, the contents of said stages of said first and second binary shift registers being combined by modulo-2 addition to produce a first subset of combined spreading-code sequences, and b) combining contents of a single stage of said second binary shift register with contents of each stage of a plurality of stages of said first binary shift register by modulo-2 addition to produce a second subset of combined spreading-code sequences, said first and second subsets of combined spreading-code sequences having cross-correlation properties as follows: (i) a cross-correlation between any two of said combined binary spreading-code sequences over any contiguous (2 n -1) bits has a magnitude ≦(2.sup. (n+1)/2! +1), where (n+1)/2! denotes the greatest integer ≦(n+1)/2; and (ii) a cross-correlation at zero offset between any two of said combined binary spreading-code sequences in either one of said first and second subsets has a magnitude equal to one.
Claim 2
Dependent Claim 246 words
A signal comprising a set of binary spreading-code sequences modulated onto a sinusoidal carrier, said set of binary spreading-code sequences being produced by a process of simultaneously: a) combining contents of a single stage of a first multi-stage binary shift register with contents of each stage of a plurality of stages of a second multi-stage binary shift register, the contents of each stage of each of said first and second binary shift registers having a period of (2 n -1), where n is a fixed integer having the same value for each of said first and second binary shift registers, the contents of said stages of said first and second binary shift registers being combined by modulo-2 addition to produce a first subset of combined spreading-code sequences, and b) combining contents of a single stage of said second binary shift register with contents of each stage of a plurality of stages of said first binary shift register by modulo-2 addition to produce a second subset of combined spreading-code sequences, said first and second subsets of combined spreading-code sequences having cross-correlation properties as follows: (i) a cross-correlation between any two of said combined binary spreading-code sequences over any contiguous (2 n -1) bits has a magnitude ≦(2.sup. (n+1)/2! +1), where (n+1)/2! denotes the greatest integer ≦(n+1)/2; and (ii) a cross-correlation at zero offset between any two of said combined binary spreading-code sequences in either one of said first and second subsets has a magnitude equal to one.
Claim 3
Dependent Claim 286 words
A signal comprising a set of binary spreading-code sequences modulated onto a sinusoidal carrier, said set of binary spreading-code sequences being produced by a process of: a) specifying a switching interval consisting of a fixed number of steps for each of a first multi-stage binary shift register and a second multi-stage binary shift register, contents of each stage of each of said first and second binary shift registers having a period of (2 n -1), where n is a fixed integer having the same value for each of said first and second binary shift registers; b) inserting contents into each stage of said first and second binary shift registers once per said switching interval; c) combining the contents of a single stage of said first binary shift register with the contents of a single stage of said second binary shift register by modulo-2 addition at each step of said first and second binary shift registers to produce binary spreading-code sequences such that any two of said binary spreading-code sequences have cross-correlation properties as follows: (i) a cross-correlation between any two of said binary spreading-code sequences over any contiguous (2 n -1) bits has a magnitude ≦(2.sup. (n+1)/2! +1), where (n+1)/2! denotes the greatest integer ≦(n+1)/2; (ii) a cross-correlation at zero offset over any contiguous (2 n -1) bits between any two of said binary spreading-code sequences for which the initial contents of said first binary shift register are identical has a magnitude equal to one; and (iii) a cross-correlation at zero offset over any contiguous (2 n -1) bits between any two of said binary spreading-code sequences for which the initial contents of said second binary shift register are identical has a magnitude equal to one.
Claim 4
Dependent Claim 286 words
A signal comprising a set of binary spreading-code sequences modulated onto a sinusoidal carrier, said set of binary spreading-code sequences being produced by a process of: a) specifying a switching interval consisting of a fixed number of steps for each of a first multi-stage binary shift register and a second multi-stage binary shift register, contents of each stage of each of said first and second binary shift registers having a period of (2 n -1), where n is a fixed integer having the same value for each of said first and second binary shift registers; b) inserting contents into each stage of said first and second binary shift registers once per said switching interval; c) combining the contents of a single stage of said first binary shift register with the contents of a single stage of said second binary shift register by modulo-2 addition at each step of said first and second binary shift registers to produce binary spreading-code sequences such that any two of said binary spreading-code sequences have cross-correlation properties as follows: (i) a cross-correlation between any two of said binary spreading-code sequences over any contiguous (2 n -1) bits has a magnitude ≦(2.sup. (n+1)/2! +1), where (n+1)/2! denotes the greatest integer ≦(n+1)/2; (ii) a cross-correlation at zero offset over any contiguous (2 n -1) bits between any two of said binary spreading-code sequences for which the initial contents of said first binary shift register are identical has a magnitude equal to one; and (iii) a cross-correlation at zero offset over any contiguous (2 n -1) bits between any two of said binary spreading-code sequences for which the initial contents of said second binary shift register are identical has a magnitude equal to one.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-09-28 2002-03-30 2002-09-29 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-09-28 2006-03-30 2006-09-29 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-09-28 2010-03-30 2010-09-29 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag