This invention relates to determination of strengths and arrival times of multipath signals associated with a direct signal.
When a transmitted signal is received by a receiver, one or more frames of the direct signal are often accompanied by multipath signals, at times following the direct signal arrival time, representing a version of the direct signal that has been altered by reflection from one or more signal-reflecting surfaces. The amplitude and phase associated with a multipath signal are arbitrary, relative to the amplitude and phase of the direct signal. At each signal sampling point, a multipath signal can combine additively or subtractively with the corresponding direct signal, and with any other signal being received at about the same time.
What is needed is an approach for quickly determining, as each frame is received, whether one or more multipath signals is present in the frame and for estimating a time delay associated with appearance of a multipath signal, if present. Preferably, the approach should allow use with arbitrary frame size and should provide a record, if desired, of one or more characteristics associated with a multipath signals that appears in a frame.
These needs are met by the invention, which provides a system and associated method for quantitatively estimating times of arrival of one or more multipath signals associated with a direct signal. The received signal frame includes a unique reference symbol (RS) sequence (which may be, but is not necessarily, a pseudo-noise or PN sequence). A multipath signal can arrive within an interrogation segment (IS) time interval, consisting of a first time interval of length L1, corresponding to the RS sequence plus a second augmenting time interval of length D that follows the RS sequence (both expressed in time units Δt(sym) of symbol length). Fourier transforms (FTs) of the IS for the received frame and of a corresponding RS sequence (with a corresponding index m1) are formed in digital format. The augmented portion of the IS for the reference sequence, of length D, is optionally filled with zeroes or with a replica of a portion of the original (non-augmented) RS sequence. A ratio of the FT of the received frame divided by the FT of the augmented RS sequence, computed over the IS, is formed, and an inverse Fourier transform σ(t;m1;1) of this ratio is computed.
An amplitude-dependent filter is applied to σ(t;m1;1) to remove substantially all background noise. The resulting channel signal includes the direct signal and may include one or more multipath signals present in the original signal frame. The channel signal is convolved with the original RS sequence to provide a function that allows an improved estimate D1 of the length D of the augmenting time interval and allows a reduction of estimated background noise level n1 associated with the inverse transform σ(t;m1;1).
The preceding process is then iterated. A Fourier transform of a modified IS signal and of the RS sequence, each of length L1+D1, are formed, and an inverse transform σ(t;m1;2) of the ratio of these transforms is computed. Amplitude-dependent filtering is applied to the function σ(t;m1;2) to produce another channel signal, which allows a further improved estimate D2 of the length of the augmenting time interval and a further reduction of estimated background noise level n2 associated with the inverse transform σ(t;m1;2). This process is further iterated until a selected convergence condition, such as |<nk-1>−<nk>|≦<ε(thr) or |<nk>|≦ε(thr), is satisfied, where ε(thr) is a selected small number.
This approach also allows estimates to be made of the strength and/or the time of arrival of one or more multipath signals within the received frame.
FIGS. 4A/4B and 6A/6B are flow charts of first and second procedures for practicing the invention.
When a frame is received by the computer, the computer identifies the RS segment of the frame (e.g., by a frame index value m1) and an index number (m1) of the corresponding RS sequence, provides or computes a Fourier transform Φ(f;ref/m1)=FT{RS(t;m1)} of the identified RS segment, and provides or computes a Fourier transform Φ(f;rec)=FT{s(t;rec)} of a received frame (where the computation interval IS has a length L1+D), using a fast Fourier transform or another suitable technique for computing or providing the transform. One can, for example, use D=L1 as an estimate so that the length of each IS is 2·L1 units. Optionally, the FTs, Φ(f;ref/m1) and Φ(f;rec), can be provided using a convenient computation length CL, where CL≧L1+D, where the residual of the IS, of length CL−L1−D, is stuffed with a sequence of known values, such as {0,0,0, . . . }, {0,1,0,1, . . . } or other selected binary sequence. For example, if 2q<L1+D≦2q+1, the length CL can be CL=2q+1. An example is L1=420, 92<D≦604 and CL=210=1024.
The computer divides the transform Φ(f;ref/m1) into the received frame transform Φ(f;rec) to form a ratio
ρ(f;m1)=Φ(f;rec)/Φ(f;ref/m1), (1)
which depends upon the frequency variable f, using any suitable technique for division of a first digital number by a second digital number. The system 21 then forms a (first) inverse Fourier transform
σ(t;m1;k=1)=FT−1{Φ(f;rec)/Φ(f;ref/m1)} (2)
and examines the time behavior of σ(t;m1;1). Where, as here, the FT in the denominator corresponds to the RS segment for the direct signal only (no multipath signal present) in the numerator, the magnitude |σ(t;m1;1)| will have a relatively large magnitude peak (≈σ(max)=A) at a value, t=t1, corresponding to arrival of the direct signal, and will decrease quickly to a small background value (having a mean value estimated as n1) as the time difference |t−t1| increases.
Where a direct signal plus a multipath signal occur in a received frame, the combined signal can be represented approximately as
s(t)=s(t;dir)+X·eiφ·s(t−Δt(mult);dir) (3)
where s(t;dir) is the direct signal, X·exp(iφ) is a complex number (0<X<1) representing the magnitude and phase angle of the multipath signal relative to the direct signal, and Δt(mult) is an estimated time delay for arrival of the multipath signal relative to the direct signal. A Fourier transform corresponding to this combination of direct signal and multipath signal may be represented approximately as
Φ(f;rec)=Φ(f;rec;dir){1+X·exp{−if·Δt(mult)+iφ}}, (4)
where Φ(f;rec;dir) represents the Fourier transform of the direct signal alone. The corresponding function σ(t;m1) for the additive combination of direct signal and multipath signal can be approximated as a sum of two functions,
σ(t;m1;1)≈σ(t;m1;1;dir)+σ(t;m1;1;multipath) (5)
corresponding to the direct signal and the multipath signal (with an associated attenuation factor X·exp(iφ)). A magnitude for this approximation |σ(t;m1;1)| for a combination of a direct signal and a multipath signal is illustrated in
FIGS. 4A/4B are a flow chart illustrating a procedure for practicing the invention. In step 41, an incoming frame, or resulting frame, s(t;k;rec) is received (with k=1), which may, or may not, contain one or more multipath signals. The frame, without any multipath signal present, would have the structure shown in
The function magnitude |σ(t;m1;k)| displayed in
The system moves to step 46 and estimates whether the reference frame appears to include at least one multipath signal. This estimation can be made, for example, by determining if at least two spaced apart peaks in the magnitude |σ(t;m1;k)| are present (e.g., in the graph in
If the answer to the query in step 46 is “yes, the system moves to step 48, determines the average background <nk>, and computes a background measure Bk, defined by
Bk=ak·|<nk>|+ . . . +a1·|<n1>|+a0·|<n0>|+bk-1·|<nk-1>−<nk>|+ . . . +b1·<n1>−<n2>|, (6)
where each of the selected coefficients ap and bp (p=1, . . . , k) is non-negative and satisfies
ak+ak-1+ . . . +a1+a0+bk-1+bk-2+ . . . +b1=1. (7)
In step 49, the system determines if the background level estimate Bk is no greater than a selected threshold value ε(thr). If the answer to the query in step 49 is “yes,” the system proceeds to step 53. If the answer to the query in step 49 is “no,” the system proceeds to step 50.
In step 50, the system passes the function σ(t;m1;k) through an amplitude-dependent filter that passes only signal amplitudes whose magnitude is larger than a selected threshold value σ(thr), in order to remove most or all of the background interference. For example, one may choose σ(thr)=r·|<nk>|, where r=2−10 is a selected number, not necessarily an integer. The result is a (filtered) channel function σ(t;m1;k;fil) that has no magnitudes below σ(thr). The filtered channel further σ(t;m1;k;fil) is to satisfy the following requirements:
In step 51, the system forms a convolution of the interrogation segment (IS) of the RS sequence with the channel function σ(t;m1;k;fil) to provide a convolved channel function,
Cσ(t;m1;k;fil)=σ(t;k;fil)*RS(t;m1), (9)
which may resemble the signal shown in
In
In step 52, the system increments k (k→k+1), returns to step 44 and repeats the steps 44–52, using a new estimate, Φ(f;k+1;rec)=FT{s(t;k+1;rec)} for the Fourier transform, where the modified received signal is defined as
and the computation interval is the IS, as before. From
In step 53, reached from step 49, the system (1) uses the present (final) characterization of the received signal (with final index value k=K1) to determine the presence of, and to characterize, each multipath signal whose presence is manifested in the illustration in
The magnitude |σ(t;m1;k)| illustrated in
As noted in the preceding, a pseudo-noise sequence or any other unique symbol sequence can be used for the RS sequence and for the corresponding RS sequence in the computations.
The procedure discussed in the preceding implicitly assumes that a multipath signal, if present in the received frame, arises from and is generated by information (RS and/or data) contained in the presently received frame. However, a multipath signal will also arrive (late) from the preceding received frame and “spill over” into the presently received frame over an interval tdir<t<t′″m,k. In this situation, this spillover multipath signal will include, not a multipath signal including the RS sequence from the preceding frame, but a multipath signal including a final portion of the data from the preceding frame. The final portion of data from the preceding frame, processed by the procedure indicated in FIGS. 4A/4B and indicated as s(t;K1′;prec), is assumed to be known reasonably accurately, either through application of the procedure set forth in FIGS. 4A/4B, or through another approach.
FIGS. 6A/6B illustrate an augmented procedure that can be followed to refine the analysis to examine the effects of a spillover multipath signal from a preceding frame. In step 61, an incoming frame, or resulting frame, s(t;k;rec) is received (with k=1), which may, or may not, contain one or more multipath signals. As in FIGS. 4A/4B, the frame, without any multipath signal present, would have the structure shown in
In FIGS. 6A/6B as in FIGS. 4A/4B, the function magnitude |σ(t;m1;k)| displayed in
The system moves to step 66 and estimates whether the reference frame appears to include at least one multipath signal. This estimation can be made, for example, by determining if at least two spaced apart peaks in the magnitude |σ(t;m1;k)| are present (e.g., in the graph in
If the answer to the query in step 66 is “yes,” the system moves to step 68, determines the average background <nk>, and computes a background measure Bk, defined in Eqs. (6) and (7). In step 69, the system determines if the background level estimate Bk is no greater than a selected threshold value ε(thr). If the answer to the query in step 69 is “yes,” the system proceeds to step 76. If the answer to the query in step 69 is “no,” the system proceeds to step 70.
In step 70, the system passes the function σ(t;m1;k) through an amplitude-dependent filter that passes only signal amplitudes whose magnitude is larger than a selected threshold value σ(thr), in order to remove most or all of the background interference. For example, one may choose σ(thr)=r·|<nk>|, where r=2–10 is a selected number, not necessarily an integer. The result is a (filtered) channel function σ(t;m1;k;fil) that has no magnitudes below σ(thr). Again, the filtered channel function σ(t;m1;k;fil) is to satisfy the requirements of Eqs. (8A) and (8B).
In step 71, the system forms a convolution of the interrogation segment (IS) of the RS sequence with the channel function σ(t;m1;k;fil) to provide a convolved channel function, Cσ(t;m1;fil) according to Eq. (9). In step 72, a first-modified received signal
is computed, and a final processed signal s(t;K1′;prec) from the preceding frame is provided, with final index value k=K1′. In step 73, a convolved filtered ov channel function
Cσ(t;k;ov;fil)=s(t;K1′;prec)*σ(t;m1;k;fil) (12)
is computed, using the filtered channel function σ(t;m1;k;fil) already computed (in step 70) and using an initial time interval of length D in the present frame for the computation. Where an overlap multipath signal is present in the present in the presently received frame, the magnitude |Cσ(t;k;j;ov;fil)| of the convolution function will resemble the function illustrated in
In step 74, a second-modified received signal
is computed and used as a new (processed) received function, denoted s(t;k+1;rec). In step 75, the index k is incremented (k→k+1), and the system returns to step 64,
The lower curve in
In step 76, which is reached from step 69, the system uses the present (final) characterization of the received signal s(t;K1;rec) (with final index value k=K1) to determine the presence of, and to characterize, each multipath signal whose presence is manifested in the illustration in
Number | Name | Date | Kind |
---|---|---|---|
6563885 | Magee et al. | May 2003 | B1 |
6801580 | Kadous | Oct 2004 | B2 |
7023931 | Magee et al. | Apr 2006 | B2 |
20020042661 | Kim | Apr 2002 | A1 |