Abstract:
Methods and systems for receiving signals in spread spectrum communications are described. In CDMA systems, for example, signature sequences used to generate correlations with received signals may not have ideal autocorrelation properties. In such cases, the correlations determined by the receiver may include errors which are propagated through channel tap estimates to the demodulated and decoded information symbols. To reduce or eliminate such self-interference or inter-ray interference, the correlations are decorrelated by, for example, matrix multiplying them with values related to values of the autocorrelation function for the signature sequence of interest.

Description:
BACKGROUND 
     The present invention generally relates to the use of Code Division Multiple Access (CDMA) communication techniques in radio communication systems and, more particularly, to receivers which demodulate CDMA signals using estimates of channel tap coefficients. 
     The cellular telephone industry has made phenomenal strides in commercial operations in the United States as well as the rest of the world. Growth in major metropolitan areas has far exceeded expectations and is rapidly outstripping system capacity. If this trend continues, the effects of this industry&#39;s growth will soon reach even the smallest markets. Innovative solutions are required to meet these increasing capacity needs as well as maintain high quality service and avoid rising prices. 
     Throughout the world, one important step in the advancement of radio communication systems is the change from analog to digital transmission. Equally significant is the choice of an effective digital transmission scheme for implementing the next generation technology. Furthermore, it is widely believed that the first generation of Personal Communication Networks (PCNs), employing low cost, pocket-sized, cordless telephones that can be carried comfortably and used to make or receive calls in the home, office, street, car, etc., will be provided by, for example, cellular carriers using the next generation digital cellular system infrastructure. An important feature desired in these new systems is increased traffic capacity. 
     Currently, channel access is achieved using Frequency Division Multiple Access (FDMA) and Time Division Multiple Access (TDMA) methods. In FDMA, a communication channel is a single radio frequency band into which a signal&#39;s transmission power is concentrated. Signals which can interfere with a communication channel include those transmitted on adjacent channels (adjacent channel interference) and those transmitted on the same channel in other cells (co-channel interference). Interference with adjacent channels is limited by the use of band pass filters which only pass signal energy within the specified frequency band. Co-channel interference is reduced to tolerable levels by restricting channel re-use by providing a minimum separation distance between cells in which the same frequency channel is used. Thus, with each channel being assigned a different frequency, system capacity is limited by the available frequencies as well as by limitations imposed by channel reuse. 
     In TDMA systems, a channel consists of, for example, a time slot in a periodic train of time intervals over the same frequency. Each period of time slots is called a frame. A given signal&#39;s energy is confined to one of these time slots. Adjacent channel interference is limited by the use of a time gate or other synchronization element that only passes signal energy received at the proper time. Thus, with each channel being assigned a different time slot, system capacity is limited by the available time slots as well as by limitations imposed by channel reuse as described above with respect to FDMA. 
     With FDMA and TDMA systems (as well as hybrid FDMA/TDMA systems), one goal of system designers is to ensure that two potentially interfering signals do not occupy the same frequency at the same time. In contrast, Code Division Multiple Access (CDMA) is a channel access technique which allows signals to overlap in both time and frequency. CDMA is a type of spread spectrum communications, which has been around since the days of World War II. Early applications were predominantly military oriented. However, today there has been an increasing interest in using spread spectrum systems in commercial applications since spread spectrum communications provides robustness against interference, which allows for multiple signals to occupy the same bandwidth at the same time. Examples of such commercial applications include digital cellular radio, land mobile radio, and indoor and outdoor personal communication networks. 
     In a CDMA system, each signal is transmitted using spread spectrum techniques. In principle, the informational data stream to be transmitted is impressed upon a much higher rate data stream known as a signature sequence. Typically, the signature sequence data are binary, providing a bit stream. One way to generate this signature sequence is with a pseudo-noise (PN) process that appears random, but can be replicated by an authorized receiver. The informational data stream and the high bit rate signature sequence stream are combined by multiplying the two bit streams together, assuming the binary values of the two bit streams are represented by +1 or -1. This combination of the higher bit rate signal with the lower bit rate data stream is called spreading the informational data stream signal. Each informational data stream or channel is allocated a unique signature sequence. 
     A plurality of spread information signals modulate a radio frequency carrier, for example by binary phase shift keying (BPSK), and are jointly received as a composite signal at the receiver. Each of the spread signals overlaps all of the other spread signals, as well as noise-related signals, in both frequency and time. If the receiver is authorized, then the composite signal is correlated with one of the unique signature sequences, and the corresponding information signal can be isolated and despread. If quadrature phase shift keying (QPSK) modulation is used, then the signature sequence may consist of complex numbers (having real and imaginary parts), where the real and imaginary parts are used to modulate two carriers at the same frequency, but ninety degrees different in phase. 
     Traditionally, a signature sequence is used to represent one bit of information. Receiving the transmitted sequence or its complement indicates whether the information bit is a +1 or -1, sometimes denoted &#34;0&#34; or &#34;1&#34;. The signature sequence usually comprises N bits, and each bit of the signature sequence is called a &#34;chip&#34;. The entire N-chip sequence, or its complement, is referred to as a transmitted symbol. The conventional receiver, e.g., a RAKE receiver, correlates the received signal with the complex conjugate of the known signature sequence to produce a correlation value. Only the real part of the correlation value is computed. When a large positive correlation results, a &#34;0&#34; is detected; when a large negative correlation results, a &#34;1&#34; is detected. 
     The &#34;information bits&#34; referred to above can also be coded bits, where the code used is a block or convolutional code. Also, the signature sequence can be much longer than a single transmitted symbol, in which case a subsequence of the signature sequence is used to spread the information bit. In many radio communication systems, the received signal includes two components: an I (in-phase) component and a Q (quadrature) component. This occurs because the transmitted signal has two components (e.g. QPSK), and/or the intervening channel or lack of coherent carrier reference causes the transmitted signal to be divided into I and Q components. In a typical receiver using digital signal processing, the received I and Q component signals are sampled and stored at least every T c  seconds, where T c  is the duration of a chip. 
     The conventional RAKE receiver performs well provided several conditions are satisfied. The first condition is that the autocorrelation function of the signature sequence is ideal, in that the signature sequence is uncorrelated with a shift of itself. If this is not true, then the different signal rays interfere with one another, which is referred to as self interference. The second condition is that the crosscorrelation between the signature sequence of the desired signal and various shifted versions of the signature sequences of the other CDMA signals is zero. If this is not true, then the other CDMA signals interfere with the desired CDMA signal, degrading performance. This can be particularly significant when another CDMA signal has a much higher power than the desired CDMA signal, commonly referred to as the &#34;near-far&#34; problem. The third condition is that the interference caused by an echo of one transmitted symbol overlapping with the next transmitted symbol should be negligible. If this is not true, then transmitted symbols interfere with past and future transmitted symbols, which is commonly referred to as intersymbol interference (ISI). 
     Ideal autocorrelation functions, however, are commercially impractical to achieve due to, for example, bandwidth limitations. Accordingly, some solution for dealing with self-interference is desirable to improve the performance of CDMA receivers. 
     SUMMARY 
     The present invention provides an efficient approach for estimating channel tap coefficients that eliminates the problem of self interference in CDMA systems. According to exemplary embodiments, elimination of self interference can be accomplished by decorrelating the correlation values with respect to one another. Decorrelation is performed, for example, by multiplying an inverse of a matrix including autocorrelation function values with the vector of received bits correlated with the signature sequence associated with that autocorrelation function. This decorrelation procedure can be performed, for example, before, after or within conventional channel tracking processes. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     The foregoing and other, objects, features and advantages of the present invention will be more readily understood upon reading the following detailed description in conjunction with the drawings in which: 
     FIG. 1 is a block diagram of an exemplary spread-spectrum communications link; 
     FIG. 2 is a block diagram of a conventional coherent RAKE detector; 
     FIG. 3 is a block diagram of a conventional channel tracker; 
     FIG. 4 is a block diagram of an exemplary embodiment of a channel tracker according to the present invention; 
     FIG. 5 is a block diagram depicting another exemplary embodiment of a channel tracker according to the present invention; 
     FIG. 6 is a block diagram of yet another exemplary embodiment of a channel tracker according to the present invention; and 
     FIG. 7 is a block diagram illustrating an exemplary decorrelator according to the present invention. 
    
    
     DETAILED DESCRIPTION 
     An exemplary spread-spectrum communication link is shown in FIG. 1. First, in spreader 102, an informational data stream consisting of information symbols is impressed upon a much higher rate data stream known as a signature sequence to generate a spread or transmitted data sequence. It is common for the period of the signature sequence to occupy one data symbol period, so that each data symbol is spread by the same N-chip signature sequence. In general, this signature sequence may be representedby real and imaginary numbers, corresponding to sending a chip value on thecarrier frequency (I channel) or on a 90-degree shifted version of the carrier frequency (Q channel). Also, the signature sequence may be a composite of multiple sequences, where one of these sequences may be a Walsh-Hadamard code word. 
     Information symbols can be M-ary, taking on one of M possible values. For example, for M=2, binary symbols are used, which can be represented as +1 and -1 values. Spreading information symbol b using signature sequence s(k), which consists of +1 and -1 chip values, gives the transmitted sequence t(k): 
     
         t(k)=b s(k)                                                (1) 
    
     This spreading operation could also be determined using digital logic, withsequences of 0&#39;s and 1&#39;s and spreading by performing exclusive-OR operations. Other forms of spreading are possible. For example, a set of Mbits can be spread by using the bits to select one set of N code words, where N=2 M . The set of code words could be an orthogonal set, such asthe Walsh code word set. 
     The spread signal is then modulated onto a radio-frequency carrier in modulator 104. If the spread data symbols are binary, then binary phase-shift keying (BPSK) would be an appropriate modulation. The modulated signal is passed to antenna 106 for transmission using electromagnetic waves. At the receiver, receive antenna 108 collects signal energy and passes it to a radio receiver 110, which provides the necessary amplification, filtering, and mixing operations to convert the radio signal to a complex, baseband signal consisting of in-phase (I) and quadrature (Q) components as is well known in the art. These components are usually sampled once per chip period and may be stored in a buffer (not shown). 
     The received data samples are passed to a correlator 112, which correlates the received data samples to the known signature sequence. This process issometimes referred to as de-spreading, since the correlation coherently combines the spread data values back into one informational value when thecorrelator is aligned with an image of the transmitted signal. The correlations are provided to a detector 114, which produces a detected informational data stream. The form of detector used depends on the characteristics of the radio channel and complexity limitations. 
     In wireless systems, the radio channel gives rise to multipath fading and multipath dispersion, because of signal reflections from buildings, cars, or nearby mountain ranges. As a result, the signal proceeds to the receiver along not one, but many paths, so that the receiver receives manyechoes or rays having different and randomly varying delays and amplitudes.The received signal is then a composite of multiple versions of the transmitted signal that have propagated along different paths having relative time delays usually less than one informational symbol period. Each distinguishable ray has a certain time of arrival k T c  seconds relative to the arrival of the first ray. If t(k) denotes the spread data chip samples and r(k) denotes the received chip samples, where k is the discrete time index, then multipath time dispersion can be modeled as: ##EQU1##where J is the number of rays or channel taps caused by the multipath dispersion, c(j) are complex-valued channel tap coefficients, and n(k) models impairments such as noise or interference. As a result of multipathtime dispersion, the correlator 112 produces several de-spread values, one for each of the J channel taps. 
     One form of detector 114 designed to process such a radio channel is known as the RAKE detector. Such a detector combines the de-spread values coherently to maximize the detection statistic signal power. One form of the RAKE detector, designed for binary information symbols, is shown in FIG. 2. Therein, correlation values are passed through a tapped delay line202. Note that in FIG. 2 (and many of the other Figures) although many signal lines will be present in a physical embodiment of such a receiver, only two signal lines are illustrated as outputs from the tapped delay line 202 to illustrate the described concepts without unduly complicating the Figure. When the earliest arriving ray correlation is at one end of the tapped delay line and the latest arriving ray correlation is at the other end of the tapped delay line, which occurs once per information symbol period, the values stored in the delay line are multiplied in multipliers 204 by RAKE tap coefficients, producing products which are summed in adder 206. The sign of the resulting sum is taken in 208, givinga detected information bit value, e.g., ±1. 
     Mathematically, suppose r(k)=I(k)+iQ(k) are the complex received chip samples during a particular information symbol period, where I(k) are the I component samples, Q(k) are the Q component samples, i denotes the imaginary component, and k is the sample index (e.g., a discrete time index). The correlator 112 correlates these data samples to the known signature sequence, s(k), to produce: ##EQU2##where the * superscript denotes complex conjugation, which is preferred if the signature sequence is complex. 
     The RAKE detector weights the correlations and sums the results to produce a detection statistic z for transmitted symbol b. ##EQU3##where a(j) are the RAKE tap coefficients. Theoretically, the RAKE tap coefficients should be equal to the channel tap coefficients: 
     
         a(k)=c(k)                                                  (5) 
    
     In practice, the RAKE tap coefficients are estimates of the channel tap coefficients, provided by channel tracker 116. 
     Coherent detectors other than the conventional RAKE detector are known. Forexample, joint demodulation could be used to jointly demodulate a pluralityof communication signals, as described in U.S. Pat. No. 5,506,861 by Bottomley, which disclosure is incorporated here by reference. 
     In conventional forms of coherent detection, performance is limited by the accuracy of the channel tap coefficient estimates produced by the channel tracker. A conventional channel tracker 300 is illustrated in FIG. 3. Correlation values are provided to information removers 302, which adjust the correlation values based on the detected information. The adjusted correlations are provided to estimate update processors 304, which update the channel tap coefficient estimates stored in memories 306, producing updated channel tap coefficient estimates. One way of updating the estimates, for example, is to weight the previous estimate by λ andadd to it the adjusted correlation weighted by (1-λ). Other forms ofupdating are possible, as is well known to those skilled in the art. 
     These conventional approaches give accurate channel estimates when the signature sequence has perfect autocorrelation properties. In practical commercial systems, with finite bandwidth constraints, the autocorrelationof the signature sequence with itself is not perfect, so that echoes or rays of the signal interfere with one another when channel estimation is performed. 
     This problem is illustrated by an example, in which there are two rays (i.e., J=2) and no impairment (i.e., n(k)=0). From equations (1) and (2), the received signal is given by: 
     
         r(k)=c(0)b s(k)+c(1)b s(k-d)                               (6) 
    
     where d is the delay of the second ray relative to the first. At the receiver, the despread signal is obtained by correlating to the known signature sequence s(k) at the times rays are present. For the sake of illustration, assume the correlation is normalized by dividing by N, the length of the sequence. From equations (3) and (6), the correlations x(m) at m=0 and m=d are given by: 
     
         x(0)=b c(0)+b c(1)C.sub.s,s (d)                            (7) 
    
     
         x(d)=b c(0)C*.sub.s,s (-d)+b c(1)                          (8) 
    
     where C s ,s (d) is a normalized aperiodic autocorrelation function of the signature sequence s(k) at delay d. That is, ##EQU4##The information removers 302 effectively divide the correlations by the detected information symbol, b det . Assuming no detection error, the adjusted values are given by: 
     
         x.sub.a (0)=c(0)+c(1)C.sub.s,s (d)                         (10) 
    
     
         x.sub.a (d)=c(0)C*.sub.s,s (-d)+c(1)                       (11) 
    
     If the signature sequence has perfect autocorrelation properties, then C s ,s (d) and C* s ,s (-d) would both be zero, and the adjusted correlation values would give instantaneous estimates of the channel tap coefficients. However, when C s ,s (d) and C* s ,s (-d) are nonzero,then the adjusted correlation values are distorted by the presence of othersignal rays. Using distorted channel tap estimates in the detector leads toa loss in performance. Thus, conventional channel tap coefficient estimation is degraded by inter-ray interference, which leads to a degradation in receiver performance. 
     According to exemplary embodiments of the present invention this interference problem can be solved by decorrelating the correlation valueswith respect to one other. As a result, inter-ray interference is mitigated. 
     The principle will first be discussed with respect to the two-ray example used previously. Expressions (7) and (8) can be viewed as a system of two equations in two unknowns, the unknowns being bc(0) and bc(1) (bc 0  and bc 1 , respectively, in equation (12) below). Since the signature sequence is known at the receiver, its autocorrelation function is also known. Thus, equations (7) and (8) can be expressed as: ##EQU5##which has the form Ax=y. The receiver has knowledge of A and y, thus it cansolve for x, the channel tap coefficients. Observe that the unknowns do notcontain inter-ray interference. 
     One way of solving this equation is to multiply both sides by the inverse, so that x=A -1  y. In this case, the y vector contains the measured correlation values, which contain inter-ray crosscorrelation terms. The matrix A -1  effectively removes these inter-ray crosscorrelation terms, which can be viewed as &#34;decorrelating&#34; the correlation values from one another. This decorrelation should not be confused with the original correlation to the signature sequence, as one does not want to undo the despreading. In practice, while C s ,s (d) are nonzero, they are usually not too large, so that A -1  is well defined. 
     Variations on this concept will be apparent to those skilled in the art. For example, when impairment is present, i.e., n(k)≠0, it may be desirable to add noise power estimates to the diagonal of the A matrix. Ifnoise power estimates are unavailable, a nominal noise value can be added, based on standard or limiting operating conditions for the receiver. Moreover, the decorrelation approach is easily extended to an arbitrary number of rays corresponding to arbitrary delay times. For J rays, the vector y consists of J correlations, and the matrix A has J rows and J columns. Finally, other definitions of correlation can be employed, such as periodic correlation. 
     The present invention will now be described with respect to FIG. 4, which illustrates a channel tracker according to an exemplary embodiment of the present invention which can replace the channel tracker 116 shown in FIG. 1. Therein, correlation values are provided to decorrelator 402, which decorrelates the correlation values so that inter-ray interference is removed. The decorrelated values are then passed to, for example, a conventional channel tracker 300, which treats the decorrelated values as if they were correlation values according to FIG. 3. Thus, the step of decorrelation has been inserted into the channel tracking process. 
     The decorrelation operation does not have to be performed before conventional channel tracking. An alternative embodiment is shown in FIG. 5, in which the decorrelator 402 follows the conventional tracker 300. A third alternative is shown in FIG. 6, in which the decorrelation operation402 occurs within the conventional channel tracker, just after the information removal. The decorrelation operation can be implemented in a variety of ways. An exemplary embodiment is given in FIG. 7 for purposes of illustration rather than limitation. The decorrelator 402 effectively solves the system Ax=y for x. One way of doing this is by multiplying the vector y by A -1 , which is a matrix multiply operation. In FIG. 7, this is implemented by a matrix multiplier 700. The matrix multiply would be provided with the correlation values x and the matrix M, and form the product Mx. The matrix M would be A -1 , which could be pre-computed and stored for various channel tap locations and signature sequences. Other methods for solving Ax=y are possible, including Gaussian elimination, and all such techniques are contemplated by the present invention. 
     In some applications, it may be desirable to shorten the correlations used by the channel tracker, so that interference between information symbol periods is not introduced. For example, if d=1, then the despreading correlation may only correlate to the partial sequence s(1) through s(N-2), rather than the full sequence s(0) through s(N-1). 
     The above-described exemplary embodiments are intended to be illustrative in all respects, rather than restrictive, of the present invention. Thus the present invention is capable of many variations in detailed implementation that can be derived from the description contained herein by a person skilled in the art. All such variations and modifications are considered to be within the scope and spirit of the present invention as defined by the following claims.