The present invention generally pertains to determining the angle of arrival (AOA) of a target signal received by an array of antenna elements.
Arrays of antenna elements are commonly used in a system for estimating the AOA of a received target signal. For tactical signal-intercept applications it is desirable for the signal-intercept hardware to be of minimal size, weight, and power (SWAP). To realize minimal SWAP it is desirable to use a single receiver and to commutate the antenna elements of the array.
The present invention provides a method of estimating the angle of arrival of a target signal received by an array of antenna elements, comprising the steps of:
(a) with a pair of receivers, simultaneously obtaining samples of a received target signal from multiple elements of an array of antenna elements; and
(b) with a computer, processing the simultaneously obtained samples of the target signal to determine a maximum likelihood estimation (MLE) of the angle of arrival φ of the target signal by using the following equation:
φMLE=argmaxφRe(α*β)
wherein α is a complex vector that represents a phase difference associated with the angle of arrival that should be observed upon receipt of the signal by two particular antenna elements from which the samples are obtained; and
β represents the phase difference that is observed upon receipt of the signal by the two particular antenna elements from which the samples are obtained;
wherein when the target signal is unknown, βn=y*2n−1y2n in the time domain and βn=Y*2n−1Y2n in the frequency domain,
wherein y2n−1 and y2n are complex N-tuple vectors representing the samples obtained from the nth simultaneously sampled pair of antenna elements and Y is a Fourier transform of y.
The present invention also provides a method of estimating the angle of arrival of a target signal received by an array of antenna elements, comprising the steps of:
(a) with a pair of receivers, simultaneously obtaining samples of a received target signal from multiple elements of an array of antenna elements; and
(b) with a computer, processing the simultaneously obtained samples of the target signal to determine a maximum likelihood estimation (MLE) of the angle of arrival φ of the target signal by using the following equation:
φMLE=argmaxφRe(α*β)
wherein α is a complex vector that represents a phase difference associated with the angle of arrival that should be observed upon receipt of the signal by two particular antenna elements from which the samples are obtained; and
β represents the phase difference that is observed upon receipt of the signal by the two particular antenna elements from which the samples are obtained;
wherein when the target signal is known,
in the time domain and
in the frequency domain,
wherein X and Y are Fourier transforms of x and y respectively,
wherein xn and Xn are complex N-tuple vectors representing the known target signal in the time domain and in the frequency domain respectively; and
wherein y2n−1 and y2n are complex N-tuple vectors representing the samples obtained from the nth simultaneously sampled pair of antenna elements and Y is a Fourier transform of y.
The present invention further provides a method of estimating the bandwidth of a target signal received by an array of antenna elements, comprising the steps of:
(a) with a pair of receivers, simultaneously obtaining samples of a received target signal from multiple elements of an array of antenna elements; and
(b) with a computer, processing the simultaneously obtained samples of the target signal to estimate the bandwidth of the received target signal by using binary hypotheses and a generalized log likelihood ratio test (GLLRT).
The present invention still further provides a method of estimating the bandwidth of a target signal received by an array of antenna elements, comprising the steps of:
(a) with a pair of receivers, simultaneously obtaining samples of a received target signal from multiple elements of an array of antenna elements; and
(b) with a computer, processing the simultaneously obtained samples of the target signal to estimate the bandwidth of the received target signal by using multiple hypotheses and pair wise generalized log likelihood ratio tests in accordance with:
wherein M specifies a bandwidth constraint expressed by a set of tuples of X(φ) where
X(φ) may be non-zero,
X(φ) is an estimate of the Fourier transform of the unknown target signal,
Y is a Fourier transform of the sample obtained from the sampled antenna element, and
The present invention additionally provides systems for performing the above-described methods and computer readable storage media including computer executable program instructions for causing one or more computers to perform and/or enable the steps of the respective above-described methods.
Additional features of the present invention are described with reference to the detailed description.
Referring to
Samples 16 of a received target signal are simultaneously obtained by the pair of receivers 12 from multiple elements of an array of antenna elements 10 (as shown at 20 in
φMLE=argmaxφRe(α*β) [Eq. 1]
α is a complex vector that represents a phase difference associated with the angle of arrival that should be observed upon receipt of the signal by two particular antenna elements from which the samples are obtained; and β represents the phase difference that is observed upon receipt of the signal by the two particular antenna elements from which the samples are obtained. The symbol * is a Hermitian operator.
When the target signal is unknown, in the time domain,
βn=y*2n−1y2n [Eq. 2]
and in the frequency domain,
βn=Y*2n−1Y2n [Eq. 3]
y2n−1 and y2n are complex N-tuple vectors representing the samples obtained from the nth simultaneously sampled pair of antenna elements and Y is a Fourier transform of y. In a preferred embodiment,
When the target signal is known, in the time domain,
and in the frequency domain,
X and Y are Fourier transforms of x and y respectively, and xn and Xn are complex N-tuple vectors representing the known target signal in the time domain and in the frequency domain respectively. y2n−1 and y2n are complex N-tuple vectors representing the samples obtained from the nth simultaneously sampled pair of antenna elements.
For a phased array of antenna elements, whether or not the target signal is known,
αn=ei(μ
μ is a function of the angle of arrival that depends upon the geometry of the array of antenna elements.
Referring to
In one embodiment, the computer 14 is adapted for estimating the bandwidth of the received target signal by using binary hypotheses and a generalized log likelihood ratio test (GLLRT):
λ(M1, M2) is an appropriately chosen constant threshold. M specifies a bandwidth constraint expressed by a set of tuples of X(φ) where X(φ) may be non-zero. X(φ) is an estimate of the Fourier transform of the unknown target signal. Y is a Fourier transform of the sample obtained from the sampled antenna element.
In another embodiment, the computer 14 is adapted for estimating the bandwidth of the received target signal by using multiple hypotheses and pair wise generalized log likelihood ratio tests in accordance with:
M specifies a bandwidth constraint expressed by a set of tuples of X(φ) where X(φ) may be non-zero. X(φ) is an estimate of the Fourier transform of the unknown target signal. Y is a Fourier transform of the sample obtained from the sampled antenna element.
The computer 14 is further adapted for deriving the value of βn=Y*2n−1Y2n in the frequency domain or the value of βn=<Y2n−1, Y2n>M in the frequency domain or the value of βn=<y2n−1, y2n>M in the time domain by using the respective value M that is associated with the estimated bandwidth pursuant to the applicable GLLRT or GLLRTs.
Referring to
A discussion of the applicability of various equations to different embodiments of the present invention follows.
Single Pair of Antenna Elements and an Unknown Target Signal
Consider first the estimation of an MLE for the AOA with two receivers when the target signal is unknown. Suppose two antenna elements are sampled simultaneously, and N samples are observed on each element. Let the complex N-tuple vectors y1 and y2 denote the samples observed on the first element and second element, respectively. Then,
The vector x denotes the unknown target signal. eiμ
For AWGN the MLE for φ is given by,
where x(φ) is the least-squares optimal estimate of x and is dependent on φ.
Equation 11 is a time-domain problem. Alternatively, this may be reformulated in the frequency domain, as follows. Let WN denote the linear transformation associated with an N-point DFT, and let
Note that W2N≠W2N. First, W2N is unitary (W2N*W2N=I), as WN is unitary. Hence, multiplication by W2N does not change the length of a vector, and Equation 12 may be rewritten as,
Secondly,
where Yk is the N-point DFT of yk (i.e. U denotes the Fourier transform of u). Therefore, Equation 13 may be rewritten as,
Note that
Equation 15 is a least-squares problem. Let,
Then Equation 17 may be rewritten as,
φMLE=argminφ∥Y−A(φ)X(φ)∥2 [Eq. 18]
It is a standard result from linear algebra that X(φ) is given by,
A(φ)*A(φ)X(φ)=A(φ)*Y [Eq. 19]
Since A(φ) is orthogonal,
X(φ)=cA(φ)*Y [Eq. 20]
for some real constant c.
As the optimal error vector is orthogonal to the column space of A(φ),
∥Y−A(φ)X(φ)∥2=∥Y∥2−Y*A(φ)X(φ) [Eq. 21]
and Equation 18 may be rewritten as,
φMLE=argmaxφY*A(φ)X(φ) [Eq. 22]
or
φMLE=argmaxφ∥A(φ)*Y∥2 [Eq. 23]
In Equation 23,
and
|e−iμ
|Y1,k|2+2Re{(e−iμ
Therefore, Equation 23 may be rewritten as,
It follows that Y*1Y2 is a sufficient statistic for computing φMLE. (The vectors Y1 and Y2 may be reduced to the complex scalar Y*1Y2 without any loss of performance.
Note that
There is a clear duality between the time and frequency domain formulations. Equation 15 is a frequency-domain formulation of this problem, and Equation 26 yields the associated solution for φMLE. The time-domain formulation in Equation 11 is structurally identical to Equation 15, so it follows immediately that there is also a time-domain solution given by,
φMLE=argmaxφRe{ei(μ
The frequency-domain approach has the immediate advantage that many signals are localized in frequency and noise may be easily eliminated. Of course, one may use a Fourier transform and inverse Fourier transform to eliminate noise in the frequency domain, but solve the problem in the time domain using Equation 28. The latter approach has the disadvantage of require two transforms, so the frequency-domain approach is preferable.
In comparison with algorithms for the single receiver problem, the two receiver algorithm is considerably simpler. In the unknown target signal scenario, this simplicity results from the fact that the inner-product in the sufficient statistic cancels the angular component of the unknown signal.
Single Pair of Antenna Elements and Known Target Signal
Consider the construction of an MLE for the AOA with two receivers where the target signal is known.
This equation is entirely similar to Equation 10. The only difference is the introduction of complex scalar z. This permits uncertainty of the amplitude and phase of x which is otherwise known, and is a more practical model. Note that
is a vector.
In the same manner as the previous development of Equation 15,
and in the same manner as the previous development of Equation 23,
φMLE=argmaxφ∥a(φ)*Y∥2 [Eq. 31]
with
In Equation 31,
∥a(φ)*Y∥2=|e−iμ
and,
|e−iμ
|X*Y1|2+2Re{(e−iμ
Therefore, Equation 31 may be rewritten as,
φMLE=argmaxφRe{ei(μ
X*Y1 and X*Y2 are sufficient statistics for computing φMLE.
As before, a time-domain formulation is analogous,
φMLE=argmaxφRe{ei(μ
x*y1 and x*y2 are sufficient statistics for computing φMLE.
In general, in the argument of the argmax function in Equation 31 the expression ∥a(φ)∥2 would appear as a divisor. Here, this expression does not depend on φ and is ignored. This expression does however depend on X. With only a single element pair, this again may be ignored. With multiple element pairs as discussed subsequently, this must be considered. This is the reason for the subsequent divisions by |x|2 or |X|2.
Multiple Pairs of Antenna Elements
For an unknown target signal, the extension to multiple pairs of elements may be constructed as follows. Refer to Equation 10. With two pairs of elements this may be written as,
where
Equation 37 may be written more compactly as,
y=A(φ)x+v [Eq. 38]
Then,
φMLE=argmaxφ∥A(φ)*y∥2 [Eq. 39]
as A(φ) is orthogonal.
φMLE=argmaxφ{∥A12(φ)*y12∥2+∥A34(φ)*y34∥2} [Eq. 40]
where
and
From previous arguments,
φMLE=argmaxφRe{ei(μ
With an arbitrary number of pairs of elements,
As before, there is duality between a time and frequency-domain formulation. Let αn=ei(μ
φMLE=argmaxφRe(α*β) [Eq. 43]
Where in the time domain,
βn=y*2n−1y2n [Eq. 2]
and in the frequency domain
βn=Y*2n−1Y2n. [Eq. 3]
Consider now a known target signal with multiple pairs of elements. Equation 43 with the associated definitions of α and β is easily identified as a generalization of Equations 26 and 28. Similarly, Equations 35 and 36 may also be generalized to Equation 43, where in the time domain
and in the frequency domain
The subscript n on x and X denotes the known target signal when the nth pair is sampled. The appearance of |xn|2 and |Xn|2 in the denominator is for the reasons discussed previously.
Estimation of Unknown Target Signal Bandwidth
Consider now the estimation of the bandwidth of an unknown target signal. The estimation process described herein may be used to determine the boundaries of contiguous spectra, and as such, may also be regarded as a signal detection method. Previously it was demonstrated that, for an unknown target signal,
φMLE=argmaxφRe<α,β> [Eq. 44]
where <α,β> denotes the inner-product of α and β. (<α,β>=α*β.) With a frequency-domain formulation βn=<Y2n−1, Y2n>. In general, a target signal may occupy a bandwidth less than that corresponding to the sampling rate, and some points of the Fourier transforms Y2n−1 and Y2n may depend only on noise. Intuitively, it may seem that the inner-product for βn should only be computed only over points where the target signal may be non-zero. Essentially this turns out to be correct, but it is also necessary to develop a method for estimation of the bandwidth.
Recall,
∥Y−A(φ)X(φ)∥2=∥Y∥2−Y*A(φ)X(φ) [Eq. 21]
One seeks to approximate Y by a judicious choice of A(φ)X(φ) and thereby determine φMLE. X(φ) is a estimate of the Fourier transform of the unknown target signal. The LHS of Equation 21 is non-negative. Thus, Y*A(φ)X(φ)≦∥Y∥2. φMLE may be determined by maximizing Y*A(φ)X(φ).
Recall,
This expression is a function of φ. Assuming that ei(μ
Consider now the introduction of a bandwidth constraint. Let M denote a set of tuples of X(φ) where X(φ) may be non-zero. It is not necessarily the case that X(φ) is non-zero for these tuples, but it is assumed that X(φ) is certainly zero for tuples that are not in the set M. More precisely, in m∉MXm(φ)=0. Thus M specifies a bandwidth constraint.
Let {tilde over (X)}(φ) denote the vector X(φ) with the zero tuples deleted. Thus, {tilde over (X)}(φ) is a |M|-tuple vector. The expression A(φ)X(φ) is a linear combination of the columns of A(φ), and each column is weighted by a tuple of X(φ). Similarly, let Ã(φ) denote the matrix A(φ) with the columns that are weighted by zero tuples of X(φ) deleted. In Equations 21, 45 and 46, X(φ) and A(φ) may then be replaced with {tilde over (X)}(φ) and Ã(φ) without consequence, with one exception. The inner-products appearing in Equations 45 and 46 must be computed only over tuples where X(φ) may be non-zero. Using Equation 45 Equation 21 may be rewritten as,
The inner-product subscript M denotes a computation over only the non-zero tuples specified by M, and no subscript indicates the ordinary computation over all tuples. Let,
E(M)=Y−Ã(φMLE){tilde over (X)}(φMLE) [Eq. 48]
E(M) is the error between Y and the optimal estimate Ã(φMLE){tilde over (X)}(φMLE). M denotes the dependence of the error on the bandwidth constraint. From Equation 47
The bandwidth may be estimated by using multiple hypotheses and generalized log likelihood ratio tests (GLLRT). See A. D. Whalen, “Detection of Signals in Noise”, Academic Press, Second Edition, 1995. Suppose that one is deciding between bandwidth hypothesis M1 and M2. The resulting GLLRT is given by,
Where λ(M1, M2) is an appropriately chosen constant threshold. For example, an appropriate rule in the context of DF is to determine λ(M1, M2) by,
λ(M2, M2)=argmin V ar{φMLE} [Eq. 49]
Equation 49 is easily solved by simulation. Observe that Equation 49 is a Bayesian criterion, as the cost of error, as measured by the variance of φMLE, may differ between M1 and M2. The extension to more than a binary hypothesis may be accomplished by performing pair wise tests. In other words,
The benefits specifically stated herein do not necessarily apply to every conceivable embodiment of the present invention. Further, such stated benefits of the present invention are only examples and should not be construed as the only benefits of the present invention.
While the above description contains many specificities, these specificities are not to be construed as limitations on the scope of the present invention, but rather as examples of the preferred embodiments described herein. Other variations are possible and the scope of the present invention should be determined not by the embodiments described herein but rather by the claims and their legal equivalents.
Regarding the method claims, except for those steps that can only occur in the sequence in which they are recited, and except for those steps for which the occurrence of a given sequence is specifically recited or must be inferred, the steps of the method claims do not have to occur in the sequence in which they are recited.
Number | Name | Date | Kind |
---|---|---|---|
6160758 | Spiesberger | Dec 2000 | A |
6898235 | Carlin et al. | May 2005 | B1 |