METHOD AND APPARATUS FOR INTERFERENCE DECORRELATION IN TIME AND SPACE

Abstract: Receivers and methods for receiving transmitted symbols are disclosed in which techniques are applied to jointly combat fading, time dispersion, and interference that is correlated in both space and time. These objects are accomplished by, for example, providing an inverse impairment correlation sequence estimate to the branch metric processor in addition to a channel estimate. The branch metric processor can then use this additional information to provide branch metrics that take into account the time correlation of impairment to improve the symbol hypotheses.

Description: METHOD AND APPARATUS FOR INTERFERENCE DECORRELATION IN TIME AND SPACE BACKGROUND The present invention relates generally to the demodulation of a digital communications radio signal received by a plurality of antennas subjected to multipath fading, time dispersion, and interference. Digital wireless communication systems are being deployed around the world to provide convenient, cost-effective communication services. One of the challenges in such systems is mitigating the effects of multipath propagation, which results when the transmitted signal travels along several paths to the intended receiver. When the path lengths are relatively small, the multiple signal images arrive at almost the same time. The images add either constructively or destructively, giving rise to fading, which typically has a Rayleigh distribution. When the path lengths are relatively large, the transmission medium is considered time dispersive, and the added images can be viewed as echoes of the transmitted signal, giving rise to intersymbol interference (ISI). Fading can be mitigated by having multiple receive antennas and employing some form of diversity combining, such as selective combining, equal gain combming, or maximal ratio combining. Diversity takes advantage of the fact that the fading on the different antennas is not the same, so that when one antenna has a faded signal, chances are the other antenna does not. ISI multipath time dispersion is traditionally mitigated by some form of equalization, such as linear equalization, decision feedback equalization, or maximum likelihood sequence estimation (MLSE). Of the three approaches, MLSE equalization provides superior performance. MLSE equalization and diversity combining can be performed jointly, as described, for example, in U.S. Patent No. 5,191,598 to Backstrόm et al. Another challenge is the mitigation of interference. In a cellular communications system, a channel is reused in different cells. Signals propagate outside of their own cells and interfere wim signals generated within other cells using the same channel. This form of interference, referred to as co-channel interference, limits performance at the receiver. Other forms of interference, such as adjacent- channel interference, are also a problem. Interference can be mitigated by some form of array processing of the received signal. For example, when diversity combining multiple antenna signals, the combining weights can be adjusted to cancel interference as well as coherently combine signal energy. See, for example, J. H. Winters, "Signal Acquisition and Tracking with Adaptive Arrays in the Digital Mobile Radio System IS-54 with Flat Fading, " IEEE Transactions on Vehicular Technology, Vol. 42, pp. 377-384, Nov. 1993. Mitigation of fading, time dispersion, and interference can be performed jointly by modifying the MLSE metric to incorporate an inverse impairment correlation matrix. See, for example, U.S. Patent Application Serial No. 08/284,775 entitled "METHOD OF AND APPARATUS FOR INTERFERENCE REJECTION COMBINING IN MULTI-ANTENNA DIGITAL CELLULAR COMMUNICATIONS SYSTEMS", filed on August 2, 1994, to Bottomley, the disclosure of which is expressly incorporated here by reference, as well as G. E. Bottomley and K. Jamal, "Adaptive Arrays and MLSE Equalization," Proc. VTC '95, Chicago, IL, July 1995. The inverse impairment correlation matrix spatially decorrelates the impairment estimates when forming branch metrics in the MLSE equalization process. This technique is referred to as interference rejection combining (IRC). However, it is possible that the antenna impairment signals are correlated in time as well as space. This can result from using a modulation that has memory, such as partial response modulation or CPM schemes. It can also result from multipath time dispersion of the interference, so that echoes of the interference signal are present. The previously described techniques are not optimal for time correlated interference. Thus, there is a need for a technique which better handles fading, ISI, and time-correlated interference. SUMMARY The present invention solves the aforementioned problem by jointly combatting fading, time dispersion, and interference that is correlated in both space and time. These objects are accomplished by, for example, providing an inverse impairment correlation sequence estimate to the branch metric processor in addition to a channel estimate. The branch metric processor can then use this additional information to provide branch metrics that take into account the time correlation of impairment to improve the symbol hypotheses. BRIEF DESCRIPTION OF THE DRAWINGS These, and other, objects, features and advantages of the present invention will be understood after reading the following detailed description, in conjunction with the drawings, in which: Fig. 1 is a block diagram of an exemplary digital wireless communication system; Fig. 2 illustrates an exemplary embodiment of a baseband processor according to the present invention; Fig. 3 illustrates an exemplary embodiment of a branch metric processor according to the present invention; Fig. 4 illustrates an alternative embodiment of a baseband processor according to the present invention; Fig. 5 illustrates an exemplary embodiment of a branch metric constructor according to the present invention; Fig. 6 illustrates an exemplary embodiment of an inverse impairment correlation sequence estimator according to the present invention; and Fig. 7 illustrates an exemplary embodiment of an inverse sequence computer according to the present invention. DETAILED DESCRIPTION Shown in Figure 1 is a block diagram of an exemplary wireless communication system. Digital information symbols, denoted s(n), are passed to a transmitter 102, which converts the symbol stream to a radio waveform for transmission using antenna 104. The transmitted signal is received by a plurality of receive antenna elements 106. Each antenna signal is processed by a radio unit 108, which filters, amplifies, mixes, and samples the signal appropriately, giving rise to a sequence of received samples. These received samples are processed in baseband processor 110 to produce a sequence of detected digital symbol values. With the aforementioned IRC approach, the baseband processor 110 would work as follows. Let r,(n) and r„(n) denote the received sample streams on antennas a and b respectively. Each sample stream can be modeled as: i (1) where the subscript x denotes the antenna, c.(j) is the j'th channel tap associated with the desired signal and antenna x, and z,(n) denotes the impairment (noise plus other signal interference). Typically, in-phase (I) and quadrature (Q) components of the received signals are treated as single, complex samples, so that the received samples, the channel taps, the impairment samples, and possibly the information symbol values are complex numbers. The baseband processor would form metrics of the form: where e M EM= *Φ) (3) where subscript h denotes hypothesized values, c x (j) denotes a channel coefficient estimate, and R„ denotes an estimate of the inverse impairment correlation matrix. The impairment correlation matrix is defined to be: where E{} denotes expected value. The detected symbol sequence is then one that minimizes an accumulation of branch metrics. According to the present invention, on the other hand, time correlation of the impairment is also considered. Correlation in both time and space can be represented by an impairment correlation matrix sequence, for example: where m is the sequence index. The index m represents a time difference between the two impairment values being correlated. Thus, the impairment correlation matrix sequence provides an additional term (i.e. , representing time correlation of the impairment) for each matrix entry. An inverse impairment correlation matrix sequence can be defined so that: R^(m)*R a (m)=δ(m)I (7) where δ(m) is the Kronecker delta function (i.e. , δ(0) = l but for all other values of m, δ(m) =0), and I is the identity matrix (i.e., l 's on the diagonal, 0's on the off diagonal). With the inverse impairment correlation matrix sequence defined, the branch metric according to the present invention is given by: which is the sum of quadratic products. This exemplary embodiment of the present invention is illustrated in Figure 2. Received samples are processed by a branch metric processor 202 to produce branch metrics according to symbol hypotheses. The processor 202 uses channel coefficient estimates from channel estimator 204 as well as an inverse impairment correlation sequence estimate from inverse impairment correlation sequence estimator 206. An exemplary embodiment of the branch metric processor 202 is given in Figure 3. Received samples are provided to subtractors 302, which subtract hypothetical received samples from actual received samples, forming difference signals. The hypothetical received samples are obtained by producing a hypothetical symbol sequence with sequence generator 304 and filtering the sequence with channel coefficient estimates in filters 306. The difference signals are stored in memory 308. Quadratic product processor 310 forms quadratic products between the stored difference signals using a matrix in the inverse impairment correlation sequence estimate. These quadratic products are accumulated in accumulator 312 to produce branch metrics. An alternative embodiment of the present invention can be obtained by rewriting the final metric as a sum of new branch metrics given by: where S(k)=∑ ∑ C H (f)R^(m)C(k+j-m) (11) and Thus, the metric in equation (9) is the real part of multiplying the conjugate of the current hypothetical symbol with the difference between two terms. The first term is the result of combining the received data with weights W(j,m). The second term is the result of filtering the hypothetical symbols with parameters S(k). If all possible symbol values have the same magnitude, then the S(0) term can be omitted. This alternative embodiment is illustrated in Figure 4. The received samples are combined in combiner 402 using weights stored in weight vector memory 404 to produce combined terms. The weights are computed in weight processor 405, which uses the inverse impairment correlation sequence estimate and channel coefficient estimates provided by inverse impairment correlation sequence estimator 206 and channel estimator 204, respectively. These estimates are also used in parameter processor 403, which computes parameters that are stored in parameter memory 410. The combined terms and parameters are provided to branch metric constructor 412, which constructs branch metrics according to various symbol hypotheses. These branch metrics are provided to sequence estimator 208, which estimates the transmitted sequence. An exemplary embodiment of the branch metric constructor 412 is shown in Figure 5. Combined outputs are stored in memory 502. Combined outputs are then read from memory 502 and provided to subtractor 302, which subtracts outputs of filter 306 to produce differences. The output of filter 306 is the result of filtering hypothetical symbol values from sequence generator 304 with parameters from the parameter memory. Real parts of the products of differences and hypothetical symbol values are computed in half-complex-multiplier (HCM) 504. The outputs of HCM 504 are branch metrics. All of these exemplary embodiments make use of inverse impairment correlation sequence estimator 206. One procedure for determining the inverse impairment correlation sequence is to take the z-transform of the impairment correlation matrix sequence and represent the transformed result as a single matrix in which each element is a sequence in z. Then, a regular matrix inverse can be taken, followed by an inverse z-transform. This procedure is illustrated in Figure 6. The impairment correlation sequence is estimated in estimator 602. Similar to the Bottomley patent, this can be done by removing the desired signal from the received signal samples, giving impairment samples, which can be correlated in time and space. The impairment correlation sequence estimate is then provided to inverse sequence processor 604, which computes the inverse according to the aforementioned procedure. In practice, it may be desirable to approximate the inversion operation in 604. This can be done by forming the adjoint of the z- transformed matrix, then scaling each element by a scaling factor, prior to an inverse z-transform operation. When the scaling factor is the determinant of the z-transformed matrix, then there is no loss in optimality. Other choices for the scaling factor would be unity (i.e., no scaling needed), the determinant of R^O), or the trace of R„(0). This suggests the exemplary embodiment of inverse sequence processor 604 shown in Figure 7. The impairment correlation matrix sequence is z-transformed in transformer 702, producing a transformed matrix, in which each element is a series of values. The adjoint of the transformed matrix is computed by adjoint processor 704. Each element of the adjoint is scaled by sealer 708, which uses a scaling factor determined by scale factor processor 706. The scaled adjoint is inverse transformed in inverse transformer 710 to produce an estimate of the inverse correlation impairment sequence. In practice, it may be more efficient to perform the scaling operation at another point in the branch metric formation process. While not shown, it will be known to persons skilled in the art how the present invention can be applied when there are more than two antennas. Also, the present invention can be applied to other types of receive channels, not just those associated with different antennas. Fractionally-spaced equalization can be handled by treating each fractionally-sampled data stream as interleaved, symbol-spaced data streams coming from different antennas. The estimators in the present invention may be designed to adapt to changes over time. It will be known to persons skilled in the art how to adaptively estimate the channel coefficients and the inverse impairment correlation sequence. One approach is to use decision feedback, with tentatively detected symbol values. Another approach is to use per-survivor processing, so that there are one or more estimates per state in the sequence estimator. When quantities do not change with time or do not change in a block of time, then all quantities unrelated to the received data samples can be pre-computed. For example, for the metric in equation (9), all quantities except the combined values z(n) can be precomputed. While particular embodiments of the present invention have been described and illustrated, it should be understood that the invention is not limited tfiereto since modifications may be made by persons skilled in the art. The present application contemplates any and all modifications that fall within the spirit and scope of the underlying invention disclosed and claimed herein.

Claims: WHAT IS CLAIMED IS: 1. In a digital wireless communication system for conveying digital information symbols, a receiver comprising: means for receiving a radio signal on a plurality of antennas to produce a plurality of antenna signals; means for radio processing said antenna signals to produce a plurality of received sample streams; means for forming a plurality of channel coefficient estimates corresponding to each of said received sample streams; means for forming an inverse impairment correlation sequence estimate in which impairment corresponds to interference and noise among the received sample streams; means for forming branch metrics using said channel coefficient estimates and said inverse impairment correlation sequence estimate; and means for detecting said digital information symbols using said branch metrics in a sequence estimator. 2. A receiver according to claim 1 in which said means for forming branch metrics further comprises: means for forming hypothetical received samples using said channel coefficient estimates; means for forming differences between said received samples and said hypothetical received samples; means for storing said differences in a memory device; means for forming quadratic products with said stored differences using said inverse impairment correlation sequence estimate; and means for accumulating said quadratic products to produce said branch metrics. 3. A receiver according to claim 1 in which said means for forming branch metrics further comprises: means for forming weights using said channel coefficient estimates and said inverse impairment correlation sequence estimate; means for forming parameters using said channel coefficient estimates and said inverse impairment correlation sequence estimate; means for combining said weights with said received samples to produce combined values; means for filtering hypothetical symbol values with said parameters to produce filtered values; and means for combining said combined values, said filtered values, and a hypothetical symbol value to produce branch metrics. 4. A receiver according to claim 1 in which said means for estimating an inverse impairment correlation sequence further comprises: means for estimating an impairment correlation sequence; means for transforming said sequence to produce a transformed matrix; means for computing the inverse of said transformed matrix; and means for inverse transforming said inverse of said transformed matrix. 5. A receiver according to claim 1 in which said means for estimating an inverse impairment correlation sequence further comprises: means for estimating an impairment correlation sequence; means for transforming said sequence to produce a transformed matrix; means for computing the adjoint of said transformed matrix; and means for inverse transforming said adjoint of said transformed matrix. 6. A receiver according to claim 1 in which said means for estimating an inverse impairment correlation sequence further comprises: means for estimating an impairment correlation sequence; means for transforming said sequence to produce a transformed matrix; means for computing the adjoint of said transformed matrix; means for computing a scale factor; means for scaling said adjoint to produce a scaled adjoint; and means for inverse transforming said scaled adjoint. 7. A method for detecting information symbols comprising the steps of: receiving a radio signal on a plurality of antennas to produce a plurality of antenna signals; radio processing said antenna signals to produce a plurality of received sample streams; forming a plurality of channel coefficient estimates corresponding to each of said received sample streams; forming an inverse impairment correlation sequence estimate in which impairment corresponds to interference and noise among the received sample streams; forming branch metrics using said channel coefficient estimates and said inverse impairment correlation sequence estimate; and detecting said digital information symbols using said branch metrics in a sequence estimator. 8. The method according to claim 7 which said step of forming branch metrics further comprises the steps of: forming hypothetical received samples using said channel coefficient estimates; forming differences between said received samples and said- hypothetical received samples; storing said differences in a memory device; forming quadratic products with said stored differences using said inverse impairment correlation sequence estimate; and accumulating said quadratic products to produce said branch metrics. 9. The method of claim 7 in which said step of forming branch metrics further comprises the steps of: forming weights using said channel coefficient estimates and said inverse impairment correlation sequence estimate; forming parameters using said channel coefficient estimates and said inverse impairment correlation sequence estimate; combining said weights with said received samples to produce combmed values; filtering hypothetical symbol values with said parameters to produce filtered values; and combining said combined values, said filtered values, and a hypothetical symbol value to produce branch metrics. 10. The method according to claim 7 in which said step of estimating an inverse impairment correlation sequence further comprises the steps of: estimating an impairment correlation sequence; transforming said sequence to produce a transformed matrix; computing the inverse of said transformed matrix; and inverse transforming said inverse of said transformed matrix. 11. A receiver according to claim 7 in which said step of estimating an inverse impairment correlation sequence further comprises the steps of: estimating an impairment correlation sequence; transforming said sequence to produce a transformed matrix; computing the adjoint of said transformed matrix; and inverse transforming said adjoint of said transformed matrix. 12. The method of claim 7 in which said step of estimating an inverse impairment correlation sequence further comprises the steps of: estimating an impairment correlation sequence; transforming said sequence to produce a transformed matrix; computing the adjoint of said transformed matrix; computing a scale factor; scaling said adjoint to produce a scaled adjoint; and inverse transforming said scaled adjoint. 13. A receiver comprising: at least two antennas each for receiving a radio signal to produce at least two antenna signals; and a processor for receiving said at least two antenna signals and processing said at least two antenna signals to determine information symbols present in said radio signal, wherein said processor includes: means for determining branch metrics, which branch metrics are used to form hypotheses of said information symbols, wherein said branch metrics are determined taking into account both space and time impairment correlation. 14. The receiver of claim 1, wherein said means for forming an inverse impairment correlation sequence estimate uses an impairment correlation sequence estimate of the form: 15. The method of claim 7, wherein said step of forming an inverse impairment correlation sequence estimate further comprises the step of: using an impairment correlation sequence estimate having the form: 16. The receiver of claim 13, wherein said means for determining branch metrics further comprises: means for forming an inverse impairment correlation sequence estimate wherein said impairment correlation sequence estimate takes the form of: φ+m) * R (m)=E zXn+m) z Λn) z b * (n) 17. The receiver of claim 1, wherein said means for forming an inverse impairment correlation sequence estimate uses an impairment correlation matrix sequence, wherein each matrix entry has two terms, a first term associated with spatial impairment correlation and a second term associated with time impairment correlation. 18. The method of claim 7, wherein said step of forming an inverse impairment correlation sequence estimate further comprises the step of: using an impairment correlation matrix sequence, wherein each matrix entry has two terms, a first term associated with spatial impairment correlation and a second term associated with time impairment correlation. 19. The receiver of claim 13, wherein said means for determining branch metrics further comprises: means for forming an inverse impairment correlation sequence estimate wherein said impairment correlation sequence estimate includes a matrix wherein each matrix entry has two terms, a first term associated with spatial impairment correlation and a second term associated with time impairment correlation.

Inventors: BOTTOMLEY GREGORY EDWARD, BOTTOMLEY, GREGORY, EDWARD
Applicants: ERICSSON GE MOBILE INC, ERICSSON INC.
Application year: 1997
Main classification: H04B7
IPC codes: H04B1, H04B7, H04L27