Efficient multipath centroid tracking circuit for a code division multiple access (CDMA) system

Information

  • Patent Grant
  • 7593453
  • Patent Number
    7,593,453
  • Date Filed
    Thursday, February 26, 2004
    20 years ago
  • Date Issued
    Tuesday, September 22, 2009
    15 years ago
Abstract
A spread spectrum signal having an associated code is tracked at a receiver. A plurality of components of the spread spectrum signal are despread using the associated code. Each of the plurality of components has a different code phase than all others of the plurality of code phases. Each of the plurality of components is weighted based on a phase difference between that component and a center code phase associated with the plurality of components. A tracking error is determined based on the weighted components.
Description
BACKGROUND

The present invention generally pertains to code sequence tracking in Code Division Multiple Access (CDMA) communication systems, also known as spread-spectrum communication systems. More particularly, the present invention pertains to a system and method for efficient tracking of multipath signal components allowing for combining of multipath signal components to improve data signal detection and despreading by reducing effects of multipath interference, and increase CDMA communication system efficiency by reducing the required transmit power.


Providing quality telecommunication services to user groups which are classified as remote, such as rural telephone systems and telephone systems in underdeveloped countries, has proved to be a challenge over recent years. The past needs created by these services have been partially satisfied by wireless radio services, such as fixed or mobile frequency division multiplex (FDM), frequency division multiple access (FDMA), time division multiplex (TDM), time division multiple access (TDMA) systems, combination frequency and time division systems (FD/TDMA), and other land mobile radio systems. Usually, these remote services are faced with more potential users than can be supported simultaneously by their frequency or spectral bandwidth capacity.


Recognizing these limitations, recent advances in wireless communications have used spread spectrum modulation techniques to provide simultaneous communication by multiple users. Spread spectrum modulation refers to modulating a information signal with a spreading code signal; the spreading code signal being generated by a code generator where the period, Tc, of the spreading code is substantially less than the period of the information data bit or symbol signal. The code may modulate the carrier frequency upon which the information has been sent, called frequency-hopped spreading, or may directly modulate the signal by multiplying the spreading code with the information data signal, called direct-sequence spreading (DS). Spread-spectrum modulation produces a signal with bandwidth substantially greater than that required to transmit the information signal. The original information is recovered by synchronously demodulating and despreading of the signal at the receiver. The synchronous demodulator uses a reference signal to synchronize the despreading circuits to the input spread-spectrum modulated signal to recover the carrier and information signals. The reference signal may be a spreading code which is not modulated by an information signal. Such use of a synchronous spread-spectrum modulation and demodulation for wireless communication is described in U.S. Pat. No. 5,228,056 entitled SYNCHRONOUS SPREAD-SPECTRUM COMMUNICATIONS SYSTEM AND METHOD by Donald L. Schilling, which is incorporated herein by reference.


One area in which spread-spectrum techniques are used is in the field of mobile cellular communications to provide personal communication services (PCS). Such systems desirably support large numbers of users, control Doppler shift and fade, and provide high speed digital data signals with low bit error rates. These systems employ a family of orthogonal or quasi-orthogonal spreading codes, with a pilot spreading code sequence that is synchronized to the family of codes. Each user is assigned one of the spreading codes from the family as a spreading function. Related problems of such a system include handling multipath fading effects. Solutions to such problems include diversity combining of multipath signals. The problems associated with spread spectrum communications, and methods to increase capacity of a multiple access, spread-spectrum system are described in U.S. Pat. No. 4,901,307 entitled SPREAD SPECTRUM MULTIPLE ACCESS COMMUNICATION SYSTEM USING SATELLITE OR TERRESTRIAL REPEATERS by Gilhousen et al. which is incorporated herein by reference.


The problems associated with the prior art systems focus around reliable reception and synchronization of the receiver despreading circuits to the received signal. The presence of multipath fading introduces a particular problem with spread spectrum receivers in that a receiver must somehow track the multipath components to maintain code-phase lock of the receiver's despreading means with the input signal. Prior art receivers generally track only one or two of the multipath signals, but this method may not be satisfactory because the combined group of low-power multipath signal components may actually contain far more power than the one or two strongest multipath components. The prior art receivers track and combine only the strongest components to maintain a predetermined Bit Error Rate (BER) of the receiver. Such a receiver is described, for example, in U.S. Pat. No. 5,109,390 entitled DIVERSITY RECEIVER IN A CDMA CELLULAR TELEPHONE SYSTEM by Gilhousen et al. which is incorporated herein by reference. A receiver that combines all multipath components, however, is able to maintain the desired BER with a signal power that is lower than that of prior art systems because more signal power is available to the receiver. Consequently, there is a need for a spread spectrum communication system employing a receiver that tracks substantially all of the multipath signal components, so that substantially all multipath signals may be combined in the receiver. This would reduce the required transmit power of the signal for a given BER.


SUMMARY

A spread spectrum signal having an associated code is tracked at a receiver. A plurality of components of the spread spectrum signal are despread using the associated code. Each of the plurality of components has a different code phase than all others of the plurality of code phases. Each of the plurality of components is weighted based on a phase difference between that component and a center code phase associated with the plurality of components. A tracking error is determined based on the weighted components.





BRIEF DESCRIPTION OF THE DRAWING(S)


FIG. 1 is a block diagram of exemplary circuitry which implements the method of tracking the received spreading-code phase.



FIG. 2 is a block diagram of exemplary circuitry which implements the acquisition decision method of the correct spreading-code phase of the received pilot code of the present invention.



FIG. 3 is a block diagram of the tracking circuit that tracks the median of the received multipath signal components.



FIG. 4 is a block diagram of the tracking circuit that tracks the centroid of the received multipath signal components.



FIG. 5 is a block diagram of the correlating circuit which creates a tracking vector signal for a generalized quadratic tracking detector.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)

Three CDMA spreading-code tracking methods in multipath fading environments are described which track the code phase of a received multipath spread-spectrum signal. The first is the prior art tracking circuit which simply tracks the spreading code phase with the highest detector output signal value, the second is a tracking circuit that tracks the median value of the code phase of the group of multipath signals, and the third, the system and method of the present invention, is the centroid tracking circuit which tracks the code-phase of an optimized, least mean squared weighted average of the multipath signal components. The following describes the methods by which the spreading code phase of the received CDMA signal is tracked.


A tracking circuit has operating characteristics that reveal the relationship between the time error and the control voltage that drives a Voltage Controlled Oscillator (VCO) of a spreading-code phase tracking circuit. When there is a positive timing error, the tracking circuit generates a negative control voltage to offset the timing error. When there is a negative timing error, the tracking circuit generates a positive control voltage to offset the timing error. When the tracking circuit generates a zero value, this value corresponds to the perfect time alignment called the ‘lock-point’. FIG. 1 shows the basic tracking circuit. Received signal r(t) is applied to matched filter 301, which correlates r(t) with a local code-sequence c(t) generated by Code Generator 303. The output signal of the matched filter x(t) is sampled at the sampler 302 to produce samples x[nT] and x[nT+T/2]. The samples x[nT] and x[nT+T/2] are used by a tracking circuit 304 to determine if the phase of the spreading-code c(t) of the code generator 303 is correct. The tracking circuit 304 produces an error signal e(t) as an input to the code generator 303. The code generator 303 uses this signal e(t) as an input signal to adjust the code-phase it generates.



FIG. 2 shows the tracking circuit as it is typically used in a code division multiple access (CDMA) system receiver which uses an adaptive vector correlator (AVC) to estimate the channel impulse response and to obtain a reference value for coherent combining of received multipath signal components. For this type of system, a pilot signal is transmitted as a synchronization reference to all receivers. The described system receiver employs an array of correlators to estimate the complex channel response affecting each multipath component, the receiver then compensates for the channel response and coherently combines the received multipath signal components. This approach is referred to as maximal ratio combining.


Referring to FIG. 2, the input signal x(t) to the system includes interference noise of other message channels, multipath signals of message channels, thermal noise, and multipath signals of the pilot signal. The input signal is provided to AVC 601 which includes a despreading means 602, channel estimation means for estimating the channel response 604, correction means for correcting a signal for effects of the channel response 603, and adder 605 in the present invention. The AVC despreading means 602 is composed of multiple code correlators, with each correlator using a different phase of the pilot code c(t) provided by the pilot code generator 608. The output of this despreading means corresponds to a noise power level if the phase of the local pilot code of the despreading means is not in phase with the input code signal, or it corresponds to a received pilot signal power level plus noise power level if the input pilot code and locally generated pilot code have the same phase. The output signals of the correlators of the despreading means are corrected for the channel response by the correction means 603 and are applied to the adder 605 which collects all multipath pilot signal power. The channel response estimation means 604 receives the combined pilot signal and the output signals of the despreading means 602, and provides a channel response estimate signal, w(t), to the correction means 603 of the AVC. The output signal of the despreading means 602 is also provided to the acquisition decision means 606 which decides, based on a particular algorithm such as a sequential probability ratio test (SPRT), if the present output levels of the despreading circuits correspond to synchronization of the locally generated code to the desired input code phase. If the detector finds no synchronization, then the acquisition decision means sends a control signal a(t) to the local pilot code generator 608 to offset its phase by one or more chip period. When synchronization is found, the acquisition decision means informs tracking circuit 607, which achieves and maintains a close synchronization between the received and locally generated code sequences.


In a CDMA system, the signal, s(t), shown in Equation (1) transmitted by the reference user is written in the low-pass representation as.










s


(
t
)


=




k
=

-












c
k




P
Tc



(

t
-

kT
c


)








Equation





1








where ck represents the spreading code coefficients, PTc (t) represents the spreading code chip waveform, and Tc is the chip duration. Assuming that the reference user is not transmitting data, only the spreading code modulates the carrier. Referring to FIG. 1, the received signal, r(t), is described by Equation (2)










r


(
t
)


=




i
=
1

M








a
i



s


(

t
-

τ
i


)








Equation





2







In Equation (2), ai is an attenuation factor due to fading effect of the multipath channel on the i-th path and τi is the random time delay associated with the same path. The receiver passes the received signal through a matched filter, which is implemented as a correlation receiver and is described below. This operation is done in two steps: first the signal is passed through a chip matched filter and sampled to recover the spreading code chip values, then this spreading sequence is correlated with the locally generated code sequence.



FIG. 1 shows the chip matched filter 301, matched to the chip waveform PTc (t), and the sampler 302. The signal x(t) at the output terminal of the chip matched filter is given by Equation (3),











x


(
t
)


=




i
=
k

M






k
=

-








a
i



c
k



g


(

t
-

τ
i

-

kT
c


)











where




Equation





3







g


(
t
)


=



P
Tc



(
t
)


*


h
R



(
t
)







Equation





4








Here, hR (t) is the impulse response of the chip matched filter and “*” denotes convolution. By changing the order of the summations, Equation (3) can be rewritten as Equation (5),











x


(
t
)


=




k
=

-








c
k



f


(

t
-

kT
c


)










where




Equation





5







f


(
t
)


=




i
=
1

M




a
i



g


(

t
-

τ
i


)








Equation





6







In the multipath channel described above, the sampler samples the output signal of the matched filter to produce x(nT) at the maximum power level points of g(t). In practice, however, the waveform g(t) may be distorted due to the multipath signal reception, and a perfect time alignment of the signals may not be available.


When the multipath distortion in the channel is negligible and a perfect estimate of the timing is available, i.e., a1 a1=1, τ1=0, and ai=0, i=2, . . . , M, the received signal is r(t)=s(t). Then, with this ideal channel model, the output of the chip matched filter becomes










x


(
t
)


=




k
=

-








c
k



g


(

t
-

kT
c


)








Equation





7







When there is multipath fading, however, the received spreading code chip value waveform is distorted, and has a number of local maxima that can change from one sampling interval to another depending on the channel characteristics


For multipath fading channels with quickly changing channel characteristics, it is not practical to try to locate the maximum of the waveform. f(t) in every chip period interval. Instead, a time reference can be obtained from the characteristics of f(t) that may not change as quickly. Three tracking methods are described based on different characteristics of f(t)


