Patent EP0491668A2 successfully refreshed from Google Patents.
EP0491668A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
CDMA substractive demodulation
Assignee: Ericsson Inc
•
Filing: 1991-12-12
•
Granted: —
•
Expires: 2011-12-12
Abstract
Abstract Subtractive CDMA demodulation optimally decodes a coded information signal embedded in many other overlapping signals making up a received, composite signal. A radio receiver correlates a unique code corresponding to the desired signal to be decoded with the composite signal. Moreover, after each information signal is successfully decoded, it is recoded and removed from the composite signal. As a result, subsequent correlations are performed with greater accuracy. Subtractive CDMA demodulation is enhanced by decoding the composite signal in the order of strongest to weakest signal strength. Interference caused by the presence of the strongest information signal and the composite signal during the decoding of weaker signals is removed. The individual information signals are assigned a unique block error correction code which is correlated with the composite signal using Fast Walsh transforms. Correlated signals are recoded using inverted Fast Walsh transforms and removed from the composite signal.
Inventors
- 👤 Paul W. Dent
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-02 15:37
CPC Classifications
H; H04; H04B; H04B1/00; H04B1/69; H04B1/707; H04B1/7097; H04B1/7103; H04B1/7107; H04B1/71072; H04B2001/71077; H04B2201/00; H04B2201/69; H04B2201/707; H04B2201/70703
Claims Analysis
Total Claims: 35
Claim 1
Independent Claim
152 words
A multiple access, spread spectrum communications system for communicating information signals between plural stations using code division spread spectrum communications signals, each station comprising: transmission means for spreading an information signal with a corresponding spreading code and for transmitting a spread-coded signal, and receiving means for receiving a composite signal of plural, overlapping spread-coded signals, including: code ordering means for ordering individual spreading codes in an order according to the relative signal strengths of said information signals; decoding means for recursively decoding said composite signal with a first ordered spreading code received from said code ordering means to generate a series of decoded signals; recoding means for successively recoding said decoded signals using corresponding spreading codes to generate a series of recoded signals; signal removal means for successively removing said recoded signals from said composite signal; and code selection means for successively selecting a next, ordered code from said code ordering means.
Claim 2
Dependent Claim
19 words
The system according to claim 1, wherein said order of relative signal strength is from greatest to weakest strength.
Claim 3
Dependent Claim
19 words
The system according to claim 1, wherein said order of information signals is varied depending on changing system conditions.
Claim 4
Dependent Claim
45 words
The system according to claim 3, wherein said decoding means repeatedly decodes said composite signal for each variation in said order to determine an actual signal strength order and wherein said decoding means finally decodes said composite signal based on said actual signal strength order.
Claim 5
Dependent Claim
43 words
The system according to claim 1, wherein said receiving means includes a memory for storing said composite signal received by said receiver, and said signal removal means includes a subtractor for subtracting said decoded signal from said composite signal stored in said memory.
Claim 6
Dependent Claim
67 words
The system according to claim 5, wherein said code ordering means includes: signal strength detecting means for detecting an actual signal strength of each of said information signals, reordering means for reordering said spreading codes based on said detected signal strengths, and wherein said decoding means retrospectively decodes said composite signal stored in said memory based on an order of spreading codes received from said reordering means.
Claim 7
Dependent Claim
48 words
A system according to claim 1, wherein said transmission means includes modulation means for modulating a radio frequency carrier wave with said spread coded information signal and said receiving means includes demodulation means for demodulating said composite signal and transmitting a demodulated, composite signal to said decoding means.
Claim 8
Dependent Claim
105 words
A multiple access, spread spectrum communications system for communicating information signals between plural stations using code division spread spectrum communications signals, each station comprising: a transmitter including: means for spreading an information signal with a corresponding, spreading code; a scrambling means for adding a scrambling bit sequence to said spread information; and means for transmitting said scrambled, spread-coded information signal; and receiving means for receiving a composite signal of overlapping, transmitted signals including: descrambling means for descrambling said composite signal using a scrambling bit sequence; and decoding means for recursively decoding said composite signal by correlating spreading codes to generate a series of decoded signals.
Claim 9
Dependent Claim
66 words
The system according to claim 8, said receiving means further comprising: recoding means for successively recoding said decoded signals using corresponding spreading codes to generate a series of recoded signals; rescrambling means for rescrambling said recoded signals using said scrambling bit sequence; signal removal means for successively removing said rescrambled signals from said composite signal; and code selection means for successively selecting a next spreading code.
Claim 10
Dependent Claim
27 words
The system according to claim 9, wherein said scrambling means and rescrambling means include a modulo-2 adder for adding a scrambling bit sequence to said spread information.
Claim 11
Dependent Claim
24 words
The system according to claim 10, wherein said descrambling means adds said modulo-2 scrambling bit sequence to said composite signal to perform said descrambling.
Claim 12
Dependent Claim
133 words
A multiple access, spread spectrum communications system for communicating information signals between plural stations using code division spread spectrum communications signals, each station comprising: a transmitter including: coding means for coding blocks of bit sequences of an information signal, and means for transmitting said block-coded information signal; and receiving means for receiving a composite signal of overlapping, transmitted signals, including: correlation means for recursively correlating said composite signal with block codes corresponding to said information signals; comparison means for determining a block code that generates a greatest correlation and for producing a correlated signal; signal removal means for successively removing said correlated signal from said composite signal; and inverse correlation means for recoding a residual portion of said correlated, composite signal using said corresponding block codes to generate a series of recoded signals.
Claim 13
Dependent Claim
15 words
The system according to claim 12, wherein said block codes are formed using Walsh-Hadamard matrices.
Claim 14
Dependent Claim
14 words
The system according to claim 12, wherein said block codes are orthogonal block codes.
Claim 15
Dependent Claim
14 words
The system according to claim 12, wherein said block codes are bi-orthogonal block codes.
Claim 16
Dependent Claim
65 words
The system according to claim 12, wherein said transmitter further includes: scrambling means for adding a scrambling bit sequence to said block-coded information; and said receiving means further includes: descrambling means for descrambling said composite signal using a selected scrambling code corresponding to one of said information signals; and rescrambling means for rescrambling said residual portion of said composite signal using said selected scrambling code.
Claim 17
Dependent Claim
36 words
The system according to claim 16, further comprising: code selection means for ordering individual scrambling codes according to the relative signal strengths of said information signals and selecting a scrambling code having a greatest signal strength.
Claim 18
Dependent Claim
21 words
The system according to claim 12, said receiving means further comprising: sampling means for generating N samples of said composite signal.
Claim 19
Dependent Claim
42 words
The system according to claim 18, wherein said correlation means is a Fast Walsh Transformation circuit for transforming N signal samples into a N-point Walsh spectrum where each point represents a correlation value corresponding to a single one of said block codes.
Claim 20
Dependent Claim
23 words
The system according to claim 19, wherein said signal removal means includes means for setting a point with a greatest magnitude to zero.
Claim 21
Dependent Claim
36 words
The system according to claim 20, wherein each point is a complex number having a real and an imaginary vector component and said comparison means includes means for determining a complex number having a greatest magnitude.
Claim 22
Dependent Claim
57 words
The system according to claim 20, wherein each point is a complex number having a real and an imaginary vector component and said comparison means includes means for determining a complex number having a greatest projection on a line at a particular angle and a sign of said projection relative to a particular direction along said line.
Claim 23
Dependent Claim
59 words
The system according to claim 20, wherein each point is a complex number having a real and an imaginary vector component and said comparison means includes means for determining a point having a correlation with a greatest projection on a line at a particular angle and a sign of said projection relative to a particular direction along said line.
Claim 24
Dependent Claim
44 words
The system according to claim 20, wherein each point is a complex number having a real and an imaginary vector component and said comparison means includes means for determining a point having a correlation with a greatest real component and a greatest imaginary component.
Claim 25
Dependent Claim
17 words
The system according to claim 12, wherein said inverse correlation means is a Fast Walsh Transformation circuit.
Claim 26
Dependent Claim
19 words
The system according to claim 12, wherein said correlation means and said inverse correlation means include identical transformation circuits.
Claim 27
Dependent Claim
35 words
A system according to claim 12, wherein said receiving means further comprises: bit shifting means for generating bit-shifted versions of said block codes and means for detecting delayed echos and pre-echos of said composite signal.
Claim 28
Dependent Claim
32 words
A communications system according to claim 27, wherein said correlation means correlates said composite signal correlation with said bit-shifted codes to determine a codeword with a greatest probability of having been transmitted.
Claim 29
Dependent Claim
19 words
A system according to claim 28, wherein echos of a previously decoded signal are subtracted from said composite signal.
Claim 30
Dependent Claim
132 words
In a multiple access, spread spectrum communications system for communicating information signals between plural stations using code division spread spectrum communications signals, a method comprising: spreading individual information signals from said stations using a corresponding, pseudo-random spreading code, wherein different information signals from different stations may have a same spreading code; scrambling each said spread-coded information signal using a unique, selected scrambling bit sequence corresponding to one of said stations; transmitting said scrambled, spread-coded signals from each station; receiving a composite signal of overlapping, transmitted signals; descrambling said composite signal using one of said unique scrambling bit sequences to distinguish spread-coded information signals from a selected station from other signals in said composite signal; and recursively decoding said composite signals by correlating selected spreading codes to generate a series of decoded signals.
Claim 31
Dependent Claim
26 words
The method of claim 30, further comprising: selecting a decoded signal having a greatest correlation, said decoded signal corresponding to one of said individual information signals.
Claim 32
Dependent Claim
49 words
The method of claim 30, further comprising: successively recoding said selected decoded signal using said corresponding spreading codes to generate a recoded signal; rescrambling said recoded signal using said selected scrambling bit sequence; successively removing said rescrambled signal from said composite signal; and selectively selecting a next spreading code.
Claim 33
Dependent Claim
24 words
The method of claim 32, wherein said spreading codes are selected in an order from greatest spread-coded signal strength to weakest spread-coded signal strength.
Claim 34
Dependent Claim
13 words
The method of claim 30, wherein said spreading codes are orthogonal block codes.
Claim 35
Dependent Claim
22 words
The method of claim 32, wherein said decoding corresponds to a Walsh transformation and said recoding corresponds to an inverse Walsh transformation.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.