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

Method and apparatus for increasing the data rate for a given symbol rate in a spread spectrum system

Assignee: Verizon Patent and Licensing Inc
•
Filing: 1989-12-27
•
Granted: 1991-11-05
•
Expires: 2009-12-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for transmitting a stream of data bits in a spread spectrum format is disclosed. The inventive method comprises providing 2N predetermined spreading sequences, where N is equal to or larger than 2. The predetermined spreading sequences have suitable autocorrelation and cross-correlation properties. For each group of N bits in a stream of data bits to be transmitted, a particular one from the 2N predetermined spreading sequences is selected and transmitted. In this manner, each transmitted spreading sequence corresponds to a particular arrangement of N bits. The invention achieves an N-fold increase in data rate for a particular symbol rate by encoding N bits in a spreading sequence.

Inventors

  • 👤 Jan P. Vancraeynest

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 03:28
CPC Classifications
H; H04; H04B; H04B1/00; H04B1/69; H04B1/707

Claims Analysis

Total Claims: 25
Claim 1
Independent Claim 91 words
A method for transmitting a stream of data bits in a spread spectrum format comprising the steps of providing 2 N predetermined spreading sequences, where N is equal to or greater than two, and spreading groups of N bits in said stream of data bits in accordance with specific ones of said spreading sequences, each of said specific ones of said spreading sequences being chosen as a function of the bit values in one of said groups of N bits, and transmitting said data bits as spread by said spreading sequences.
Claim 2
Independent Claim 91 words
A method for transmitting a stream of data bits in a spread spectrum format comprising the steps of providing 2 N predetermined spreading sequences, where N is equal to or greater than two, and spreading groups of N bits in said stream of data bits in accordance with specific ones of said spreading sequences, each of said specific ones of said spreading sequences being chosen as a function of the bit values in one of said groups of N bits, and transmitting said data bits as spread by said spreading sequences.
Claim 3
Dependent Claim 20 words
The method of claim 1 wherein said 2 N spreading sequences comprises 2 N-1 distinct spreading sequences and their complements.
Claim 4
Dependent Claim 18 words
The method of claim 1 wherein said spreading sequences having single auto correlation peaks and low autocorrelation sidelobes.
Claim 5
Dependent Claim 25 words
The method of claim 3 wherein said spreading sequences have cross-correlations and partial correlations in between a predetermined high threshold and a predetermined low threshold.
Claim 6
Independent Claim 80 words
A method for transmitting a stream of data bits in spread spectrum format comprising spreading groups of N bits from said stream of data bits, where N is equal to or greater than two, in accordance with a specific single spreading sequence chosen from a group of 2 N predetermined spreading sequences as a function of the bit values in each of said groups of N bits, and transmitting said bits in said groups as spread by said spreading sequences.
Claim 7
Independent Claim 80 words
A method for transmitting a stream of data bits in spread spectrum format comprising spreading groups of N bits from said stream of data bits, where N is equal to or greater than two, in accordance with a specific single spreading sequence chosen from a group of 2 N predetermined spreading sequences as a function of the bit values in each of said groups of N bits, and transmitting said bits in said groups as spread by said spreading sequences.
Claim 8
Dependent Claim 22 words
The method of claim 5 wherein said group of 2 N spreading sequences comprises 2 N-1 distinct spreading sequences and their complements.
Claim 9
Dependent Claim 37 words
The method of claim 5 wherein said transmitting step comprises modulating said data bits as spread by said spreading sequences onto a carrier for transmission to a remote location using a modulation scheme with two modulation levels.
Claim 10
Dependent Claim 80 words
A coding circuit for coding a stream of data bits in a spread spectrum format comprising, selection means for simultaneously receiving a plurality of data bits from said data bit stream and for selecting a particular spreading sequence out of a plurality of predetermined spreading sequences as a function of the bit values in said plurality of data bits, and transmitting means for transmitting said plurality of data bits as spread by said particular spreading sequence to a remote location.
Claim 11
Dependent Claim 80 words
A coding circuit for coding a stream of data bits in a spread spectrum format comprising, selection means for simultaneously receiving a plurality of data bits from said data bit stream and for selecting a particular spreading sequence out of a plurality of predetermined spreading sequences as a function of the bit values in said plurality of data bits, and transmitting means for transmitting said plurality of data bits as spread by said particular spreading sequence to a remote location.
Claim 12
Dependent Claim 27 words
The coding circuit of claim 8 wherein said plurality of data bits comprises N bits and said plurality of predetermined spreading sequences comprises 2 N spreading sequences.
Claim 13
Dependent Claim 69 words
The circuit of claim 9 wherein said selection means comprises a generator circuit capable of generating 2 N-1 predetermined spreading sequences, a selector circuit for selecting one of said 2 N-1 spreading sequences as a function of the bit values of said plurality of data bits, and complement means for selectively providing a complement of the selected spreading sequence depending on the bit value of said plurality of bits.
Claim 14
Dependent Claim 35 words
The coding circuit of claim 9 wherein said transmitting means comprises modulation means for modulating said plurality of bits as spread by said particular spreading sequence onto a carrier using a two level modulation scheme.
Claim 15
Dependent Claim 29 words
The coding circuit of claim 9 wherein said predetermined spreading sequences have single autocorrelation peaks, and autocorrelation sidelobes, cross-correlations and partial correlations in between predetermined high and low thresholds.
Claim 16
Dependent Claim 91 words
A decoding circuit for decoding a signal in a spread spectrum format comprising means for receiving said signal in said spread spectrum format, a plurality of correlator circuits for correlating said received spread spectrum signal with a plurality of predetermined spreading sequences to identify particular ones of said predetermined spreading sequences contained in said received spread spectrum signal, and decoder means for converting each of said identified spreading sequences contained in said received spread spectrum signal into a particular plurality of data bits as a function of the identified spreading sequence.
Claim 17
Dependent Claim 91 words
A decoding circuit for decoding a signal in a spread spectrum format comprising means for receiving said signal in said spread spectrum format, a plurality of correlator circuits for correlating said received spread spectrum signal with a plurality of predetermined spreading sequences to identify particular ones of said predetermined spreading sequences contained in said received spread spectrum signal, and decoder means for converting each of said identified spreading sequences contained in said received spread spectrum signal into a particular plurality of data bits as a function of the identified spreading sequence.
Claim 18
Dependent Claim 32 words
The decoder circuit of claim 13 wherein said plurality of correlator circuits are arranged in parallel for correlating said received spread spectrum signal with said plurality of predetermined spreading sequences in parallel.
Claim 19
Dependent Claim 61 words
The decoder circuit of claim 13 wherein said plurality of data bits comprises N bits, wherein said plurality of predetermined spreading sequences comprises 2 N-1 distinct spreading sequences and complements of the 2 N-1 distinct spreading sequences, and wherein each of said correlators correlates the received spread spectrum signal with one of said 2 N-1 distinct spreading sequences and a complement.
Claim 20
Dependent Claim 30 words
The circuit of claim 13 wherein said predetermined spreading sequences have a single autocorrelation peak, and autocorrelation sidelobes and cross and partial correlations in between predetermined low and high thresholds.
Claim 21
Dependent Claim 25 words
The circuit of claim 13 wherein said receiving means includes demodulation means for demodulating said received signal in said spread spectrum format from a carrier.
Claim 22
Independent Claim 88 words
A method for decoding a signal in spread spectrum format comprising the steps of: receiving said signal in said spread spectrum format, correlating said received spread spectrum signal with a plurality of predetermined spreading sequences to produce an identifying signal for identifying particular ones of said predetermined spreading sequences contained in said received spread spectrum signal, and converting each of said identified spreading sequences contained in said received spread spectrum signal into a plurality of N, N≧2, data bits as a function of the particular identified spreading sequence.
Claim 23
Independent Claim 88 words
A method for decoding a signal in spread spectrum format comprising the steps of: receiving said signal in said spread spectrum format, correlating said received spread spectrum signal with a plurality of predetermined spreading sequences to produce an identifying signal for identifying particular ones of said predetermined spreading sequences contained in said received spread spectrum signal, and converting each of said identified spreading sequences contained in said received spread spectrum signal into a plurality of N, N≧2, data bits as a function of the particular identified spreading sequence.
Claim 24
Dependent Claim 19 words
The method of claim 18, wherein said identifying signal is utilized to indicate link activity in a communication system.
Claim 25
Dependent Claim 22 words
The method of claim 18 wherein said identifying signal is qualified with a signal indicative of link activity in a communication system.

References Cited (Backward Citations)

US32905A Cited
US4071903A Cited
US4203071A Cited
US4455651A Cited
USRE32905E Cited
USRE32905F1 Cited
US4392232A Cited
US4759034A Cited
US4817001A Cited
US4912722A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag