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

System and method for generating signal waveforms in a CDMA cellular telephone system

Assignee: Qualcomm Inc
•
Filing: 1992-01-24
•
Granted: 1995-05-16
•
Expires: 2012-01-24
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A system and method for communicating information signals using spread spectrum communication techniques. PN sequences are constructed that provide orthogonality between the users so that mutual interference will be reduced, allowing higher capacity and better link performance. With orthogonal PN codes, the cross-correlation is zero over a predetermined time interval, resulting in no interference between the orthogonal codes, provided only that the code time frames are time aligned with each other. In an exemplary embodiment, signals are communicated between a cell-site and mobile units using direct sequence spread spectrum communication signals. In the cell-to-mobile link, pilot, sync, paging and voice channels are defined. Information communicated on the cell-to-mobile link channels are, in general, encoded, interleaved, hi-phase shift key (BPSK) modulated with orthogonal covering of each BPSK symbol along with quadrature phase shift key (QPSK) spreading of the covered symbols. In the mobile-to-cell link, access and voice channels are defined. Information communicated on the mobile-to-cell link channels are, in general, encoded, interleaved, orthogonal signalling along with QPSK spreading.

Inventors

  • 👤 Klein S. Gilhousen
  • 👤 Irwin M. Jacobs
  • 👤 Roberto Padovani
  • 👤 Lindsay A. Weaver, Jr.
  • 👤 Andrew J. Viterbi

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-02 16:14
CPC Classifications
H; H04; H04J; H04J13/00; H04J13/16; H04J13/18; H04L; H04L27/00; H04L27/26; H04L27/30; H04L1/00; H04L1/0001; H04L1/0002; H04B; H04B1/00; H04B1/38; H04B1/3827; H04B1/3888; H04B1/69; H04B1/707; H04B1/7073; H04B1/7075; H04B1/70757; H04B1/709; H04B7/00; H04B7/24; H04B7/26; H04B7/2618; H04B7/2628; H04B7/2637; H04J11/00; H04J13/0007; H04J13/0022; H04J13/004; H04J13/0048; H04J13/10; H04J13/102; H04J13/107; H04L1/0006; H04L1/004; H04L1/0056; H04L1/0064; H04L1/0065; H04L1/0067; H04L1/0068; H04L1/0071; H04L1/02; H04L1/06; H04L23/00; H04L23/02; H04L5/00; H04L5/02; H04L5/12; H04B1/7097; H04B1/711; H04B1/7115; H04B2201/00; H04B2201/69; H04B2201/707; H04B2201/70701; H04B2201/70703; H04L1/0045; H04L1/0046; H04L1/08; H04W; H04W52/00; H04W52/04; H04W52/18; H04W52/26; Y; Y02; Y02D; Y02D30/00; Y02D30/50

Claims Analysis

