US5218619A
Expired / Lapsed
US
⏱️ 0.0 years remaining
CDMA subtractive demodulation
Assignee: Ericsson Inc
•
Filing: 1991-08-02
•
Granted: 1993-06-08
•
Expires: 2011-08-02
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. Subtractive CDMA demodulation is enhanced by decoding the composite signal in the order of strongest to weakest signal strength. The individual information signals are spread using block error correction codes which are correlated with the composite signal using Fast Walsh transforms. Correlated signals identified as the largest transform component are removed from the composite signal and the remaining composite signal is reformulated using an inverted Fast Walsh transform. Any residual error or interference caused during the extraction of a transform component is removed by recorrelating the composite signal using the index of that transform component.
Inventors
- 👤 Paul W. Dent
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 02:19
CPC Classifications
H; H04; H04B; H04B1/00; H04B1/69; H04B1/707; H04B1/7097; H04B1/7103; H04B1/7107; H04B1/71072; H04B1/709; H04B7/00; H04B7/24; H04B7/26; H04B7/2628; H04J; H04J13/00; H04J13/0007; H04J13/004; H04J13/0048; H04B2001/71077; H04B2201/00; H04B2201/69; H04B2201/707; H04B2201/70703
Claims Analysis
Total Claims: 45
Claim 1
Independent Claim
101 words
A method for decoding a composite signal having overlapping, coded signals, comprising: (a) iteratively correlating said composite signal with a series of codewords and generating for each correlation a plurality of correlation signals; (b) extracting a coded signal corresponding to a greatest correlation signal from said composite signal, said greatest correlation having an address associated with one of said correlated code words; (c) periodically recorrelating a remaining portion of said composite signal with said codewords; and (d) eliminating any correlation signal corresponding to said associated address of at least one codeword previously correlated in step (a) from said remaining composite signal.
Claim 2
Independent Claim
101 words
A method for decoding a composite signal having overlapping, coded signals, comprising: (a) iteratively correlating said composite signal with a series of codewords and generating for each correlation a plurality of correlation signals; (b) extracting a coded signal corresponding to a greatest correlation signal from said composite signal, said greatest correlation having an address associated with one of said correlated code words; (c) periodically recorrelating a remaining portion of said composite signal with said codewords; and (d) eliminating any correlation signal corresponding to said associated address of at least one codeword previously correlated in step (a) from said remaining composite signal.
Claim 3
Dependent Claim
14 words
The method according to claim 1, wherein said correlating step includes a Walsh-Hadamard transformation.
Claim 4
Dependent Claim
14 words
The method according to claim 1, wherein said correlating step includes a Fourier transformation.
Claim 5
Dependent Claim
14 words
The method according to claim 1, wherein said correlating step includes an orthogonal transformation.
Claim 6
Dependent Claim
31 words
The method according to claim 1, wherein said coded signals are complex vectors having real and imaginary components, said real and imaginary components both being correlated in said correlating step (a).
Claim 7
Dependent Claim
18 words
The method according to claim 1, wherein said coded signals are extracted based on their relative signal strengths.
Claim 8
Dependent Claim
22 words
The method according to claim 1, wherein said at least one codeword corresponds to the coded signal initially extracted in step (b).
Claim 9
Independent Claim
102 words
A system for decoding a composite signal having overlapping, coded signals, comprising: means for iteratively performing orthogonal transformations on said composite signal with a series of codeword and generating for each transformation a plurality of transformation components, each transformation component being associated with a codeword and an index; means for iteratively extracting the coded signal corresponding to a greatest component from said composite signal; means for periodically performing at least one orthogonal transformation on a remaining portion of said composite signal with said codewords; and means for eliminating any transformation component corresponding to said associated index of at least one previous codeword.
Claim 10
Independent Claim
102 words
A system for decoding a composite signal having overlapping, coded signals, comprising: means for iteratively performing orthogonal transformations on said composite signal with a series of codeword and generating for each transformation a plurality of transformation components, each transformation component being associated with a codeword and an index; means for iteratively extracting the coded signal corresponding to a greatest component from said composite signal; means for periodically performing at least one orthogonal transformation on a remaining portion of said composite signal with said codewords; and means for eliminating any transformation component corresponding to said associated index of at least one previous codeword.
Claim 11
Dependent Claim
13 words
The system according to claim 8, wherein said orthogonal transformations are Walsh-Hadamard transformations.
Claim 12
Dependent Claim
13 words
The system according to claim 8, wherein said orthogonal transformations are Fourier transformations.
Claim 13
Dependent Claim
23 words
The system according to claim 8, wherein said extracting means extracts said coded signals in an order based on their relative signal strengths.
Claim 14
Dependent Claim
24 words
The system according to claim 11, wherein said at least one previous codeword corresponds to the coded signal first extracted by said extracting means.
Claim 15
Independent Claim
99 words
A method for decoding a composite signal having overlapping, coded signals, comprising: (a) iteratively performing orthogonal transformations on said composite signal with a plurality of codeword and generating for each transformation a plurality of transformation components, each transformation component having an associated codeword and index; (b) iteratively extracting a coded signal corresponding to a greatest transformation component from said composite signal; (c) periodically performing at least one orthogonal transformation on a remaining portion of said composite signal using said codewords; and (d) eliminating any transformation component corresponding to said associated index of at least one previously extracted coded signal.
Claim 16
Independent Claim
99 words
A method for decoding a composite signal having overlapping, coded signals, comprising: (a) iteratively performing orthogonal transformations on said composite signal with a plurality of codeword and generating for each transformation a plurality of transformation components, each transformation component having an associated codeword and index; (b) iteratively extracting a coded signal corresponding to a greatest transformation component from said composite signal; (c) periodically performing at least one orthogonal transformation on a remaining portion of said composite signal using said codewords; and (d) eliminating any transformation component corresponding to said associated index of at least one previously extracted coded signal.
Claim 17
Dependent Claim
50 words
The method according to claim 13, wherein said performing step (a) includes: (e) descrambling said composite signal using a scrambling code associated with the coded signal to be decoded; (f) transforming said signal descrambled in step (e) based on said plurality of codewords and generating said plurality of transformation components.
Claim 18
Dependent Claim
62 words
The method according to claim 14, wherein said extracting step (b) includes: (g) determining a transformation component having the greatest magnitude as the decoded signal; (h) removing said decoded signal from said composite signal; (i) inversely transforming said remaining components; (j) rescrambling said inversely transformed composite signal with said scrambling code used in step (e); and (k) selecting a next scrambling code.
Claim 19
Dependent Claim
39 words
The method according to claim 15, further comprising: (l) ordering said scrambling codes according to a signal strength of each associated coded signal; wherein said selecting step (k) includes selecting said next scrambling code based on its relative order.
Claim 20
Dependent Claim
28 words
The method according to claim 16, wherein said ordering step (1) includes: (n) predicting said order based on a recent history of signal strengths of said coded signals.
Claim 21
Dependent Claim
48 words
The method according to claim 15, wherein said performing step (c) includes: (o) descrambling said remaining composite signal using a scrambling code associated with a previously extracted coded signal, and (p) transforming said descrambled signal in step (o) using said codewords and generating a plurality of transformation components.
Claim 22
Dependent Claim
50 words
The method according to claim 18, wherein said eliminating step (d) includes: (q) setting to zero any transformation component corresponding to said associated index; (r) inversely transforming the remaining transformation components; (s) rescrambling said inversely transformed composite signal generated in step (r) with said scrambling code used in step (o).
Claim 23
Dependent Claim
25 words
The method according to claim 18, wherein said scrambling code used in step (o) is selected based on relative signal strengths of said coded signals.
Claim 24
Dependent Claim
26 words
The method according to claim 20, wherein said scrambling code in step (o) is the scrambling code associated with the coded signal having greatest signal strength.
Claim 25
Dependent Claim
58 words
The method according to claim 15, further comprising: (t) collecting a number of samples of said composite signal; (u) algebraically combining said samples; (v) dividing the combination resulting from step (u) by the number of samples combined to produce a quotient; and (w) algebraically combining said quotient with said samples using the combining process followed in step (u).
Claim 26
Independent Claim
82 words
A system for decoding a composite signal having overlapping, coded signals, comprising: plural signal extraction stages, each stage having means for receiving said composite signal and a series of codewords and means for extracting from said composite signal a coded signal associated with one of said codewords, and at least one signal elimination stage having means for eliminating from a remaining portion of said composite signal a residual signal associated with one of said coded signals previously extracted by said extracting means.
Claim 27
Independent Claim
82 words
A system for decoding a composite signal having overlapping, coded signals, comprising: plural signal extraction stages, each stage having means for receiving said composite signal and a series of codewords and means for extracting from said composite signal a coded signal associated with one of said codewords, and at least one signal elimination stage having means for eliminating from a remaining portion of said composite signal a residual signal associated with one of said coded signals previously extracted by said extracting means.
Claim 28
Dependent Claim
30 words
The system according to claim 23, wherein said elimination stage includes plural elimination stages, each elimination stage eliminating residual signals associated with different ones of said coded signals previously extracted.
Claim 29
Dependent Claim
69 words
The system according to claim 23, wherein each signal extraction stage further comprises: first means for descrambling said composite signal using a scrambling code associated with the coded signal to be decoded; first means for transforming said descrambled signal and generating a plurality of transformation components each component having an associated codeword; and first means for transmitting a remaining portion of said composite signal to a next extraction stage.
Claim 30
Dependent Claim
59 words
The system according to claim 25, wherein said extracting means includes: means for determining a transformation component having a greatest magnitude as a decoded signal; means for removing said decoded signal; first means for inversely transforming remaining transformation components; and first means for rescrambling said inversely transformed signals to generate said remaining composite signal using said associated scrambling code.
Claim 31
Dependent Claim
121 words
The system according to claim 26, wherein said elimination stage includes: second means for descrambling said remaining composite signal using a previous scrambling code associated with a coded signal previously extracted in a prior extraction stage; second means for transforming said descrambled signal received from said second descrambling means based on said codewords and generating a plurality of second transformation components, means for setting to zero any second transformation component signal corresponding to a codeword associated with said previously extracted signal; second means for inversely transforming remaining transformation components; second means for rescrambling signals received from said second inverse transform means to generate said remaining composite signal; and means for transmitting said rescrambled composite signal to a next signal extraction stage.
Claim 32
Dependent Claim
34 words
The system according to claim 27, wherein said scrambling codes are selected based on a signal strength of the associated coded signal relative to signal strengths of all coded signals in said composite signal.
Claim 33
Dependent Claim
28 words
The system according to claim 28, wherein said scrambling code associated with a previously decoded signal having a greatest signal strength is selected by said second descrambling means.
Claim 34
Dependent Claim
34 words
The system according to claim 23, wherein each signal extraction stage sequentially extracts coded signals in an order based on relative signal strength such that a first extraction stage extracts a strongest coded signal.
Claim 35
Independent Claim
98 words
A method for decoding a composite signal having overlapped, coded signals and time-delayed echoes of at least some of said coded signals, comprising: (a) correlating a series of codewords with a plurality of time-shifted versions of said composite signal and generating a set of correlations for each time-shifted composite signal; (b) combining all of said sets of correlations for said time-shifted composite signals to produce a combined set of correlations; (c) determining a codeword corresponding to a greatest correlation in said combined set; and (d) subtracting said determined codeword from at least one of said time-shifted composite signals.
Claim 36
Independent Claim
98 words
A method for decoding a composite signal having overlapped, coded signals and time-delayed echoes of at least some of said coded signals, comprising: (a) correlating a series of codewords with a plurality of time-shifted versions of said composite signal and generating a set of correlations for each time-shifted composite signal; (b) combining all of said sets of correlations for said time-shifted composite signals to produce a combined set of correlations; (c) determining a codeword corresponding to a greatest correlation in said combined set; and (d) subtracting said determined codeword from at least one of said time-shifted composite signals.
Claim 37
Dependent Claim
22 words
A method according to claim 31, wherein said combining step (b) includes adding squared magnitudes of corresponding values from each correlation set.
Claim 38
Dependent Claim
32 words
A method according to claim 31, wherein said combining step (b) includes weighting and adding corresponding values from each correlation set using a complex weighting factor associated with each time-shifted composite signal.
Claim 39
Dependent Claim
16 words
A method according to claim 31, wherein said correlating step (a) is performed using Walsh-Hadamard Transformations.
Claim 40
Dependent Claim
29 words
A method according to claim 34, wherein said subtracting step (d) includes setting to zero a component of said Walsh-Hadamard Transformation and further includes performing an inverse Walsh-Hadamard Transformation.
Claim 41
Dependent Claim
27 words
A method according to claim 31, wherein said subtracting step (d) is performed on each time-shifted composite signal in an order depending on their respective signal strengths.
Claim 42
Dependent Claim
33 words
A method according to claim 36, wherein said order is a descending order of magnitude of the correlation in each of said sets of correlations corresponding to said codeword determined in step (c).
Claim 43
Dependent Claim
41 words
A method according to claim 37, wherein a set of correlations corresponding to a time-shifted composite signal exhibiting a lower correlation magnitude is recomputed after said subtracting step (d) is completed on a time-shifted composite signal exhibiting a higher correlation magnitude.
Claim 44
Dependent Claim
28 words
A method according to claim 35, wherein before said correlating step (a) said composite signal is descrambled with a scrambling code corresponding to a signal to be decoded.
Claim 45
Dependent Claim
17 words
A method according to claim 39, wherein said inverse transformed signal is rescrambled using said scrambling code.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-06-07 | 1996-12-07 | 1997-06-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-06-07 | 2000-12-07 | 2001-06-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-06-07 | 2004-12-07 | 2005-06-08 | $7700.00 | Window Closed / Lapsed |