Prior art tracking methods include a code tracking circuit in which the receiver attempts to determine the maximum matched filter output value of the chip waveform and sample the signal at that point. However, in multipath fading channels, the receiver despread spreading-code waveform can have a number of local maxima, especially in a mobile environment. In the following, f(t) represents the received signal waveform of the spreading code chip convolved with the channel impulse response. The frequency response characteristic of f(t) and the timing of its maximum correlation can change rather quickly making it impractical to track the maximum of f(t).


Define τ to be the time estimate that the tracking circuit calculates during a particular sampling interval. Also, define the following error function









ɛ
=

{





{

t
:


τ
-
t

>
δ







f


(
t
)









t



,









τ
-
t



>

δ





ɛ


=


0








τ
-
t




<
δ








Equation





8








The tracking circuits of the prior art calculate a value of the input signal that minimizes the error ε. One can write










min





ɛ

=

1
-








τ
max






τ
-
δ


τ
+
δ





f


(
t
)









t









Equation





9







Assuming f(t) has a smooth frequency response characteristic in the values given, the value of τ for which f(t) is maximum minimizes the error ε, so the tracking circuit tracks the maximum point of f(t)


The Median Weighted Tracking Method minimizes the absolute weighted error, defined as,









ɛ
=




-









t
-
τ





f


(
t
)









t







Equation





10







This tracking method calculates the “median” signal value of f(t) by collecting information from all paths, where f(t) is as in Equation (6). In a multipath fading environment, the waveform f(t) can have multiple local maxima, but only one median.


To minimize ε, the derivative of Equation (10) is taken with respect to τ and is equated it to zero, which yields Equation (11).













-


τ




f


(
t
)





t



=



τ





f


(
t
)





t







Equation





11







The value of τ that satisfies (11) is called the “median” of f(t). Therefore, the Median Tracking Method of the present embodiment tracks the median of f(t). FIG. 3 shows an implementation of the tracking circuit based on minimizing the absolute weighted error defined above. The signal x(t) and its one-half chip offset version x(t+T/2) are sampled by the A/D 401 at a rate 1/T. Equation (12) determines the operating characteristic of the circuit in FIG. 3:










ɛ


(
τ
)


=




n
=
1


2

L











f


(

τ
-

n






T
/
2



)





-




f


(

τ
+

n






T
/
2



)










Equation





12







Tracking the median of a group of multipath signals keeps the received energy of the multipath signal components equal on the early and late sides of the median point of the correct locally generated spreading-code phase Cn. The tracking circuit consists of an A/D converter 401 which samples an input signal x(t) to form the half chip offset samples. The half chip offset samples are alternatively grouped into even samples called an early set of samples x(nT+τ) and odd samples called a late set of samples x(nT+(T/2)+τ). The first correlation bank adaptive matched filter 402 multiplies each early sample by the spreading-code phases c(n+1), c(n+2), . . . , c(n+L), where L is small compared to the code length and approximately equal to number of chips of delay between the earliest and latest multipath signal. The output of each correlator is applied to a respective first sum-and-dump bank 404. The magnitudes of the output values of the L sum-and-dump circuits are calculated in the calculator 406 and then summed in summer 408 to give an output value proportional to the signal energy in the early multipath signals. Similarly, a second correlation bank adaptive matched filter 403 operates on the late samples, using code phases c(n−1), c(n−2), . . . , c(n−L), and each output signal is applied to a respective sum-and-dump circuit in an integrator 405. The magnitudes of the output signals of the L sum-and-dump circuits are calculated in calculator 407 and then summed in summer 409 to give a value for the late multipath signal energy. Finally, the adder 410 calculates the difference and produces error signal ε(τ) of the early and late signal energy values.


The tracking circuit adjusts by means of error signal ε(τ) the locally generated code phases c(t) to cause the difference between the early and late values to tend toward 0.


The optimal spreading-code tracking circuit of one embodiment of the present invention is called the squared weighted tracking (or centroid) circuit. Defining τ to denote the time estimate that the tracking circuit calculates, based on some characteristic of .function.(t), the centroid tracking circuit minimizes the squared weighted error defined as









ɛ
=




-










t
-
τ



2



f


(
t
)









t







Equation





13








This function inside the integral has a quadratic form, which has a unique minimum. The value of τ that minimizes ε can be found by taking the derivative of the above equation with respect to τ and equating to zero, which gives













-







(



-
2


t

+

2

τ


)



f


(
t
)









t



=
0




Equation





14








Therefore, the value of τ that satisfies










τ
-


1
β






-







tf


(
t
)









t





=
0




Equation





15








is the timing estimate that the tracking circuit calculates, and .beta. is a constant value.


Based on these observations, a realization of the tracking circuit of the present invention minimizing the squared weighted error is shown in FIG. 4. The following equation determines the error signal ε(τ) of the centroid tracking circuit:










ɛ


(
τ
)


=





n
=
1


2

L








n


[




f


(

τ
-

nT
/
2


)




-



f


(

τ
+

nT
/
2


)





]



=
0





Equation





16








The value that satisfies ε(τ)=0 is the perfect estimate of the timing.


The early and late multipath signal energy on each side of the centroid point are equal. The centroid tracking circuit shown in FIG. 4 consists of an A/D converter 501 which samples an input signal x(t) to form the half chip offset samples. The half chip offset samples are alternatively grouped as an early set of samples x(nT+τ) and a late set of samples x(nT+(T/2)+τ). The first correlation bank adaptive matched filter 502 multiplies each early sample and each late sample by the positive spreading-code phases c(n+1), c(n+2), . . . , c(n+L), where L is small compared to the code length and approximately equal to number of chips of delay between the earliest and latest multipath signal. The output signal of each correlator is applied to a respective one of L sum-and-dump circuits of the first sum and dump bank 504. The magnitude value of each sum-and-dump circuit of the sum and dump bank 504 is calculated by the respective calculator in the calculator bank 506 and applied to a corresponding weighting amplifier of the first weighting bank 508. The output signal of each weighting amplifier represents the weighted signal energy in a multipath component signal.


The weighted early multipath signal energy values are summed in sample adder 510 to give an output value proportional to the signal energy in the group of multipath signals corresponding to positive code phases which are the early multipath signals. Similarly, a second correlation bank adaptive matched filter 503 operates on the early and late samples, using the negative spreading phases c(n−1), c(n−2), . . . , c(n−L), each output signal is provided to a respective sum-and-dump circuit of discrete integrator 505. The magnitude value of the L sum-and-dump output signals is calculated by the respective calculator of calculator bank 507 and then weighted in weighting bank 509. The weighted late multipath signal energy values are summed in sample adder 511 to give an energy value for the group of multipath signals corresponding to the negative code phases which are the late multipath signals. Finally, the adder 512 calculates the difference between the early and late signal energy values to produce error sample value ε(τ).


The tracking circuit of FIG. 4 produces error signal ε(τ) which is used to adjust the locally generated code phase c(nT) to keep the weighted average energy in the early and late multipath signal groups equal. The embodiment shown uses weighting values that increase as the distance from the centroid increases. The signal energy in the earliest and latest multipath signals is probably less than the multipath signal values near the centroid. Consequently, the difference calculated by the adder 510 is more sensitive to variations in delay of the earliest and latest multipath signals.


In another embodiment of the tracking method, the tracking circuit adjusts sampling phase to be “optimal” and robust to multipath. Let f(t) represent the received signal waveform as in Equation 16 above. The particular method of optimizing starts with a delay locked loop with an error signal ε(τ) that drives the loop. The function ε(τ) must have only one zero at τ=τ0 where τ0 is optimal. The optimal form for ε(τ) has the canonical form










ɛ


(
τ
)


=




-







w


(

t
,
τ

)







f


(
t
)




2








t







Equation





17








where w(t, τ) is a weighting function relating f(t) to the error ε(τ), and the following holds










ɛ


(

τ
+

τ
0


)


=




-







w


(

t
,

τ
+

τ
0



)







f


(
t
)




2








t







Equation





18








It follows from Equation 18 that w(t, τ) is equivalent to w(t−τ). Considering the slope M of the error signal in the neighborhood of a lock point τ0:









M
=






ɛ


(
τ
)





τ






τ
0



=

-




-







w
'



(

t
-

τ
0


)



g


(
t
)









t









Equation





19








where w′(t, τ) is the derivative of w(t, τ) with respect to τ, and g(t) is the to average of |f(t)|2.


The error ε(τ) has a deterministic part and a noise part. Let z denote the noise component in ε(τ), then |z|2 is the average noise power in the error function ε(τ). Consequently, the optimal tracking circuit maximizes the ratio









F
=


M
2




z


2






Equation





20








The implementation of the Quadratic Detector is now described. The discrete error value e of an error signal ε(τ) is generated by performing the operation

e=yTBy  Equation 21

where the vector y represents the received signal components yi, i=0, 1, . . . L−1, as shown in FIG. 5. The matrix B is an L by L matrix and the elements are determined by calculating values such that the ratio F of Equation 20 is maximized.


The Quadratic Detector described above may be used to implement the centroid tracking system described above with reference to FIG. 4. For this implementation, the vector y is the output signal of the sum and dump circuits 504: y={f(τ−LT), f(τ−LT+T/2), f(τ−(L−1)T), . . . f(τ, f(τ+T/2), f(τ+T), . . . f(τ+LT)} and the matrix B is set forth in Table 1.









TABLE 1





B matrix for quadratic form of Centroid Tracking System









embedded image











To understand the operation of the Quadratic Detector, it is useful to consider the following. A spread spectrum (CDMA) signal, s(t) is passed through a multipath channel with an impulse response hc (t). The baseband spread signal is described by Equation (22).










s


(
t
)


=



i











C
i



p


(

t
-

iT
c


)








Equation





22








where Ci is a complex spreading code symbol, p(t) is a predefined chip pulse and Tc is the chip time spacing, where Tc=1/Rc and Rc is the chip rate.


The received baseband signal is represented by Equation (23)










r


(
t
)


=




i




C
i



q


(

t
-

iT
c

-
τ

)




+

n


(
t
)







Equation





23








where q(t)=p(t))*hc(t), τ is an unknown delay and n(t) is additive noise. The received signal is processed by a filter, hR (t), so the waveform, x(t), to be processed is given by Equation (24).










x


(
t
)


=




i




C
i



f


(

t
-








T
c


-
τ

)




+

z


(
t
)







Equation





24








where f(t)=q(t)*hR (t) and z(t)=n(t)*hR (t).


In the exemplary receiver, samples of the received signal are taken at the chip rate, that is to say, 1/Tc. These samples, x(mTc+τ′), are processed by an array of correlators that compute, during the rth correlation period, the quantities given by Equation (25)










v
k

(
r
)


=




m
=
rL


rL
+
L
-
1





x


(


m






T
c


+

τ



)




C

m
-
k

*







Equation





25








These quantities are composed of a noise component wk(r) and a deterministic component yk(r) given by Equation (26).

yk(r)=E[vk(r)]=Lf(kTc+τ′−τ)  Equation 26

In the sequel, the time index r may be suppressed for ease of writing, although it is to be noted that the function f(t) changes slowly with time.


The samples are processed to adjust the sampling phase, τ′, in an optimum fashion for further processing by the receiver, such as matched filtering. This adjustment is described below. To simplify the representation of the process, it is helpful to describe it in terms of the function f(t+τ), where the time-shift, τ, is to be adjusted. It is noted that the function f(t+τ) is measured in the presence of noise. Thus, it may be problematical to adjust the phase τ′ based on measurements of the signal f(t+τ). To account for the noise, the function v(t): v(t)=f(t)+m(t) is introduced, where the term m(t) represents a noise process. The system processor may be derived based on considerations of the function v(t).


The process is non-coherent and therefore is based on the envelope power function |v(t+τ)|2. The functional e(τ′) given in Equation (27) is helpful for describing the process.










e


(

τ


)


=





-










v


(

t
+

τ


-
τ

)




2




t



-



0








v


(

t
+

τ


-
τ

)




2




t








Equation





27







The shift parameter is adjusted for e(τ′)=0, which occurs when the energy on the interval (−∞,τ′−τ] equals that on the interval [τ′−τ, ∞) The error characteristic is monotonic and therefore has a single zero crossing point. This is the desirable quality of the functional. A disadvantage of the functional is that it is ill-defined because the integrals are unbounded when noise is present. Nevertheless, the functional e(τ′) may be cast in the form given by Equation (28).










e


(

τ


)


=




-







w


(
t
)







v


(

t
+

τ


-
τ

)




2




t







Equation





28








where the characteristic function w(t) is equal to sgn(t), the signum function.


To optimize the characteristic function w(t), it is helpful to define a figure of merit, F, as set forth in Equation (29).









F
=



[



e


(


τ
0


+

T
A


)


-

e


(


τ
0


-

T
A


)



_

]

2


VAR


{

e


(

τ
0


)


}







Equation





29







The numerator of F is the numerical slope of the mean error characteristic on the interval [−TA, TA] surrounding the tracked value, τ0′. The statistical mean is taken with respect to the noise as well as the random channel, hc(t). It is desirable to specify a statistical characteristic of the channel in order to perform this statistical average. For example, the channel may be modeled as a Wide Sense Stationary Uncorrelated Scattering (WSSUS) channel with impulse response hc(t) and a white noise process U(t) that has an intensity function g(t) as shown in Equation (30).

hc(t)=√{square root over (g(t))}U(t)  Equation 30

The variance of e(τ) is computed as the mean square value of the fluctuation

e′(τ)=e(τ)−custom charactere(τ)custom character  Equation 31

where <e(τ)> is the average of e(τ) with respect to the noise.


Optimization of the figure of merit F with respect to the function w(t) may be carried out using well-known Variational methods of optimization.


Once the optimal w(t) is determined, the resulting processor may be approximated accurately by a quadratic sample processor which is derived as follows.


By the sampling theorem, the signal v(t), bandlimited to a bandwidth W may be expressed in terms of its samples as shown in Equation (32).

v(t)=Σv(k/W)sinc[(Wt−k)π]  Equation 32

substituting this expansion into equation (z+6) results in an infinite quadratic form in the samples v(k/W+τ′−τ). Making the assumption that the signal bandwidth equals the chip rate allows the use of a sampling scheme that is clocked by the chip clock signal to be used to obtain the samples. These samples, vk are represented by Equation (33).

vk=v(kTc+τ′−Σ)  Equation 33

This assumption leads to a simplification of the implementation. It is valid if the aliasing error is small.


In practice, the quadratic form that is derived is truncated. An example normalized B matrix is given below in Table 2. For this example, an exponential delay spread profile g(t)=exp(−t/T) is assumed with .tau. equal to one chip. An aperture parameter TA equal to one and one-half chips has also been assumed. The underlying chip pulse has a raised cosine spectrum with a 20% excess bandwidth.









TABLE 2





Example B matrix

























0
0
0
0
0
0
0
0
0
0
0


0
0
−0.1
0
0
0
0
0
0
0
0


0
−0.1
0.22
0.19
−0.19
0
0
0
0
0
0


0
0
0.19
1
0.45
−0.2
0
0
0
0
0


0
0
−0.19
0.45
0.99
0.23
0
0
0
0
0


0
0
0
−0.2
0.23
0
−0.18
0.17
0
0
0


0
0
0
0
0
−0.18
−0.87
−0.42
0.18
0
0


0
0
0
0
0
0.17
−0.42
−0.92
−0.16
0
0


0
0
0
0
0
0
0.18
−0.16
−0.31
0
0


0
0
0
0
0
0
0
0
0
−0.13
0


0
0
0
0
0
0
0
0
0
0
0









Code tracking of the above form in a CDMA system employing a Pilot signal can be implemented via a loop phase detector that is implemented in a digital signal processing device (DSP) as follows. The vector y is defined as a column vector which represents the 11 complex output level values of the Pilot AVC 1711, and B denotes an 11×11 symmetric real valued coefficient matrix with pre-determined values to optimize performance with the non-coherent Pilot AVC output values y. The output signal of the phase detector is given by Equation (21).


The following calculations are then performed to implement a proportional plus integral loop filter and the VCO:

x[n]=x[n−1]+βε  Equation 34
z[n]=z[n−1]+x[n]+βε  Equation 35

for β and α which are constants chosen from modeling the system to optimize system performance for the particular transmission channel and application, and where x[n] is the loop filter's integrator output value and z[n] is the VCO output value. The code phase adjustments are made by the modem controller the following C-subroutine:

















if (z > zmx) }



delay phase 1/16 chip;



z − = zmax;



} else if (z < −zmax) {



advance phase 1/16 chip;



z + = zmax;



}