Total Claims: 41
Claim 1
Independent Claim 250 words
A spread spectrum modulator for modulating variable rate input digital data for transmission, said input digital data being provided in data frames of a predetermined time duration with each frame of input digital data having a number of data bits corresponding to one of several predetermined frame bit counts, said modulator comprising: a convolutional encoder having an input receiving said frames of input digital data and an output; a data interleaver having an input coupled to said convolutional encoder output and an output; a Walsh function encoder having an input coupled to said interleaver output and an output; a first pseudorandom noise (PN) code generator having an output; a first exclusive-OR gate having a pair of inputs and an output, one of said first exclusive-OR gate inputs coupled to said first PN code generator output and another of said first exclusive-OR gate inputs coupled to said Walsh encoder output; a second PN code generator having an output; a third PN code generator having an output; a second exclusive-OR gate having a pair of inputs and an output, one of said second exclusive-OR gate inputs coupled to said second PN code generator output and another of said second exclusive-OR gate inputs coupled to said first exclusive-OR gate output; and a third exclusive-OR gate having a pair of inputs and an output, one of said third exclusive-OR gate inputs coupled to said third PN code generator output and another of said third exclusive-OR gate inputs coupled to said first exclusive-OR gate output.
Claim 2
Dependent Claim 250 words
A spread spectrum modulator for modulating variable rate input digital data for transmission, said input digital data being provided in data frames of a predetermined time duration with each frame of input digital data having a number of data bits corresponding to one of several predetermined frame bit counts, said modulator comprising: a convolutional encoder having an input receiving said frames of input digital data and an output; a data interleaver having an input coupled to said convolutional encoder output and an output; a Walsh function encoder having an input coupled to said interleaver output and an output; a first pseudorandom noise (PN) code generator having an output; a first exclusive-OR gate having a pair of inputs and an output, one of said first exclusive-OR gate inputs coupled to said first PN code generator output and another of said first exclusive-OR gate inputs coupled to said Walsh encoder output; a second PN code generator having an output; a third PN code generator having an output; a second exclusive-OR gate having a pair of inputs and an output, one of said second exclusive-OR gate inputs coupled to said second PN code generator output and another of said second exclusive-OR gate inputs coupled to said first exclusive-OR gate output; and a third exclusive-OR gate having a pair of inputs and an output, one of said third exclusive-OR gate inputs coupled to said third PN code generator output and another of said third exclusive-OR gate inputs coupled to said first exclusive-OR gate output.
Claim 3
Dependent Claim 41 words
The modulator of claim 1 wherein said data frames are of a duration of 20 msec. and wherein each data frame of said input digital data is at a data rate of 9.6 kbps, 4.8 kbps, 2.4 kbps and 1.2 kbps.
Claim 4
Dependent Claim 15 words
The modulator of claim 2 wherein said convolution encoder is a rate 1/3, convolution encoder.
Claim 5
Dependent Claim 100 words
The modulator of claim 3 wherein said convolutional encoder produces 3 symbols for each input data bit of each data frame of input data and said interleaver provides symbol repetition for symbols produced by said convolutional encoder for input digital data of data frames of said 4.8 kbps, 2.4 kbps and 1.2 kbps data rates, with said symbols repeated once for each 4.8 kbps data rate data frame of input digital data, twice for each 2.4 kbps data rate data frame of input digital data, and four times for each 1.2 kbps data rate data frame of input digital data.
Claim 6
Dependent Claim 48 words
The modulator of claim 4 wherein said Walsh function encoder converts each consecutive group of six symbols according to a binary value of each respective group into corresponding one of 64 Walsh function symbols wherein each Walsh function symbol is comprised of a different sequence of Walsh chips.
Claim 7
Dependent Claim 15 words
The modulator of claim 1 wherein said convolutional encoder is a rate 1/3, convolution encoder.
Claim 8
Dependent Claim 17 words
The modulator of claim 1 wherein said Walsh function encoder is a 64-ary orthogonal Walsh function generator.
Claim 9
Dependent Claim 19 words
The modulator of claim 1 wherein said first PN code generator is a augmented length maximal linear sequence generator.
Claim 10
Independent Claim 81 words
A method for spread spectrum modulating a data signal comprising the steps of: converting sequential portions of a digitized data signal into respective orthogonal function signal portions wherein each orthogonal function signal portion is representative of an orthogonal function selected from a plurality of orthogonal functions according to a value of a respective portion of said sequential portions; generating a pseudorandom noise (PN) code; and combining said orthogonal function signal portions with said PN code to produce a PN spread signal.
Claim 11
Independent Claim 81 words
A method for spread spectrum modulating a data signal comprising the steps of: converting sequential portions of a digitized data signal into respective orthogonal function signal portions wherein each orthogonal function signal portion is representative of an orthogonal function selected from a plurality of orthogonal functions according to a value of a respective portion of said sequential portions; generating a pseudorandom noise (PN) code; and combining said orthogonal function signal portions with said PN code to produce a PN spread signal.
Claim 12
Dependent Claim 83 words
The method of claim 9 wherein said data signal is comprised of digital data bits and said step of converting comprises the steps of: grouping a predetermined number of bits of said data signal into each one of said data signal portions; determining from a binary value of said bits in each data signal portion a corresponding one of said orthogonal functions, wherein said orthogonal functions are Walsh functions; and generating said respective orthogonal function signal portion corresponding to said determined orthogonal function.
Claim 13
Dependent Claim 35 words
The method of claim 10 further comprising the steps of: generating at least one additional PN signal; and combining said PN spread signal with each additional PN code to produce corresponding additional PN spread signals.
Claim 14
Dependent Claim 43 words
The method of claim 11 further comprising the steps of: convolutional encoding an input digital signal to produce corresponding symbol data; and organizing said symbol data according to a predetermined ordering format to provide said organized symbol data as said digitized data signal.
Claim 15
Dependent Claim 35 words
The method of claim 9 further comprising the steps of: generating at least one additional PN code; and combining said PN spread signal with each additional PN code to produce corresponding additional PN spread signals.
Claim 16
Dependent Claim 43 words
The method of claim 9 further comprising the steps of: convolutional encoding an input digital signal to produce corresponding symbol data; and organizing said symbol data according to a predetermined ordering format to provide said organized symbol data as said digitized data signal.
Claim 17
Independent Claim 102 words
A method for spread spectrum modulating digital data for transmission, comprising: convolutional encoding digital data to produce symbol data in a first ordered sequence; reordering said symbol data of said first ordered sequence to a second ordered sequence; grouping symbols of said second ordered sequence of symbol data into corresponding symbol groups; determining from a binary value formed by said symbol data in each symbol group a respective Walsh function symbol of a plurality of Walsh function symbols; generating a first pseudorandom noise (PN) code; and combining said Walsh function symbols with said first PN code to produce first PN spread data.
Claim 18
Independent Claim 102 words
A method for spread spectrum modulating digital data for transmission, comprising: convolutional encoding digital data to produce symbol data in a first ordered sequence; reordering said symbol data of said first ordered sequence to a second ordered sequence; grouping symbols of said second ordered sequence of symbol data into corresponding symbol groups; determining from a binary value formed by said symbol data in each symbol group a respective Walsh function symbol of a plurality of Walsh function symbols; generating a first pseudorandom noise (PN) code; and combining said Walsh function symbols with said first PN code to produce first PN spread data.
Claim 19
Dependent Claim 55 words
The method of claim 15 further comprising the steps of: generating a second PN code; generating a third PN code; combining said second PN code with said first PN spread data to produce second PN spread data; and combining said third PN code with said first PN spread data to produce third PN spread data.
Claim 20
Dependent Claim 129 words
The method of claim 16 wherein said digital data is variable rate data in data frames of a predetermined time duration with each frame of digital data having a number of data bits corresponding to a predetermined multiple of bits in a frame of a least number of bits and wherein: said step of convolutional encoding said digital data produces three symbols for each data bit in each frame of digital data; and said step of reordering said symbol data further comprises the step of repeating symbols of said first ordered sequence for frames of digital data having a lesser number of bits than a frame of digital data of a greatest number of bits so as to maintain a constant number of symbols in said second ordered sequence.
Claim 21
Dependent Claim 49 words
The method of claim 17 wherein: in said step of grouping, six symbols are grouped to form said binary value; in said step of determining, each binary value corresponds to one of 64 Walsh function symbols with each Walsh function symbol comprised of a sequence of 64 Walsh chips.
Claim 22
Dependent Claim 37 words
The modulator of claim 18 wherein said step of generating said first PN code, which is comprised of first PN code chips, said first PN code chips are generated at a multiple rate of said Walsh chips.
Claim 23
Independent Claim 71 words
A system for modulating an information signal in a spread spectrum communication system comprising: orthogonal function encoder means for receiving a digitized information signal and converting sequential portions of said digitized information signal into respective orthogonal function signals; and spreading means connected to said orthogonal function encoder means for generating a pseudorandom noise (PN) code and combining said orthogonal function signals with said PN code to produce a PN spread signal.
Claim 24
Independent Claim 71 words
A system for modulating an information signal in a spread spectrum communication system comprising: orthogonal function encoder means for receiving a digitized information signal and converting sequential portions of said digitized information signal into respective orthogonal function signals; and spreading means connected to said orthogonal function encoder means for generating a pseudorandom noise (PN) code and combining said orthogonal function signals with said PN code to produce a PN spread signal.
Claim 25
Dependent Claim 19 words
The modulation system of claim 20 wherein said PN code is an augmented length maximal linear sequence PN code.
Claim 26
Dependent Claim 30 words
The modulation system of claim 20 further comprising additional spreading means for generating at least one additional PN code and combining said PN spread signal with each additional PN code.
Claim 27
Dependent Claim 50 words
The modulation system of claim 22 further comprising: data encoder means for receiving digital user data and convolutional encoding said digital data to produce symbol data; and interleaver means for organizing said symbol data according to a predetermined ordering format and providing said organized symbol data as said information signal.
Claim 28
Dependent Claim 47 words
The modulation system of claim 20 further comprising: data encoder means for receiving and convolutional encoding said digital data to produce symbol data; and interleaver means for organizing said symbol data according to a predetermined ordering format and providing said organized symbol data as said information signal.
Claim 29
Dependent Claim 68 words
The modulation system of claim 20 wherein said digitized information signal is comprised of variable data rate data frames of digital data wherein each data frame is of a predetermined time duration with a lowest rate data frame of a predetermined number of data bits and at least one higher rate data frame each of a respective greater number of data bits that said lowest rate data frame.
Claim 30
Dependent Claim 93 words
A modulator for spread spectrum modulating digital data for transmission, comprising: convolutional encoder means for receiving and convolutional encoding digital data to produce symbol data in a first ordered sequence; interleaver means for reordering said symbol data in a second ordered sequence; orthogonal function encoder means for encoding said second ordered sequence symbol data into orthogonal function symbol data; first generator means for generating a first pseudorandom noise (PN) code; first combining means for combining said orthogonal function symbol data and said first PN code to produce a first PN spread data signal.
Claim 31
Dependent Claim 93 words
A modulator for spread spectrum modulating digital data for transmission, comprising: convolutional encoder means for receiving and convolutional encoding digital data to produce symbol data in a first ordered sequence; interleaver means for reordering said symbol data in a second ordered sequence; orthogonal function encoder means for encoding said second ordered sequence symbol data into orthogonal function symbol data; first generator means for generating a first pseudorandom noise (PN) code; first combining means for combining said orthogonal function symbol data and said first PN code to produce a first PN spread data signal.
Claim 32
Dependent Claim 69 words
The modulator of claim 26 further comprising: second and third generator means each for respectively generating second and third PN codes; second combining means for combining said second PN code with said first PN spread data signal to produce a second PN spread data signal; third combining means for combining said third PN code with said first PN spread data signal to produce a third PN spread data signal.
Claim 33
Dependent Claim 44 words
The modulator of claim 27 wherein said first PN code is of a first code length and said second and third PN codes are of a second code length, with said first code length being substantially greater in length than said second code length.
Claim 34
Dependent Claim 20 words
The modulator of claim 26 wherein each symbol of said orthogonal function symbol data is representative of a Walsh function.
Claim 35
Dependent Claim 26 words
The modulator of claim 26 wherein each symbol of said orthogonal function symbol data is a Walsh function symbol comprised of a sequence of Walsh chips.
Claim 36
Dependent Claim 19 words
The modulator of claim 30 wherein said convolutional encoder means generates symbol data using a rate 1/3 convolutional code.
Claim 37
Dependent Claim 69 words
The modulator of claim 30 wherein said digital data is variable rate data provided in data frames of a predetermined time duration with each frame of digital data having a number of data bits corresponding to a predetermined multiple of bits in a frame of a least number of bits, and said convolutional encoder means generating three symbols for each data bit in each frame of input digital data.
Claim 38
Dependent Claim 17 words
The modulator of claim 32 wherein said orthogonal function encoder means comprises a 64-ary Walsh function encoder.
Claim 39
Dependent Claim 57 words
The modulator of claim 32 wherein said orthogonal function encoder means converts consecutive six symbol groups of said second ordered sequence of symbol data according to a binary value of each respective group into a corresponding one of 64 Walsh function symbols wherein each Walsh function symbol is comprised of a different sequence of 64 Walsh chips.
Claim 40
Dependent Claim 29 words
The modulator of claim 34 wherein said first spreading means generates said first PN code, comprised of first PN code chips, at a multiple rate of said Walsh chips.;
Claim 41
Dependent Claim 25 words
The modulator of claim 35 wherein said first spreading means generates four of said first PN code chips for combining with each each Walsh chip.

References Cited (Backward Citations)

US3715508A Cited
US4052565A Cited
US4301530A Cited
US4730340A Cited
US4472815A Cited
US4460992A Cited
US4872200A Cited
US4933952A Cited
US4939745A Cited
US5005169A Cited
US5103459A Cited
US5103459B1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-05-15 1998-11-14 1999-05-16 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-05-15 2002-11-14 2003-05-16 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-05-15 2006-11-14 2007-05-16 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag