Linear space-time multiuser detector
Abstract
Linear space-time multiuser detectors are described that combine array processing, rake detection, and multiuser detection and that satisfy a minimum mean-squared error criteria. Both embodiments can be implemented adaptively so as to account for unknown sources of interference. The adaptive implementation of the first embodiment of a linear space-time detector requires explicit estimates of the channel coefficients. On the other hand, the adaptive implementation of the second embodiment does not require these estimates since they can be adaptively obtained. Both of these detectors provide significant performance advantages over single-user space-time detectors and over multiuser detectors which do not account for CDMA interference from unknown sources.

Term
Term ended
Projected expiry passed 26 July 2019, 7.2 years ago.
- Priority
- Filed
- Published
- Projected expiry
- Today
37 claims: 9 independent, 28 dependent
- 1A method for detecting the data signals modulated respectively by multiple direct-sequence spread spectrum signals, comprising the steps of a) generating matched filter outputs for at least a subset of the multiple signals, a plurality of the multipath components of these signals, and a plurality of receiver antennas;b) developing coherent channel estimates;c) weighting and combining the matched filter outputs using the coherent channel estimates;and d) estimating the respective data symbols for at least a subset of the spread spectrum signals while suppressing multiple access interference.
- 24Apparatus for use in detecting at a receiver in a wireless system with multiple transmitted direct-sequence spread spectrum signals, comprising:a) means for generating matched filter outputs for at least a subset of the multiple signals, a plurality of the multipath components of these signals, and a plurality of receiver antennas;b) means for developing coherent channel estimates from the matched filter outputs;c) means for weighting and combining the matched filter outputs using the coherent channel estimates;and d) means for estimating the respective data signals for at least a subset of the spread spectrum signals while suppressing multiple access interference.
- 25A receiver comprising:a) space-time rake receiver having: i) a bank of correlators for resolving K code-spread data signals s 1 , s 2 ,..., s K bearing respective data b 1 , b 2 ,..., b K each with at most L resolvable multipath components with complex amplitude c k,l ( k = 1,2,...,K;l = 1,2,... ,L ), arriving at a P element antenna array with complex amplitude h k,l,p (p = 1,2,..., P ) into at most KLP correlator outputs corresponding to at most L multipath signals for each of the K users at each of the P antenna array elements;ii) means for weighting the output of each correlator according to the complex conjugate of an estimate of the coefficient for a respective channel and path ( h ^ * k , l , p c ^ * k , l );iii) means for summing together the weighted resulting LP complex values for each user, and iv) means for forming a K -vector of the K resulting summations;with b) means for applying a linear combiner to the K -vector to suppress multiple access interference;and c) means for processing the resulting signals to produce estimates of the respective data symbols.
- 28A receiver comprising:a bank of correlators for despreading K code-spread data signals s 1 , s 2 ,..., s K bearing respective data b 1 , b 2 ,..., b K each with at most L resolvable multipath components to form a K -vector, means for applying a linear combiner to the K -vector to suppress multiple access interference;and means for processing the output of the linear combiner to produce estimates of the respective data symbols.
- 30A method of demodulating K direct sequence code-spread data signals subjected to L -path frequency-selective fading, received at an array of P antennas comprising:despreading with a bank of filters matched to L multipath delayed replicas of each of the K signals received at each of the P antennas;weighting the despread signals with the complex conjugate of an estimate of the ray/channel coefficient;summing together the weighted, despread signals to form a K -vector;applying a linear transform to the K -vector to suppress multiple access interference;and processing the resulting signals to produce estimates of the respective data symbols.
- 32A method of demodulating K direct sequence code-spread data signals subjected to L -path frequency-selective fading, received at an ray of P antennas comprising:a) despreading with a bank of filters matched to L multipath delayed replicas of each of the K signals received at each of the P antennas to produce a K -vector, b) applying a linear transform to the K -vector to combine the matched filter outputs and suppress multiple access interference;and c) processing the resultant signals to produce estimates of the respective data symbols.
- 34A receiver for use with direct-sequence spread spectrum signals, comprising:a rake receiver with array processing;and a multiuser detector receiving an output of said rake receiver.
- 36A system for detecting the data signals modulated respectively by multiple direct-sequence spread spectrum signals, comprising:a plurality of space diversity antennas;a plurality of matched filters associated with said antennas for providing a plurality of outputs ( z 1 ... z p ) for at least a subset of the multiple signals, a plurality of the multipath components of these signals, and a plurality of receiver antennas;a circuit for obtaining coherent channel estimates ( h ^ k , l , p c ^ k , l ) from the matched filter outputs;a second circuit for weighting and combining the matched filter outputs using the coherent channel estimates;and a third circuit for estimating the respective data symbols for at least a subset of the spread spectrum signals while suppressing multiple access interference.
- 37A receiver comprising a processor for executing software, said software being in a computer readable medium and being for detecting the data signals modulated respectively by multiple direct-sequence spread spectrum signals, said software causing said processor to perform at least the steps of:a) generating matched filter outputs for at least a subset of the multiple signals, a plurality of the multipath components of these signals, and a plurality of receiver antennas;b) developing coherent channel estimates from the matched filter outputs;c) weighting and combining the matched filter outputs using the coherent channel estimates;and d) estimating the respective data symbols for at least a subset of the spread spectrum signals while suppressing multiple access interference.
Independent claims9
53 paragraphs, as filed
Field of the Invention
0001This invention relates generally to direct sequence (DS) code division multiplex access (CDMA) systems subjected to multipath fading and multiple access interference (MAI), and more particularly to signal detection techniques for use in such systems.
Background of the Invention
0002In wireless CDMA systems such as those proposed for next generation mobile wireless standards, the major impediments at the physical layer are multipath fading and multiple access interference caused by co-channel users which are not orthogonal to the desired user. The rake receiver, described in R. Price and P. E. Green, "A Communication Technique for Multipath Channels," Proceedings of the IRE, Vol. 46, pp. 555-570, March 1958, attempts to combat multipath fading by coherently combining resolvable multipath replicas of the desired signal. Multiuser detection described in S. Verdú, "<i>Multiuser Detection</i>," Cambridge University Press, New York, 1998, addresses the problem of MAI by actively accounting for its presence when detecting the desired user.
0003More recently, there has been growing interest in using array processing for further improving receiver performance. These techniques have focused on using multiple antennas at the base station receiver to provide antenna gain and/or diversity gain and allow the possibility of spatial processing. By combining these space-domain techniques with time domain techniques like rake detection and multiuser detection, the resulting space-time detectors show promise of improving the capacity of CDMA systems as compared to traditional time-domain-only detectors. See, for example, A. Paulraj and C. Papadias, "Space-Time Processing for Wireless Communications," IEEE Signal Processing Magazine, Vol. 14, No. 6, pp. 49-83, Nov. 1997. The first generation of space-time CDMA detectors used array processing with either rake detection or multi-user detection. See, respectively, A. Naguib and A. Paulraj, "Performance of Wireless CDMA with <i>M</i>-ary Orthogonal Modulation and Cell Site Antenna Arrays," IEEE Journal on Selected Areas in Communications, Vol. 14, No. 9, pp. 1770-1783, Dec. 1996 or S. Miller and S. Schwartz, "Integrated Spatial-Temporal Detectors for Asynchronous Gaussian Multiple-Access Channels," IEEE Transactions on Communications, Vol. 43, No. 2/3/4, pp. 396-411, Feb./Mar./Apr. 1995. Later space-time CDMA detectors combined all three processing techniques. See: H. Huang; S. Schwartz, S. Verdú, "Combined Multipath and Spatial Resolution for Multiuser Detection: Potentials and Problems," Proceedings of the IEEE International Symposium on Information Theory, p. 380, 1995; or M. Nagatauka and R Kohno, "A Spatially and Temporally Optimal Multi-User Receiver Using an Array Antenna for DS/CDMA" IEICE Transactions on Communications, Vol. E78-B, No. 11, pp. 1489-1497, Nov. 1995.
0004While the foregoing systems operate satisfactorily, improvements can be made, in particular to the space-time detectors which combine all three processing techniques. While the detector in the Nagatsuka and Kohno paper is optimum in the maximum likelihood sense, its computational complexity is exponential with respect to the number of users. Hence it is too complex to implement for practical systems. In the paper by Huang, Schwartz and Verdú, a tradeoff between performance and complexity is made, but this detector was not implemented adaptively since it used a zero-forcing criteria. Adaptive implementations allow receivers to account for unknown sources of interference thus improving the detector performance and increasing the system capacity. For example, a base station receiver could account for interference from adjacent cells or from an embedded microcell, while a handset receiver could account for interference from signals it is not explicitly demodulating.
Summary of the Invention
0005This invention detects DS-CDMA signals utilizing a rake receiver, array processing, and multiuser detection. When combined with array processing, the rake receiver is often called a space-time rake receiver. The invention uses a minimum mean-squared error (MMSE) criterion in the multiuser detector. This criterion allows for relatively simple implementation in the form of a linear detector and also allows for adaptive implementation. Adaptive implementations are useful in practical situations where there is limited knowledge of the various received signals. As discussed above, both uplink and downlink capacity can be improved using adaptive detectors which account for unknown interference.
0006For pulse amplitude modulated (PAM) data signals, two embodiments of the invention provide options for trading off between performance and adaptive implementation complexity. The first embodiment performs better if there is perfect knowledge of the users' signal parameters. On the other hand, it requires more explicit channel information for adaptive implementation. Suppose the receiver consists of <i>P</i>≥ 1 antennas and the received signal consists of <i>K</i> DS-CDMA data signals, each with <i>L</i> delayed/weighted multipath replicas. At each antenna, a bank of filters is matched to the <i>KL</i> spreading codes with their multipath timing delays. The filter outputs are weighted according to the complex conjugate of the estimated channel (multipath and array) parameters and combined to form a <i>K</i>-vector where each component corresponds to one of the <i>K</i> codes. The real part of each component is taken. Estimates of the multipath delays and channel parameters may be obtained, for example, from a training or pilot signal. The conventional space-time rake receiver would pass each vector component to a decision device for estimating the corresponding user's PAM data symbol. However, unless the users' signals are orthogonal in the space-time domain, the vector components are contaminated with multiaccess interference from the other users. This invention proposes the use of a linear combiner prior to the decision devices to suppress the multiaccess interference. This linear combiner is represented by a real <i>K</i>-by-<i>K</i> matrix <i>W</i><sub><i>A</i></sub> which multiplies the real <i>K</i>-vector. The matrix minimizes the mean squared error between its product with the real <i>K</i>-vector and the <i>K</i>-vector of data symbols. Because the matrix uses the minimum mean-squared error(MMSE)criterion, well-known adaptive algorithms can be used to adaptively obtain it. Each component of the final <i>K</i>-vector output corresponds to one of the <i>K</i> codes and is passed to either a decision slicer or a decoder for further processing.
0007The second embodiment has marginally inferior performance when the channel parameters are known exactly. However, under practical conditions of channel mismatch, the second embodiment often performs better. In terms of adaptive implementation, this embodiment requires less information (it does not require explicit channel estimates) but may be slower to adapt. As with the first embodiment, the front end of the second embodiment consists again of a bank of <i>KL</i> matched filters for each of the <i>P</i> antennas followed by weighting and combining. However, unlike the first embodiment, the order of the real operator and linear combiner(<i>K</i>-by-<i>K</i> matrix multiplication) are exchanged. In doing so, the weighting, combining, and linear combiner can be represented by a single complex <i>K</i>-by-<i>KLP</i> matrix <i>W</i><sub><i>B</i></sub>. The real parts of the components in the resulting <i>K</i>-vector are passed to either a decision device or a decoder for further processing. In the adaptive implementation, adaptive algorithms can be used to obtain the matrix <i>W</i><sub><i>B</i></sub>; hence channel estimates are not explicitly required.
0008For quadrature PAM (QAM) data signals, real operators are not required in the detector since the signal constellation is two-dimensional. In this case, a variation on the second embodiment would be used which does not use the real operators but follows the liner combiner directly with the appropriate decision device or decoder.
0009While the MMSE detection techniques are powerful in and of themselves, their performance can be further enhanced by using them with other multiuser detection techniques such as interference cancellation where interference, instead of being projected away as is done with linear multiuser detectors, is explicitly subtracted from the received signal. Interference cancellation can occur prior to or after the MMSE linear combiner.
0010Both embodiments of the MMSE detector can be generalized for practical systems which utilize, in addition to the data bearing channels, supplemental channels which may serve as pilot signals. Also, the MMSE detectors can operate in systems where signals are transmitted with different spreading factors.
0011A CDMA signal detector in accordance with the invention can provide significantly improved performance relative to a conventional signal detector which does not use multiuser detection or which does use multiuser detection but does not adaptively mitigate unknown interference.
Brief Description of the Drawings
0012The foregoing and other features of the invention may become more apparent when the ensuing description is read together with the drawings, in which: <ul id="ul0001" list-style="none" compact="compact"><li>Figure 1 shows a prior art single-user space-time rake receiver employing a multi-element antenna array, a bank of <i>N</i>-chip filters at each antenna, and a channel weighter and combiner;</li><li>Figure 2 shows the generic embodiment of the invention;</li><li>Figure 3 shows a first embodiment (Detector A) of the multiuser space-time MMSE detector,</li><li>Figure 4 shows a second embodiment (Detector B) of the multiuser space-time MMSE detector,</li><li>Figure 5 shows an adaptive implementation of the second embodiment;</li><li>Figure 6 shows interference cancellation located prior to the linear combiner of the first embodiment;</li><li>Figure 7 shows interference cancellation located prior to the linear combiner of the second embodiment; and</li><li>Figure 8 shows interference cancellation following the linear combiner of the multiuser space-time MMSE detector in accordance with the invention.</li></ul>
General Description
0013Consider a <i>K</i> user system where the <i>k</i>th user (<i>k</i> = 1 ... <i>K</i>) modulates its data sequence <i>b</i><sub><i>k</i></sub>(<i>t</i>) with an N-chip spreading sequence <i>s</i><sub><i>k</i></sub>(<i>t</i>). For Detector A, the data sequence is pulse amplitude modulated (PAM); for Detector B, the data sequence can be either PAM or quadrature PAM (QAM).. The transmitted signal undergoes frequency-selective fading in the channel and arrives at the receiver as <i>L</i> time-resolvable multipath components with complex fading channel coefficients <i>c</i><sub><i>k,l</i></sub>(<i>t</i>)...<i>c</i><sub><i>k,L</i></sub>(<i>t</i>). Assume that the receiver is a <i>P</i>-element linear array. If each resolvable multipath component arrives as a planar wavefront with angle θ <sub><i>k,l</i></sub>(<i>t</i>) with respect to a linear array and if the array spacing is sufficiently close (e.g., λ/2) so that there is perfect correlation among array elements for a given wavefront, then the phase offset of the pth element, with respect to the first is <maths id="math0001"><math display="inline"><mrow><msub><mrow><mtext mathvariant="italic">h</mtext></mrow><mrow><mtext mathvariant="italic">k,l,p</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)=exp(π(</mtext><mtext mathvariant="italic">p</mtext><msub><mrow><mtext>-1)sinθ</mtext></mrow><mrow><mtext mathvariant="italic">k,l</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>))</mtext></mrow></math><img file="EP0978951A2_D0001.tif" /></maths>. The received signal at the <i>p</i>th antenna for given symbol period (and ignoring intersymbol interference) is:<maths id="math0002" num="(1)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">r</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)= </mtext><apply><sum /><lowlimit><mtext mathvariant="italic">k</mtext><mtext>=1</mtext></lowlimit><uplimit><mtext mathvariant="italic">K</mtext></uplimit><mrow /></apply><apply><sum /><lowlimit><mtext mathvariant="italic">l</mtext><mtext>=1</mtext></lowlimit><uplimit><mtext mathvariant="italic">L</mtext></uplimit><mrow><msub><mrow><mtext mathvariant="italic">h</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext><mtext>,</mtext><mtext mathvariant="italic">l</mtext><mtext>,</mtext><mtext mathvariant="italic">p</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)</mtext><msub><mrow><mtext mathvariant="italic">c</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext><mtext>,</mtext><mtext mathvariant="italic">l</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)</mtext><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><msub><mrow><mtext>-τ</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext><mtext>,</mtext><mtext mathvariant="italic">l</mtext></mrow></msub><mtext>)</mtext><msub><mrow><mtext mathvariant="italic">A</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext></mrow></msub><mtext mathvariant="italic">b</mtext><mtext>(</mtext><mtext mathvariant="italic">t</mtext><msub><mrow><mtext>-τ</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext><mtext>,</mtext><mtext mathvariant="italic">l</mtext></mrow></msub><mtext>)+</mtext><msub><mrow><mtext mathvariant="italic">n</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)</mtext></mrow></apply></mrow></math><img file="EP0978951A2_D0002.tif" /></maths> where <i>A</i><sub><i>k</i></sub> is the amplitude for user k, τ<sub><i>k,l</i></sub> is the delay for the <i>k</i>th user's <i>l</i>th multipath, and <i>n</i><sub><i>p</i></sub>(<i>t</i>) is the additive Gaussian noise process which accounts for out-of-cell interference and background noise. We now make the following assumptions to simplify the analysis. <ul id="ul0002" list-style="none" compact="compact"><li>(a) The signals are received bit synchronously.</li><li>(b) The time spread is small compared to the symbol period so that intersymbol interference can be ignored.; and</li><li>(c) The phase offsets and channel coefficients are constant over a symbol period.</li></ul> The first assumption will be dropped later. Under these assumptions, the chip matched-filter output for the received signal in equation (1) is a complex <i>N</i>-vector<maths id="math0003"><img file="EP0978951A2_D0003.tif" /></maths> where <b>s</b><sub><i>k,l</i></sub> is the chip matched-filter N-vector corresponding to S<sub><i>k</i></sub>(<i>t</i> -τ<sub><i>k,l</i></sub>) and <b>n</b><sub><i>p</i></sub>, is the complex N-vector corresponding to the Gaussian noise. The spreading codes are normalized to have unit energy:<maths id="math0004"><img file="EP0978951A2_D0004.tif" /></maths> The spreading codes are assumed to be random. However, adaptive implementations of these MMSE detectors require the use of short spreading codes which repeat after a few symbol periods. The following notation will be used hereinafter: <dl id="dl0001" compact="compact"><dt><b>h</b><sub><i>k,l</i></sub>=[<i>h</i><sub><i>k,l,</i></sub><sub>1</sub>..<i>h</i><sub><i>k,l,P</i></sub>]<sup><i>T</i></sup></dt><dd>complex <i>P</i>-vector of array coefficients</dd><dt><b>H</b>=[<b>h</b><sub>1,1</sub>...<b>h</b><sub>1,<i>L</i></sub>...<b>h</b><sub><i>K,</i></sub><sub>1</sub>...<b>h</b><sub><i>K,L</i></sub>]</dt><dd>complex <i>P</i> x <i>KL</i> array matrix</dd><dt><b>H</b><sup>D</sup> = <i>diag</i>(<b>h</b><sub>1,1</sub>...<b>h</b><sub>1,<i>L</i></sub>...<b>h</b><sub><i>K</i></sub><sub>,1</sub>...<b>h</b><sub><i>K,L</i></sub>)</dt><dd>complex <i>KLP</i> x <i>KL</i> array matrix</dd><dt><b>c</b><sub><i>k</i></sub> =[<i>c</i><sub><i>k</i></sub><sub>,1</sub>...<i>c</i><sub><i>k</i></sub><sub>,<i>L</i></sub>]<sup><i>T</i></sup></dt><dd>complex <i>L</i>-vector of channel coeffic'ts</dd><dt><b>C</b>= <i>diag</i>(c<sub>1</sub>...c<sub><i>K</i></sub>)</dt><dd>complex <i>KL</i> x <i>K</i> channel matrix</dd><dt><b>R</b></dt><dd>complex <i>KL</i> x <i>KL</i> correlation matrix defined by:<maths id="math0005"><img file="EP0978951A2_D0005.tif" /></maths></dd><dt><b>A</b> = <i>diag</i>(A<sub>1</sub>...A<sub><i>K</i></sub>)</dt><dd>real <i>K</i> x <i>K</i> amplitude matrix</dd><dt><b>b</b>=[<i>b</i><sub>1</sub>...<i>b</i><sub><i>k</i></sub>]<sup><i>T</i></sup></dt><dd>real <i>K</i>-vector of data bits</dd><dt><b>I</b><sub><b><i>u</i></b></sub></dt><dd><i>u</i> x <i>u</i> identity matrix</dd><dt><b>1</b><sub><b><i>u</i></b></sub></dt><dd><i>u</i>-vector of ones</dd><dt><b>0</b><sub><b><i>uxu</i></b></sub></dt><dd><i>u</i> x <i>u</i> matrix of zeros</dd><dt><b>0</b><sub><b><i>u</i></b></sub></dt><dd><i>u</i>-vector of zeros</dd></dl> The corresponding estimated values for the array and channel coefficients will be represented with the symbol "^" over the symbol for the value. The noise vector is a zero-mean complex Gaussian vector whose distribution can be written in terms of its (component-wise) real and imaginary components:<maths id="math0006"><img file="EP0978951A2_D0006.tif" /></maths> where we define the real and imaginary operations for matrices and vectors as<maths id="math0007"><img file="EP0978951A2_D0007.tif" /></maths> where * denotes the complex conjugate. Hence Re(<b>n</b>) and Im(<b>n</b>) are zero-mean Gaussian random vectors whose components have variance σ<sup>2</sup> and are mutually uncorrelated.
Conventional (Space-Time Rake) Receiver, (Figure 1)
0014In the context of this array-multipath channel, the prior art single user detector is a correlator matched to the desired user's composite array-multipath-spreading code signal. This detector does not account for the presence of interferers; however, it is the maximum-likelihood detector if there are no interferers or if they are orthogonal to the desired user in array-code space. As shown in Figure 1, the detector consists of a bank of correlators 10 at each antenna, matched to the <i>KL</i> multipath spreading codes <b>s</b><sub>1,1</sub>...<b>s</b><sub>1,<i>L</i></sub>...<b>s</b><sub><i>K</i></sub><sub>,1</sub>...<b>s</b><sub><i>K</i></sub><sub>,<i>L</i></sub>. The notation 〈<b>s</b><sub><i>k,l</i></sub><i>;</i>〉 in the left-most boxes of Figure 1 indicates taking the inner product between <b>s</b><sub><i>k,l</i></sub> (the <i>k</i>th user's spreading code corresponding to the <i>l</i>th multipath delay) and the input vector to the box. The dot in the notation 〈<b>s</b><sub><i>k,l</i></sub><i>;</i>〉 represents the input. The timing estimates are obtained using a separate timing estimation algorithm. The output of the upper left-hand box (which corresponds to the first component of the vector <b>z</b><sub>1</sub>) is<maths id="math0008"><img file="EP0978951A2_D0008.tif" /></maths> where the <i>H</i> superscript signifies the Hermitian transpose (take the complex conjugate of each element, then take the transpose of the resulting vector) of a complex vector. The matched filter outputs for at least a subset of the multiple signals, a plurality of the multipath components of these signals, and a plurality of receiver antennas are indicated in the drawing at (<b>z</b><sub>1</sub> ... <b>z</b><sub><i>P</i></sub>)
0015At reference number 11, the correlator outputs are weighted by the complex conjugate of their corresponding channel estimate. More specifically, the correlator output at the <i>p</i>th antenna for the <i>l</i>th multipath of user <i>k</i> is weighted by the complex conjugate of the estimate of the corresponding channel (array/multipath) coefficient <maths id="math0009"><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="italic">h</mtext></mrow><mo>^</mo></mover></mrow></math><img file="EP0978951A2_D0009.tif" /></maths><sub><i>k</i>,<i>l</i>,<i>p</i></sub><maths id="math0010"><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="italic">c</mtext></mrow><mo>^</mo></mover></mrow></math><img file="EP0978951A2_D0010.tif" /></maths><sub><i>k</i>,<i>l</i></sub>. These estimates are obtained using a separate channel estimation algorithm. At each antenna, the <i>L</i> components for the <i>k</i>th user are added (12), and then the resulting <i>P</i> components for the <i>k</i>th user are added 13<sub><i>k</i></sub> (<i>k</i> = 1 ... <i>K</i>). Each component is then passed to either a decision device or a decoder. For PAM data signals, the decision device for the <i>k</i>th user (14<sub><i>k</i></sub>, k= 1 ... <i>K</i>) gives as its output the symbol which is closest in the Euclidean distance sense to the real part of a <i>k</i>th vector component. For QAM data signals, the real operator is not required.
0016From Figure 1, the <i>KLP</i>-vector<maths id="math0011"><img file="EP0978951A2_D0011.tif" /></maths> at the output of the matched filters can be written as:<maths id="math0012"><img file="EP0978951A2_D0012.tif" /></maths> where we define the <i>KLP</i> x <i>KLP</i> matrix<maths id="math0013"><img file="EP0978951A2_D0013.tif" /></maths> and the <i>KLP</i> x <i>KL</i> matrix , ⊗ denotes the Kronecker product operation between two matrices, and the complex noise vector is a complex Gaussian random vector with distribution<maths id="math0014"><img file="EP0978951A2_D0014.tif" /></maths>
0017Using the fact that<maths id="math0015"><img file="EP0978951A2_D0015.tif" /></maths> (where ∘ denotes the component-wise product between two same-sized matrices), the K vector at the output of the channel combiners and the input to the decision devices 14<sub>1</sub>-14<sub>K</sub> can be concisely written as:<maths id="math0016"><img file="EP0978951A2_D0016.tif" /></maths> where <i>H</i> denotes the complex conjugate transpose, ° represents the component-wise product of two same-sized matrices, and<maths id="math0017"><img file="EP0978951A2_D0017.tif" /></maths> The noise vector is purely real and has distribution:<maths id="math0018"><img file="EP0978951A2_D0018.tif" /></maths> where<maths id="math0019"><img file="EP0978951A2_D0019.tif" /></maths> If the data is BPSK modulated, the bit decision for user k is simply the hard limit of the kth component of<maths id="math0020"><img file="EP0978951A2_D0020.tif" /></maths> The corresponding bit error rate <i>P</i><maths id="math0021"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">conv</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext></mrow></mfrac></mrow></math><img file="EP0978951A2_D0021.tif" /></maths> of the conventional rake receiver is:<maths id="math0022"><img file="EP0978951A2_D0022.tif" /></maths> where <b>X</b><sub>(<i>k,k</i>)</sub> is the (k,k)th element of matrix <b>X</b>. The performance comparisons among the various detectors are given in terms of BPSK modulated data, but they can also be done for any QAM modulated data in general.
Generic Space-Time Linear Multiuser Rake Receiver (Figure 2)
0018The prior art space-time rake receiver described above is a single user receiver in the sense that for a given user, the demodulation uses information only from that user. Since it does not account for the presence of interference from other users, its performance suffers. Figure 2 shows a generic <i>multiuser</i> space-time rake receiver. It accounts for the multiaccess interference using a linear combiner. Two versions of this detector are given. The first, known as detector A, uses the real operators before the linear combiner. In this case, reference 20 in Figure 2 consists of a bank of real operators followed by a linear combiner, and each of the components 14<sub>1</sub>...14<sub><i>K</i></sub> is a slicer which determines the closest estimated symbol to its input. The second, detector B, uses a linear combiner represented by a complex matrix followed by the real operators. In this case, reference 20 consists only of the linear combiner, and the decision devices consists of a real operator and slicer. Despite the similarities, the fact that the linear combiners for detectors A and B results in different performances and adaptive implementations. We now describe the two detector embodiments more thoroughly.
Space-Time Linear Multiuser Detector A (Figure 3)
0019A set of sufficient statistics for the <i>K</i> users is given in equation (3) as the <i>K</i>-vector Re{<b>y</b><sub><i>conv</i></sub>}. The objective of the linear MMSE detector is to apply a <i>K</i> x <i>K</i> linear combiner to this vector such that the mean-squared error between its resulting vector and the data vector <b>b</b> is minimized. In other words find the real <i>K</i> x <i>K</i> matrix <b>W</b><sub><i>A</i></sub> such that<maths id="math0023"><img file="EP0978951A2_D0023.tif" /></maths> This detector in essence strikes the proper balance in combating both residual Gaussian noise, manifested through <b>n</b><sup><i>conv</i></sup> , and multiple access interference, manifested through the off-diagonal terms of<img file="EP0978951A2_D0024.tif" /> It can be shown that the solution is:<maths id="math0024"><img file="EP0978951A2_D0025.tif" /></maths>
0020Figure 3 shows a block diagram of detector-A in accordance with the invention. It contains <i>P</i> antennas and a bank of matched filters 10. The box 31 represents a linear combiner defined by the <i>K</i>-by-<i>K</i> matrix <b>W</b><sub><i>A</i></sub> given by equation (6). The matrix can be put into words as follows: it is the product of 3 terms: (a) the diagonal amplitude matrix (A); (b) the equivalent array/channel/code correlation matrix (<b>M</b>); and the matrix inverse of the matrix<img file="EP0978951A2_D0026.tif" /> which consists of the product of the array/channel/code correlation matrix (<b>M</b>), the square of the amplitude matrix (<b>A</b><sup>2</sup>), and the Hermitian conjugate of the array/channel/code correlation matrix (<b>M</b><sup>2</sup>) summed with the estimated array/channel/code correlation matrix<img file="EP0978951A2_D0027.tif" /> which is weighted by the background noise variance (σ<sup>2</sup>). This matrix minimizes the mean-squared error criterion given in equation (5), and because of the convexity of the mean-squared error expression in (5), the MMSE solution (6) represents a global minimum. A bank of decision slicers (32<sub>1</sub> - 32<sub>K</sub>) follows the linear combiner.
0021An attractive feature of the MMSE detector is that it can be implemented adaptively using well-known adaptive algorithms (33) such as least-mean-squares or recursive least-squares. Using a training signal (for example, the user data bits), these techniques can be used to adaptively obtain <b>W</b><sub><i>A</i></sub>. Adaptive implementation is an option if direct calculation of <b>W</b><sub><i>A</i></sub> is deemed too complex. Note that the adaptive implementation requires knowledge of the <i>K</i> users' spreading codes, multipath delays, and channel parameters.
0022Assuming that the array and channel estimates are exact<maths id="math0025"><img file="EP0978951A2_D0028.tif" /></maths> we can rewrite the expression for <b>W</b><sub><i>A</i></sub> in (6) as:<maths id="math0026"><img file="EP0978951A2_D0029.tif" /></maths> and another attractive feature is that MMSE detector approaches the decorrelating (zero-forcing) detector (up to a scalar factor) as the residual Gaussian noise approaches zero:<maths id="math0027"><img file="EP0978951A2_D0030.tif" /></maths> In other words, from (3) we have that:<maths id="math0028"><img file="EP0978951A2_D0031.tif" /></maths> and the multiple access interference is forced to be zero. In the implementation of the decorrelating detector A (DD-A), we replace <b>W</b><sub><i>A</i></sub> given by equation (6) with<maths id="math0029"><img file="EP0978951A2_D0032.tif" /></maths> We will assume that <b>C</b><sup><i>H</i></sup><b>[(H</b><sup><i>H</i></sup><b>H)</b>∘<b>R]C</b> is positive definite and hence invertible; and it follows that <b>Re{C</b><sup><i>H</i></sup><b>[(H</b><sup><i>H</i></sup><b>H)</b>∘<b>R]C}</b> is also invertible.
0023Let us now calculate the bit error rate of this first MMSE detector (MMSE A). The K-vector at the slicer inputs is:<maths id="math0030"><img file="EP0978951A2_D0033.tif" /></maths> where<maths id="math0031"><img file="EP0978951A2_D0034.tif" /></maths> Hence the bit error rate for the kth user using the MMSE-A detector is:<maths id="math0032"><img file="EP0978951A2_D0035.tif" /></maths> Letting<maths id="math0033"><img file="EP0978951A2_D0036.tif" /></maths> and assuming perfect channel estimates, the bit error rate for DD-A, is:<maths id="math0034"><img file="EP0978951A2_D0037.tif" /></maths>
0024One drawback of this MMSE detector is that the estimation of the channel and array coefficients cannot be incorporated into the adaptive algorithm for obtaining <b>W</b><sub><i>A</i></sub>. The estimates must be explicitly obtained using some other means (like a training or pilot signal). This leads us to ask, "is it possible to design an adaptive MMSE which does not require prior knowledge of the array and channel parameters?" The answer is a"yes," as we will see in the following section.
Space-Time Linear Multiuser Detector B (Figure 4)
0025The goal of this subsection is to derive an MMSE detector which can be implemented adaptively and which does not require explicit array and channel estimates. (It will, however, still require timing estimates for the multipath delays.) Figure 4 shows the basic structure of Detector B which exchanges the places of the real operators and linear combiner of Detector A. Following this exchange, the resulting cascade of the array combining, multipath combining, and linear combiner can be collected into a single complex <i>K</i> x <i>KLP</i> matrix multiplication called <b>W</b><sub><i>B</i></sub>, as shown in Figure 5. Specifically, we define this matrix using the MMSE criterion as:<maths id="math0035"><img file="EP0978951A2_D0038.tif" /></maths> and it follows from (4) that<maths id="math0036"><img file="EP0978951A2_D0039.tif" /></maths> where<maths id="math0037"><img file="EP0978951A2_D0040.tif" /></maths> is the ray/channel matrix. Figure 5 shows a block diagram of the MMSE-B detector in accordance with the invention. It contains <i>P</i> antennas and a bank of matched filters 10. The box 50 represents a linear combiner defined by the <i>K</i>-by-<i>KLP</i> matrix <b>W</b><sub><i>B</i></sub> given by equation (10). This matrix minimizes the mean-squared error criterion given above by<maths id="math0038"><img file="EP0978951A2_D0041.tif" /></maths> The last line of equation (10) states that the matrix is the product of 3 terms: (a) the diagonal amplitude matrix (A); (b) the array/channel combiner matrix <b>H</b><sup><i>D</i></sup><b>C</b> which is equivalent to the array/channel combiner in the conventional detector but using the actual parameters and not their estimates; and (c) the matrix inverse of the matrix<maths id="math0039"><img file="EP0978951A2_D0042.tif" /></maths> The matrix inverse consists of the product of the correlation matrix<img file="EP0978951A2_D0043.tif" /> defined following equation (2), the ray/channel combiner matrix <b>G</b>, the square of the amplitude matrix (<b>A</b><sup>2</sup>), and the Hermitian conjugate of the array/channel combiner matrix summed with the <i>KLP</i>-by-<i>KLP</i> identity matrix weighted by the background noise variance (σ<sup>2</sup>). If the data is PAM., a bank of real operators (30<sub>1</sub> - 30<sub>K</sub>) and decision slicers (32<sub>1</sub> - 32<sub>K</sub>) follows the linear combiner. Otherwise, if the data is QAM, only the complex decision slicers (14<sub>1</sub> -14<sub>K</sub>) are required. For PAM data, Detectors A and B, while similar in structure, are not equivalent due to the different placement of the real operator.
0026To calculate the bit error rate of Detector B for BPSK data, the <i>K</i>-vector at the slicer inputs is<maths id="math0040"><img file="EP0978951A2_D0044.tif" /></maths> where<maths id="math0041"><img file="EP0978951A2_D0045.tif" /></maths> Hence the bit error rate for the <i>k</i>th user using the MMSE-B detector is:<maths id="math0042"><img file="EP0978951A2_D0046.tif" /></maths>
0027By concatenating the <i>P</i> received <i>N</i>-vectors into a single <i>NP</i>-vector<maths id="math0043"><img file="EP0978951A2_D0047.tif" /></maths> we can combine the operations of the matched filter bank with the linear combiner <b>W</b><sub><i>B</i></sub> to create a single <i>K</i>-by-<i>NP</i> matrix which multiplies <b>r</b>. As shown in Figure 6, the detector structure for the <i>k</i>th user can be reduced to the <i>k</i>th row of this <i>K</i>-by-<i>NP</i> matrix 60 followed by the real operator 62 and decision slicer 63. Hence the MMSE-B detector can be implemented with a simple tap-weight filter architecture. Its corresponding decorrelating detector (described below), the MMSE-A detector and the DD-A detector can likewise be implemented with this architecture. Like the MMSE-A detector, this version of the MMSE-B detector can be implemented adaptively using well-known adaptive algorithms (61). However, MMSE-B has the advantage of not requiring the array and channel estimates. The tradeoff is that the adaptation may be slower because there are more taps to adjust.
0028While direct analytic comparisons between the two detectors is difficult, we will show that under perfect channel and array estimates, the performance of MMSE-A is uniformly superior to that of MMSE-B as the noise floor approaches zero. First, we show that the corresponding decorrelating detector for MMSE-B, DD-B, simply replaces <b>W</b><sub><i>B</i></sub> with<maths id="math0044"><img file="EP0978951A2_D0048.tif" /></maths> (Recall that we have already made the assumption that<maths id="math0045"><img file="EP0978951A2_D0049.tif" /></maths> is invertible.)
Proposition 1:
0029<maths id="math0046"><img file="EP0978951A2_D0050.tif" /></maths><b>Proof:</b> Multiplying both sides by<maths id="math0047"><img file="EP0978951A2_D0051.tif" /></maths> we have that<maths id="math0048"><img file="EP0978951A2_D0052.tif" /></maths> Hence, from the fact that<maths id="math0049"><img file="EP0978951A2_D0053.tif" /></maths> and the fact that the array and multipath combiners in MMSE-A can be represented by <b>(H</b><sup><i>D</i></sup><b>D)</b><sup><i>H</i></sup>, the DD-B is the bank of matched filters, followed by the combiners, followed by the decorrelator <b>(C</b><sup><i>H</i></sup><b>[(H</b><sup><i>H</i></sup><b>H)</b>∘<b>R]C)</b><sup>-1</sup>, followed by the real operators, and followed by the slicers. The DD-A is nearly identical except that the order of the decorrelator and the real operators are switched, and the decorrelator is <b>(Re{C</b><sup><i>H</i></sup><b>[(H</b><sup><i>H</i></sup><b>H)</b>∘ <b>R]C})</b><sup>-1</sup>. By replacing <b>W</b><sub><i>B</i></sub> with<maths id="math0050"><img file="EP0978951A2_D0054.tif" /></maths> in (11), the bit error rate of DD-B is:<maths id="math0051"><img file="EP0978951A2_D0055.tif" /></maths>
0030We would now like to show that DD-A has a uniformly lower bit error rate than DD-B. Proposition 2: <i>P</i><maths id="math0052"><math display="inline"><mrow><mfrac linethickness="0" numalign="left" denomalign="left"><mrow><mtext mathvariant="italic">DD-A</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext></mrow></mfrac></mrow></math><img file="EP0978951A2_D0056.tif" /></maths>(σ) ≤ <i>P</i><maths id="math0053"><math display="inline"><mrow><mfrac linethickness="0" numalign="left" denomalign="left"><mrow><mtext mathvariant="italic">DD-B</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext></mrow></mfrac></mrow></math><img file="EP0978951A2_D0057.tif" /></maths>(σ)
0031<b>Proof</b> (for which the inventors wish to thank Emre Telatar of Lucent Technologies' Math Sciences Center for his timely and elegant insight):
0032Define<maths id="math0054"><img file="EP0978951A2_D0058.tif" /></maths> which is Hermitian and assumed to be positive definite. It follows that <b>[Re(</b><maths id="math0055"><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">M</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0978951A2_D0059.tif" /></maths><b>)]</b><sup>-1</sup> is also positive definite, and it is sufficient to show that the kth diagonal element of <b>[Re(</b><maths id="math0056"><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">M</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0978951A2_D0060.tif" /></maths><b>)]</b><sup>-1</sup> is greater than or equal to the kth diagonal element of <maths id="math0057"><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">M</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0978951A2_D0061.tif" /></maths><sup>-1</sup>. <maths id="math0058"><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">M</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0978951A2_D0062.tif" /></maths><sup>-1</sup>. (Note that since <maths id="math0059"><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">M</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0978951A2_D0063.tif" /></maths> is Hermitian, its inverse is also Hermitian, hence the diagonal elements of the inverse are real.) Chose <b>y</b> to be real and set<maths id="math0060"><img file="EP0978951A2_D0064.tif" /></maths> and note that <b>X</b> is real. Thus,<maths id="math0061"><img file="EP0978951A2_D0065.tif" /></maths> and also<maths id="math0062"><img file="EP0978951A2_D0066.tif" /></maths> Using a generalization of Bergstrom's inequality which states that for any real <b>x</b>, real <b>y</b>, and positive definite <maths id="math0063"><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">M</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0978951A2_D0067.tif" /></maths>,<maths id="math0064"><img file="EP0978951A2_D0068.tif" /></maths> we have that<maths id="math0065"><img file="EP0978951A2_D0069.tif" /></maths> and the result follows by using the kth unit vector for <b>y</b>. Despite this relationship, it turns out that the performance of DD-A and DD-B are actually quite similar. More importantly, it has been shown that the performance of MMSE-B can be better than MMSE-A for the practical case of inexact array and channel estimates.
Extensions of MMSE Detectors to the Asynchronous Multirate Case
0033So far, we have assumed bit synchronous operation of these linear multiuser detectors. We now show how their operation can be extended to the bit asynchronous case. First, we consider the operation of a decorrelating detector in a synchronous single-rate environment. Similar reasoning applies to MMSE detectors; however, for pedagogical purposes, we focus on the decorrelating detector. Suppose that there are two users with respective spreading codes <i>s</i><sub>1</sub>(<i>t</i>) and <i>s</i><sub>2</sub>(<i>t</i>). Table A below shows the relationship between the two codes in time, with the thin vertical lines representing symbol boundaries. The received signal is <maths id="math0066"><math display="inline"><mrow><mtext mathvariant="italic">r</mtext><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)=</mtext><msub><mrow><mtext mathvariant="italic">A</mtext></mrow><mrow><mtext>1</mtext></mrow></msub><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>1</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)</mtext><msub><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext>1</mtext></mrow></msub><mtext> + </mtext><msub><mrow><mtext mathvariant="italic">A</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)</mtext><msub><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><mtext> + </mtext><mtext mathvariant="italic">n</mtext><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)</mtext></mrow></math><img file="EP0978951A2_D0070.tif" /></maths> where <i>A</i><sub><i>k</i></sub> is the <i>k</i>th user's amplitude, <i>b</i><sub><i>k</i></sub> is the <i>k</i>th user's data bit, and <i>n</i>(<i>t</i>) is the additive Gaussian noise. <tables id="tabl0001" num="0001"><img file="EP0978951A2_D0071.tif" /></tables><tables id="tabl0002" num="0002"><img file="EP0978951A2_D0072.tif" /></tables>
0034If user 1 is the desired user, its decorrelating detector for a given symbol interval is the matched filter for code <i>s</i><sub>1</sub>(<i>t</i>) projected into the null-space of <i>s</i><sub>2</sub>(<i>t</i>). For the asynchronous single-rate case, shown in Table - B, the decorrelating detector for user 1 is projected into the null-space spanned by the linear combinations of user 2's codes which overlap during that symbol interval. If we let <i>s</i><maths id="math0067"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">R</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac></mrow></math><img file="EP0978951A2_D0073.tif" /></maths>(<i>t</i>) be the portion of <i>s</i><sub>2</sub>(<i>t</i>) which overlaps with <i>s</i><sub>1</sub>(<i>t</i>) and let <i>s</i><maths id="math0068"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">L</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac></mrow></math><img file="EP0978951A2_D0074.tif" /></maths>(<i>t</i>-<i>T</i>) be the portion of <i>s</i><sub>2</sub>(<i>t</i>-<i>T</i>) which overlaps with <i>s</i><sub>1</sub>(<i>t</i>), then, assuming BPSK data modulation, the null space is spanned by <maths id="math0069"><math display="block"><mrow><msup><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext mathvariant="italic">R</mtext></mrow></msup><msub><mrow><mtext></mtext></mrow><mrow><mtext>2</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)+</mtext><msup><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext mathvariant="italic">L</mtext></mrow></msup><msub><mrow><mtext></mtext></mrow><mrow><mtext>2</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>-</mtext><mtext mathvariant="italic">T</mtext><mtext>) and </mtext><msup><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext mathvariant="italic">R</mtext></mrow></msup><msub><mrow><mtext></mtext></mrow><mrow><mtext>2</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)-</mtext><msup><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext mathvariant="italic">L</mtext></mrow></msup><msub><mrow><mtext></mtext></mrow><mrow><mtext>2</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>-</mtext><mtext mathvariant="italic">T</mtext><mtext>).</mtext></mrow></math><img file="EP0978951A2_D0075.tif" /></maths> This idea can be extended to the asynchronous multi-rate case shown in Table - C. Using similar function definitions, the decorrelator for user 1 lies in the null space spanned by<maths id="math0070"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><msup><mrow><mtext></mtext></mrow><mrow><mtext mathvariant="italic">R</mtext></mrow></msup><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)+</mtext><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>-</mtext><mtext mathvariant="italic">T</mtext><mtext>)+</mtext><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><msup><mrow><mtext></mtext></mrow><mrow><mtext mathvariant="italic">L</mtext></mrow></msup><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>-2</mtext><mtext mathvariant="italic">T</mtext><mtext>), </mtext><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><msup><mrow><mtext></mtext></mrow><mrow><mtext mathvariant="italic">R</mtext></mrow></msup><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)+</mtext><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>-</mtext><mtext mathvariant="italic">T</mtext><mtext>)-</mtext><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><msup><mrow><mtext></mtext></mrow><mrow><mtext mathvariant="italic">L</mtext></mrow></msup><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>-2</mtext><mtext mathvariant="italic">T</mtext><mtext>), </mtext><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><msup><mrow><mtext></mtext></mrow><mrow><mtext mathvariant="italic">R</mtext></mrow></msup><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)-</mtext><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>-</mtext><mtext mathvariant="italic">T</mtext><mtext>)+</mtext><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><msup><mrow><mtext></mtext></mrow><mrow><mtext mathvariant="italic">L</mtext></mrow></msup><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>-2</mtext><mtext mathvariant="italic">T</mtext><mtext>), and </mtext><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><msup><mrow><mtext></mtext></mrow><mrow><mtext mathvariant="italic">R</mtext></mrow></msup><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>)-</mtext><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>-</mtext><mtext mathvariant="italic">T</mtext><mtext>)-</mtext><msub><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><msup><mrow><mtext></mtext></mrow><mrow><mtext mathvariant="italic">L</mtext></mrow></msup><mtext>(</mtext><mtext mathvariant="italic">t</mtext><mtext>-2</mtext><mtext mathvariant="italic">T</mtext><mtext>).</mtext></mrow></math><img file="EP0978951A2_D0076.tif" /></maths> As the disparity between data rates increases, the effectiveness of a linear multiuser detector decreases since it will be constrained to a more restrictive subspace. The reasoning above can be applied to MMSE detectors by similarly combining the appropriate subspaces of the interfering waveforms.
MMSE Detectors and Interference Cancellation
0035The MMSE techniques described here can be used inconjunction with a non-linear multiuser detection technique known as interference cancellation. Whereas the linear multiuser detectors rely on subspace projections to mitigate interference, the interference cancellers directly subtract off the interference. Two types of interference cancellation can be used: pre-combiner, where the cancellation occurs before the linear combiner, and post-combiner, where it occurs after. Pre-combiner cancellation is used for canceling interference which is not accounted for by the linear combiner. For example, we may choose to cancel a high-powered, high-data rate signal from within the cell instead of accounting for it with the linear combiner. Post-combiner cancellation on the other hand is used for refining the symbol estimates made by the linear combiner. Using preliminary symbol estimates from the linear multiuser detector, the signals are reconstructed and subtracted from the received signals to form enhanced signals which are used for a second stage of symbol estimation. In both interference cancellation techniques, capacity can be potentially increased by suppressing the interference.
0036Figure 7 shows a block diagram of a pre-combiner interference canceller in accordance with Detector A shown in Figure 3. At the <i>k</i>th input to the linear combiner <b>W</b><sub><i>A</i></sub>, there is interference due to users <i>j</i> = 1...<i>K</i>, <i>j</i> ≠ <i>k</i>, which will be accounted for with <b>W</b><sub><i>A</i></sub>. However, there may also be otherwise unaccounted interference, for example, high-powered interference from within the cell. This interference could be subtracted from the input to <b>W</b><sub><i>A</i></sub> if the spreading codes, multipath delays, data bits, and channel parameters at all antennas are known. In this case, the baseband signal for the interference could be reconstructed and its contribution to the <i>k</i>th input of <b>W</b><sub><i>A</i></sub> could be estimated (by passing the reconstructed signal through the processing chain for user <i>k</i>) and subtracted at the point designated 70<sub><i>k</i></sub> (<i>k</i> = 1 ... <i>K</i>) Contributions from other interference for this or other inputs can be similarly computed and subtracted.
0037Figure 8 shows a block diagram of a pre-combiner interference canceller in accordance with Detector B from Figure 4. Using the same method as described above for the Detector A pre-combiner interference canceller, the interference which is not accounted for by <b>W</b><sub><i>B</i></sub> can be subtracted from each of its inputs at the point designated 80.
0038Figure 9 shows a block diagram of a post-combiner interference cancellation receiver in accordance with the invention. This receiver includes <i>P</i> antennas and has three stages, designated 90, 91 and 92. The first stage 90 receives baseband signals <b>r</b><sub><i>p</i></sub>, and makes preliminary symbol estimates for all <i>K</i> users with either a MMSE-A detector of Figure 1 or a MMSE-B detector of Figure 2. The second stage 91 uses the preliminary symbol estimates from the first stage 90 and knowledge of the <i>K</i> users' spreading codes, delays, and channel parameters to reconstruct the baseband received signals for each of the users. The second stage 91 subtracts the multiaccess interference with respect to a desired user <i>k</i> from the received signals <b>r</b><sub>1</sub>...<b>r</b><sub><i>p</i></sub> to form the following enhanced received signals for user <i>k</i>.<maths id="math0071"><img file="EP0978951A2_D0077.tif" /></maths>
0039Note that the multipath interference with respect to user <i>k</i> can also be removed. We will not describe this option in detail because its relative gains will generally be negligible unless the number of users <i>K</i> is very small. Ideally, if the preliminary symbol estimates and the channel estimates are perfect, there will be no multiaccess interference in the enhanced received signals. However, this will generally not be the case in practice. In the third stage 82, the enhance received signals are processed with a conventional space- time receiver shown in Figure 1 to generate the final symbol estimates <maths id="math0072"><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="italic">b</mtext></mrow><mo>^</mo></mover></mrow></math><img file="EP0978951A2_D0078.tif" /></maths><maths id="math0073"><math display="inline"><mrow><mfrac linethickness="0" numalign="left" denomalign="left"><mrow><mtext>(</mtext><mtext mathvariant="italic">IC</mtext><mtext>)</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext></mrow></mfrac></mrow></math><img file="EP0978951A2_D0079.tif" /></maths> for the <i>K</i> users.
0040The post-combiner interference cancellation procedure described above can be continued for multiple iterations by repeating stages 91 and 92 indefinitely. Performance gains due to repeated iterations diminish after the first two or three iterations. To reduce the complexity, interference cancellation of both types can be performed on a subset of users.
0041What has been described is deemed to be illustrative of the principles of the invention. In particular, it should be noted that the apparatus and methods of the invention may be implemented through various technologies, for example, through the use of large scale integrated circuitry, application specific integrated circuits and/or stored program general purpose or special purpose computers or microprocessors using any of a variety of computer-readable media.
110 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16 Sheet 17 Sheet 18 Sheet 19 Sheet 20 Sheet 21 Sheet 22 Sheet 23 Sheet 24 Sheet 25 Sheet 26 Sheet 27 Sheet 28 Sheet 29 Sheet 30 Sheet 31 Sheet 32 Sheet 33 Sheet 34 Sheet 35 Sheet 36 Sheet 37 Sheet 38 Sheet 39 Sheet 40 Sheet 41 Sheet 42 Sheet 43 Sheet 44 Sheet 45 Sheet 46 Sheet 47 Sheet 48 Sheet 49 Sheet 50 Sheet 51 Sheet 52 Sheet 53 Sheet 54 Sheet 55 Sheet 56 Sheet 57 Sheet 58 Sheet 59 Sheet 60 Sheet 61 Sheet 62 Sheet 63 Sheet 64 Sheet 65 Sheet 66 Sheet 67 Sheet 68 Sheet 69 Sheet 70 Sheet 71 Sheet 72 Sheet 73 Sheet 74 Sheet 75 Sheet 76 Sheet 77 Sheet 78 Sheet 79 Sheet 80 Sheet 81 Sheet 82 Sheet 83 Sheet 84 Sheet 85 Sheet 86 Sheet 87 Sheet 88 Sheet 89 Sheet 90 Sheet 91 Sheet 92 Sheet 93 Sheet 94 Sheet 95 Sheet 96 Sheet 97 Sheet 98 Sheet 99 Sheet 100 Sheet 101 Sheet 102 Sheet 103 Sheet 104 Sheet 105 Sheet 106 Sheet 107 Sheet 108 Sheet 109 Sheet 110
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US7210062B2 | Cited by | United States of America | Applicant |
| US7453922B2 | Cited by | United States of America | Applicant |
| US7693113B2 | Cited by | United States of America | Applicant |
| WO2004093333A3 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US7376175B2 | Cited by | United States of America | Applicant |
| WO2004093333A2 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US7248623B2 | Cited by | United States of America | Applicant |
| EP1189361A1 | Cited by | European Patent Office (EPO) | Search report |
| US7139306B2 | Cited by | United States of America | Applicant |
| EP1184997A1 | Cited by | European Patent Office (EPO) | Search report |
| US7376175B2 | Cited by | United States of America | Applicant |
| US7079607B2 | Cited by | United States of America | Applicant |
| US7110437B2 | Cited by | United States of America | Applicant |
| US7110431B2 | Cited by | United States of America | Applicant |
| US7203181B2 | Cited by | United States of America | Applicant |
| US7099374B2 | Cited by | United States of America | Applicant |
| EP1184997A1 | Cited by | European Patent Office (EPO) | Search report |
| US7164706B2 | Cited by | United States of America | Applicant |
| US7203181B2 | Cited by | United States of America | Applicant |
| EP1529358A4 | Cited by | European Patent Office (EPO) | Search report |
| US7218668B2 | Cited by | United States of America | Applicant |
| US7327780B2 | Cited by | United States of America | Applicant |
| FR2814014A1 | Cited by | France | Search report |
| US7031671B2 | Cited by | United States of America | Applicant |
| WO02093766A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US7177344B2 | Cited by | United States of America | Applicant |
| US7787522B2 | Cited by | United States of America | Applicant |
| FR2813464A1 | Cited by | France | Search report |
| US7110440B2 | Cited by | United States of America | Applicant |
| FR2813464A1 | Cited by | France | Search report |
| US7327780B2 | Cited by | United States of America | Applicant |
| CN100373841C | Cited by | China | Search report |
| EP1529358A1 | Cited by | European Patent Office (EPO) | Search report |
16 members in 9 offices; this record represents the family
Priority claims2
| Document | Office | Kind | Date |
|---|---|---|---|
| 129479 | United States of America | – | |
| 12947998 | United States of America | A |
Members16
| Document | Office | Kind | |
|---|---|---|---|
| CA2279471A1 | Canada | A1 | |
| EP0978951A2This record | European Patent Office (EPO) | A2 | |
| AU4245199A | Australia | A | |
| CN1247417A | China | A | |
| KR20000016990A | Republic of Korea | A | |
| JP2000115028A | Japan | A | |
| BR9902994A | Brazil | A | |
| US6301293B1 | United States of America | B1 | |
| KR100317518B1 | Republic of Korea | B1 | |
| EP0978951A3 | European Patent Office (EPO) | A3 | |
| CA2279471C | Canada | C | |
| JP3553426B2 | Japan | B2 | |
| EP0978951B1 | European Patent Office (EPO) | B1 | |
| DE69924197D1 | Germany | D1 | |
| DE69924197T2 | Germany | T2 | |
| CN1278496C | China | C |
37 legal events, as 5 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Application deemed withdrawn, or ip right lapsed, due to non-payment of renewal feeWithdrawnR119 | R119 | DE | |
| Change of applicant/patenteeR081 | R081 | DE | |
| Change of representativeR082 | R082 | DE | |
| Change of applicant/patenteeR081 | R081 | DE | |
| Change of applicant/patenteeR081 | R081 | DE | |
| Change of representativeR082 | R082 | DE | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Gb: european patent ceased through non-payment of renewal feeCeasedGBPC | GBPC | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Notification of lapseLapsedST | ST | FR | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| No opposition filedOpposition26N | 26N | EP | |
| Fr: translation filedET | ET | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Corresponds to:REF | REF | EP | |
| European patents granted designating irelandGrantedFG4D | FG4D | IE | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Designation fees paidAKX | AKX | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Search report despatchedORIGINAL CODE: 0009013PUAL | PUAL | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAL;LT;LV;MK;RO;SIAX | AX | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 0978951
- Application
- 993059203
Titles3
- German
- Linearer Raum-Zeit Mehrbenutzerdetektor
- English
- Linear space-time multiuser detector
- French
- Détecteur à utilisateurs multiples spatio-temporel linéaire
Classification
- CPC, 5
- H04B1/71055
- H04B1/7105
- H04B1/7093
- H04B1/7103
- H04B1/7115
- IPC, 5
- H04B1 10
- H04B1 7093
- H04B1 7103
- H04B1 7105
- H04B1 7115
Designated states25
- Contracting states, 19
- Austria
- Belgium
- Switzerland
- Cyprus
- Germany
- Denmark
- Spain
- Finland
- France
- United Kingdom
- Greece
- Ireland
- Italy
- Liechtenstein
- Luxembourg
- Monaco
- Netherlands (Kingdom of the)
- Portugal
- Sweden
- Extension states, 6
- Albania
- Lithuania
- Latvia
- North Macedonia
- Romania
- Slovenia