The value of L in the previous section determines the minimum number of correlators and sum-and-dump elements. L is chosen as small as possible without compromising the functionality of the tracking circuit.


The multipath characteristic of the channel is such that the received chip waveform f(t) is spread over QTc seconds, or the multipath components occupy a time period of Q chips duration. The value of L chosen is L=Q. Q is found by measuring the particular RF channel transmission characteristics to determine the earliest and latest multipath component signal propagation delay. QTc is the difference between the earliest and latest multipath component arrival time at a receiver.


The previous description of acquisition and tracking algorithm focuses on a non-coherent method because the acquisition and tracking algorithm described requires non-coherent acquisition following by non-coherent tracking because during acquisition a coherent reference is not available until the AMF, Pilot AVC, Aux AVC, and DPLL are in an equilibrium state. However, it is known in the art that coherent tracking and combining is always optimal because in non-coherent tracking and combining the output phase information of each Pilot AVC finger is lost. Consequently, another embodiment of the invention employs a two step acquisition and tracking system, in which the previously described non-coherent acquisition and tracking algorithm is implemented first, and then the algorithm switches to a coherent tracking method. The coherent combining and tracking method is similar to that described previously, except that the error signal tracked is of the form:

ε=yTAy  Equation 36

where y is defined as a column vector which represents the 11 complex output level values of the Pilot AVC 1711, and A denotes an 11.times. 11 symmetric real valued coefficient matrix with pre-determined values to optimize performance with the coherent Pilot AVC outputs y. An exemplary A matrix is shown below.






A
=



1


0


0


0


0


0


0


0


0


0


0




0


1


0


0


0


0


0


0


0


0


0




0


0


1


0


0


0


0


0


0


0


0




0


0


0


1


0


0


0


0


0


0


0




0


0


0


0


1


0


0


0


0


0


0




0


0


0


0


0


0


0


0


0


0


0




0


0


0


0


0


0



-
1



0


0


0


0




0


0


0


0


0


0


0



-
1



0


0


0




0


0


0


0


0


0


0


0



-
1



0


0




0


0


0


0


0


0


0


0


0



-
1



0




0


0


0


0


0


0


0


0


0


0



-
1








While the present invention has been described in terms of exemplary embodiments, it is understood by one skilled in the are that it may be practiced as described above with variations within the scope of the following claims.

Claims
  • 1. A method implemented in a communication device for tracking a spread spectrum signal having an associated code at a receiver, the method comprising: despreading by a despreading device a plurality of components of the spread spectrum signal using the associated code, each of the plurality of components having a different code phase than all others of the plurality of code phases;weighting each of the plurality of components with a weight value based on a phase difference between that component and a center code phase of the plurality of components; anddetermining a tracking error based on the weighted components.
  • 2. The method of claim 1 further comprising adjusting a phase of the center code phase in response to the tracking error.
  • 3. The method of claim 1 wherein the weight values are proportional to a phase difference of each of the plurality of components and the center code phase.
  • 4. The method of claim 1 wherein the weight values are proportional to a square of a phase difference of each of the plurality of components and the center code phase.
  • 5. A circuit for tracking a spread spectrum signal having an associated code, the circuit comprising: an input configured to receive a received signal;a despread device configured to despread the received signal to produce a plurality of components of the spread spectrum signal using the associated code, each of the plurality of components having a different code phase than all others of the plurality of components; anda weight device configured to weigh each of the plurality of components with a weight value based on a phase difference between that component and a center code phase of the plurality of components, and to determine a tracking error based on the weighted components.
  • 6. The circuit of claim 5 wherein a phase of the center code phase is adjusted in response to the tracking error.
  • 7. The circuit of claim 5 wherein the weight device weighs proportional to a phase difference of each of the plurality of components and the center code phase.
  • 8. The circuit of claim 5 wherein the weight device weighs proportional to a square of a phase difference of each of the plurality of components and the center code phase.
  • 9. A circuit for tracking a spread spectrum signal having an associated code, the circuit comprising: an input configured to receive a received signal;a plurality of adaptive matched filters configured to despread the received signal to produce a plurality of components of the spread spectrum signal using the associated code, each of the plurality of components having a different code phase than all others of the plurality of components;a weighting bank configured to weigh each of the plurality of components with a weight value based on a phase difference between that component and a center code phase of the plurality of components; andan adder configured to add the weighted components to determine a tracking error.
  • 10. The circuit of claim 9 wherein a phase of the center code phase is adjusted in response to the tracking error.
  • 11. The circuit of claim 9 wherein the weight values are proportional to a phase difference of each of the plurality of components and the center code phase.
  • 12. The circuit of claim 9 wherein the weight values are proportional to a square of a phase difference of each of the plurality of components and the center code phase.
CROSS REFERENCE TO RELATED APPLICATION(S)

This application is a continuation of U.S. patent application Ser. No. 10/071,899, filed Feb. 8, 2002, which is a continuation of U.S. patent application Ser. No. 09/261,689, filed on Mar. 3, 1999, now U.S. Pat. No. 6,381,264, issued on Apr. 30, 2002, which is a continuation of U.S. patent application Ser. No. 08/669,771, filed on Jun. 27, 1996, now U.S. Pat. No. 5,912,919, issued on Jun. 15, 1999, which claims the benefit of U.S. Provisional Application 60/000,775 filed on Jun. 30, 1995.

US Referenced Citations (233)
Number Name Date Kind
3761610 Krallinger et al. Sep 1973 A
4069392 Goldenberg et al. Jan 1978 A
4156277 Seitz et al. May 1979 A
4292623 Eswaran et al. Sep 1981 A
4320513 Lampert Mar 1982 A
4384307 Kuzmik et al. May 1983 A
4385206 Bradshaw et al. May 1983 A
4403322 Kato et al. Sep 1983 A
4425665 Stauffer Jan 1984 A
4458314 Grimes Jul 1984 A
4480307 Budde et al. Oct 1984 A
4570220 Tetrick et al. Feb 1986 A
4583124 Tsuji et al. Apr 1986 A
4608700 Kirtley, Jr. et al. Aug 1986 A
4630126 Kaku et al. Dec 1986 A
4646232 Chang et al. Feb 1987 A
4667192 Schmid et al. May 1987 A
4675865 DeVries et al. Jun 1987 A
4709343 Van Cang Nov 1987 A
4744079 Csapo et al. May 1988 A
4768145 Wheelwright et al. Aug 1988 A
4785463 Janc et al. Nov 1988 A
4811262 White Mar 1989 A
4811421 Havel et al. Mar 1989 A
4862402 Shah et al. Aug 1989 A
4901307 Gilhousen et al. Feb 1990 A
4914574 Terada et al. Apr 1990 A
5022049 Abrahamson et al. Jun 1991 A
5050004 Morton, Jr. Sep 1991 A
5056109 Gilhousen et al. Oct 1991 A
5081643 Schilling Jan 1992 A
5084900 Taylor Jan 1992 A
5093840 Schilling Mar 1992 A
5101416 Fenton et al. Mar 1992 A
5103459 Gilhousen et al. Apr 1992 A
5105423 Tanaka et al. Apr 1992 A
5109390 Gilhousen et al. Apr 1992 A
5113525 Andoh May 1992 A
5115429 Hluchyj et al. May 1992 A
5117385 Gee May 1992 A
5140613 Birgenheier et al. Aug 1992 A
5159283 Jensen Oct 1992 A
5159551 Brunnett et al. Oct 1992 A
5166951 Schilling Nov 1992 A
5166952 Omura et al. Nov 1992 A
5193094 Viterbi Mar 1993 A
5199061 Kim Mar 1993 A
5204876 Bruckert et al. Apr 1993 A
5224120 Schilling Jun 1993 A
5228054 Rueth et al. Jul 1993 A
5228056 Schilling Jul 1993 A
5235614 Bruckert et al. Aug 1993 A
5237586 Bottomley Aug 1993 A
5241690 Larsson et al. Aug 1993 A
5245629 Hall Sep 1993 A
5253268 Omura et al. Oct 1993 A
5253347 Bagnoli et al. Oct 1993 A
5257283 Gilhousen et al. Oct 1993 A
5258940 Coker et al. Nov 1993 A
5260967 Schilling Nov 1993 A
5262974 Hausman et al. Nov 1993 A
5265119 Gilhousen et al. Nov 1993 A
5267262 Wheatley, III Nov 1993 A
5274474 Medina Dec 1993 A
5276684 Pearson Jan 1994 A
5276907 Meidan Jan 1994 A
5283536 Wheatley, III et al. Feb 1994 A
5287299 Lin Feb 1994 A
5287463 Frame et al. Feb 1994 A
5293641 Kallin et al. Mar 1994 A
5295152 Gudmundson et al. Mar 1994 A
5297162 Lee et al. Mar 1994 A
5299226 Schilling Mar 1994 A
5299228 Hall Mar 1994 A
5305349 Dent Apr 1994 A
5309474 Gilhousen et al. May 1994 A
5311459 D'Luna et al. May 1994 A
5327455 DeGaudenzi et al. Jul 1994 A
5327467 DeGaudenzi et al. Jul 1994 A
5329547 Ling et al. Jul 1994 A
5339174 Harris Aug 1994 A
5341396 Higgins et al. Aug 1994 A
5341427 Hardy et al. Aug 1994 A
5343335 Hara Aug 1994 A
5345598 Dent Sep 1994 A
5347536 Meehan Sep 1994 A
5349606 Lovell et al. Sep 1994 A
5351134 Yaguchi et al. Sep 1994 A
5353302 Bi Oct 1994 A
5353352 Dent et al. Oct 1994 A
5355453 Row et al. Oct 1994 A
5361276 Subramanian Nov 1994 A
5363377 Sharpe Nov 1994 A
5365544 Schilling Nov 1994 A
5365585 Puhl et al. Nov 1994 A
5367533 Schilling Nov 1994 A
5373502 Turban Dec 1994 A
5377183 Dent Dec 1994 A
5379242 Rose et al. Jan 1995 A
5390207 Fenton et al. Feb 1995 A
5392287 Tiedemann, Jr. et al. Feb 1995 A
5396516 Padovani et al. Mar 1995 A
5396539 Slekys et al. Mar 1995 A
5398243 Aguilhon et al. Mar 1995 A
5404376 Dent Apr 1995 A
5406559 Edem et al. Apr 1995 A
5414728 Zehavi May 1995 A
5414729 Fenton May 1995 A
5414732 Kaufmann May 1995 A
5416797 Gilhousen et al. May 1995 A
5418624 Ahmed May 1995 A
5420850 Umeda et al. May 1995 A
5420864 Dahlin et al. May 1995 A
5420896 Schilling May 1995 A
5422908 Schilling Jun 1995 A
5430724 Fall et al. Jul 1995 A
5430760 Dent Jul 1995 A
5440597 Chung et al. Aug 1995 A
5442625 Gitlin et al. Aug 1995 A
5442662 Fukasawa et al. Aug 1995 A
5446683 Mullen et al. Aug 1995 A
5446756 Mallinckrodt Aug 1995 A
5448600 Lucas Sep 1995 A
5459759 Schilling Oct 1995 A
5483549 Weinberg et al. Jan 1996 A
5485486 Gilhousen et al. Jan 1996 A
5487089 Misaizu et al. Jan 1996 A
5487180 Ohtake Jan 1996 A
5488629 Takahashi et al. Jan 1996 A
5506864 Schilling Apr 1996 A
5509126 Oprescu et al. Apr 1996 A
5519736 Ishida May 1996 A
5528593 English et al. Jun 1996 A
5528624 Kaku et al. Jun 1996 A
5535278 Cahn et al. Jul 1996 A
5541606 Lennen Jul 1996 A
5544156 Teder et al. Aug 1996 A
5548613 Kaku et al. Aug 1996 A
5550811 Kaku et al. Aug 1996 A
5559790 Yano et al. Sep 1996 A
5561669 Lenney et al. Oct 1996 A
5563907 Lomp Oct 1996 A
5563912 Yasunaga Oct 1996 A
5566165 Sawahashi et al. Oct 1996 A
5566201 Ostman Oct 1996 A
5568483 Padovani et al. Oct 1996 A
5570349 Bustamante et al. Oct 1996 A
5574754 Kurihara et al. Nov 1996 A
5574983 Douzono et al. Nov 1996 A
5582851 Hofstetter et al. Dec 1996 A
5596570 Soliman Jan 1997 A
5604730 Tiedemann, Jr. Feb 1997 A
5610940 Durrant et al. Mar 1997 A
5614914 Bolgiano et al. Mar 1997 A
5619524 Ling et al. Apr 1997 A
5619526 Kim et al. Apr 1997 A
5621416 Lennen Apr 1997 A
5627835 Witter May 1997 A
5627855 Davidovici May 1997 A
5644590 Sugita Jul 1997 A
5652765 Adachi et al. Jul 1997 A
5654980 Latva-aho et al. Aug 1997 A
5657343 Schilling Aug 1997 A
5666654 Kanai Sep 1997 A
5673286 Lomp Sep 1997 A
5675581 Soliman Oct 1997 A
5691974 Zehavi et al. Nov 1997 A
5692008 Van Nee Nov 1997 A
5710768 Ziv et al. Jan 1998 A
5712869 Lee et al. Jan 1998 A
5715526 Weaver et al. Feb 1998 A
5734648 Adachi et al. Mar 1998 A
5745484 Scott Apr 1998 A
5748687 Ozluturk May 1998 A
5751739 Seshadri et al. May 1998 A
5751761 Gilhousen May 1998 A
5764687 Easton Jun 1998 A
5771451 Takai et al. Jun 1998 A
5790591 Gold et al. Aug 1998 A
5799010 Lomp et al. Aug 1998 A
5812593 Kaku Sep 1998 A
5828662 Jalali et al. Oct 1998 A
5841768 Ozluturk et al. Nov 1998 A
5856971 Gitlin et al. Jan 1999 A
5870427 Tiedemann et al. Feb 1999 A
5872810 Philips et al. Feb 1999 A
5875400 Madhavapeddy et al. Feb 1999 A
5878350 Nakamura et al. Mar 1999 A
5881368 Grob et al. Mar 1999 A
5884187 Ziv et al. Mar 1999 A
5884196 Lekven et al. Mar 1999 A
5933781 Willenegger et al. Aug 1999 A
5940382 Haim Aug 1999 A
5966403 Pon Oct 1999 A
6049535 Ozukturk et al. Apr 2000 A
6088324 Sato Jul 2000 A
6104748 Kaku Aug 2000 A
6212174 Lomp et al. Apr 2001 B1
6226316 Schilling et al. May 2001 B1
6269113 Park Jul 2001 B1
6272168 Lomp et al. Aug 2001 B1
6292519 Popovic Sep 2001 B1
6335924 Yano et al. Jan 2002 B1
6347083 Nishino Feb 2002 B1
6356555 Rakib et al. Mar 2002 B1
6381264 Lomp et al. Apr 2002 B1
6396867 Tiedemann et al. May 2002 B1
6397070 Black May 2002 B1
6434124 Rege Aug 2002 B1
6438119 Kim et al. Aug 2002 B1
6473447 Strich et al. Oct 2002 B1
6539008 Ahn et al. Mar 2003 B1
6587447 Wang et al. Jul 2003 B1
6590883 Kitade et al. Jul 2003 B1
6654613 Maeng et al. Nov 2003 B1
6721301 Ozluturk et al. Apr 2004 B2
6724740 Choi et al. Apr 2004 B1
6744809 Lomp et al. Jun 2004 B2
6865168 Sekine Mar 2005 B1
6907020 Periyalwar Jun 2005 B2
7039029 Lee et al. May 2006 B2
7050481 Hulbert May 2006 B1
7061888 Sakoda Jun 2006 B2
7079522 Kim et al. Jul 2006 B1
7339894 Corazza Mar 2008 B2
7403508 Miao Jul 2008 B1
20010038630 Tong et al. Nov 2001 A1
20020097697 Bae et al. Jul 2002 A1
20020131376 Wheatley et al. Sep 2002 A1
20020150065 Ponnekanti Oct 2002 A1
20030193915 Lee et al. Oct 2003 A1
20040179506 Padovani et al. Sep 2004 A1
20050002348 Holtzman et al. Jan 2005 A1
Foreign Referenced Citations (68)
Number Date Country
3743731 Jul 1989 DE
3743731 Jul 1989 DE
3743732 Jul 1989 DE
3743732 Jul 1989 DE
0022170 Jan 1981 EP
0372350 Jun 1990 EP
0462572 Dec 1991 EP
0464839 Jan 1992 EP
0464839 Jan 1992 EP
0476215 Mar 1992 EP
0505341 Sep 1992 EP
0505341 Sep 1992 EP
0525860 Feb 1993 EP
0526106 Feb 1993 EP
0526106 Feb 1993 EP
0565507 Oct 1993 EP
0615395 Mar 1994 EP
0631397 Dec 1994 EP
0637178 Feb 1995 EP
0637179 Feb 1995 EP
0654913 May 1995 EP
0654913 May 1995 EP
0682423 May 1995 EP
0656716 Jun 1995 EP
0656716 Jun 1995 EP
0668662 Aug 1995 EP
0668662 Aug 1995 EP
0744876 Nov 1996 EP
1933470 Jun 2008 EP
2280575 Feb 1995 GB
2301746 Dec 1996 GB
S62-256516 Nov 1987 JP
S63-198423 Aug 1988 JP
S63198423 Aug 1988 JP
H02-256331 Oct 1990 JP
H02-287874 Nov 1990 JP
H04-222111 Aug 1992 JP
H04-287593 Oct 1992 JP
H05-083381 Apr 1993 JP
H5083381 Apr 1993 JP
H05-129969 May 1993 JP
H05-144128 Jun 1993 JP
5-227124 Sep 1993 JP
H06-006374 Jan 1994 JP
H6006374 Jan 1994 JP
H06-104694 Apr 1994 JP
H06-104829 Apr 1994 JP
H06-120865 Apr 1994 JP
H6104829 Apr 1994 JP
06-268574 Sep 1994 JP
H07-058665 Mar 1995 JP
H7058665 Mar 1995 JP
H07-273600 Oct 1995 JP
H7-095151 Nov 1996 JP
9013942 Nov 1990 WO
9200639 Jan 1992 WO
9221196 Nov 1992 WO
9307702 Apr 1993 WO
9314588 Jul 1993 WO
9428640 Dec 1994 WO
9503652 Feb 1995 WO
9507578 Mar 1995 WO
9508876 Mar 1995 WO
9512257 May 1995 WO
9515038 Jun 1995 WO
9702665 Jan 1997 WO
9702675 Jan 1997 WO
9707600 Feb 1997 WO
Related Publications (1)
Number Date Country
20040165654 A1 Aug 2004 US
Provisional Applications (1)
Number Date Country
60000775 Jun 1995 US
Continuations (3)
Number Date Country
Parent 10071899 Feb 2002 US
Child 10788209 US
Parent 09261689 Mar 1999 US
Child 10071899 US
Parent 08669771 Jun 1996 US
Child 09261689 US