Disclosure of Invention
In view of the above problems in the prior art, an object of the present invention is to provide a method for estimating a direction of arrival based on a known delay, which greatly simplifies the estimation of the number of signals, and the obtained estimation of the direction of arrival of the signals is less affected by noise and the fluctuation of the estimated value is also less.
In order to achieve the purpose, the invention adopts the technical scheme that: a method for estimating a direction of arrival based on known time delays, the method comprising the steps of:
(1) judging whether the array elements of the antenna are linearly placed at equal intervals or placed on the circular ring at equal intervals, if so, continuing to operate in the step (3), and otherwise, continuing to operate;
(2) for antennas with each array element placed equidistantly on the circumference, the baseband signal received by each array element is expressed by the following formula y (n) Ty0(n) transforming to obtain an equivalent signal column vector y (n);
wherein: y is0(n) is a column vector of the baseband signal received by the antenna,
<math> <mrow> <mi>T</mi> <mo>=</mo> <mi>diag</mi> <mo>{</mo> <msup> <mi>j</mi> <mrow> <mo>-</mo> <mi>M</mi> </mrow> </msup> <msubsup> <mi>J</mi> <mi>M</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msup> <mi>j</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <msubsup> <mi>J</mi> <mn>1</mn> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>,</mo> <msubsup> <mi>J</mi> <mn>0</mn> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>,</mo> <msup> <mi>j</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <msubsup> <mi>J</mi> <mn>1</mn> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msup> <mi>j</mi> <mrow> <mo>-</mo> <mi>M</mi> </mrow> </msup> <msubsup> <mi>J</mi> <mi>M</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>}</mo> <msup> <mi>V</mi> <mi>H</mi> </msup> <mo>;</mo> </mrow> </math>
(3) despreading a received signal vector of a linear antenna or a transformed equivalent signal column vector y (n) of a loop antenna by using known time delay information to obtain a despread signal column vector x (n);
(4) construction of a reduced-dimension signal vector z using a despread signal column vector x (n)i(n),i=1,…,P-1 according to
The following formula: <math> <mrow> <msub> <mi>R</mi> <mi>ss</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mn>1</mn> <mrow> <mi>P</mi> <mo>-</mo> <mn>1</mn> </mrow> </mfrac> <munderover> <mi>Σ</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mrow> <mi>P</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msub> <mi>z</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <msub> <mi>z</mi> <mi>i</mi> </msub> <msup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>H</mi> </msup> </mrow> </math> and r (n) ═ λfR(n-1)+Rss(n) calculating to obtain instantaneous correlation matrix Rss(n) and estimation of a correlation matrix r (n);
(5) the instantaneous correlation matrix R obtained according to the step (4)ss(n) and the correlation matrix r (n) to obtain a desired vector w (n) ═ w1 w2]T(ii) an estimate of (d);
(6) utilizing two weighted weights w contained in the vector obtained in the step (5)1And w2And obtaining the estimation of the direction of arrival of the required signal.
According to the instantaneous correlation matrix Rss(n) and the correlation matrix r (n) to obtain a desired vector w (n) ═ w1 w2]TThe estimate of (c) can be obtained as follows:
setting the initial conditions as follows: w (0) ═ 10]TThe residual vector g (0) [ -10 ]]TThe gradient vector p (1) is g (0), n is 1, and the update step is calculated sequentially:
<math> <mrow> <mi>α</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>=</mo> <mi>η</mi> <mfrac> <mrow> <mi>p</mi> <msup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>T</mi> </msup> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> <mrow> <mi>p</mi> <msup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>T</mi> </msup> <mi>R</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>p</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow> </math> wherein: (lambdaf-0.5)≤η≤λfThe required vector update is calculated as:
w(n)=w(n-1)+α(n)p(n)
the residual vector update formula is:
g(n)=λfg(n-1)-α(n)R(n)p(n)-Rss(n)w(n-1)
the gradient adjustment step size is calculated as follows:
<math> <mrow> <mi>β</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msup> <mrow> <mo>(</mo> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>-</mo> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mi>T</mi> </msup> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msup> <mrow> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> <mi>T</mi> </msup> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow> </math>
gradient vector update calculation:
p(n)=g(n)+β(n)p(n)
through each iterative calculation, the required vector w (n) ═ w can be obtained1 w2]T。
According to the instantaneous correlation matrix Rss(n) and the correlation matrix r (n) to obtain a desired vector w (n) ═ w1 w2]TThe estimate of (c) can also be obtained as follows:
the correlation matrix r (n) is subjected to a singular value decomposition as follows:
R(n)=U(n)∑(n)U(n)H=[u(n)w(n)]diag{λ1,λ2}[u(n)w(n)]H λ1>λ2not less than 0, the required vector w (n) ═ w can be obtained1 w2]T。
The above uses two weighted weights w1And w2The estimation of the direction of arrival of the desired signal can be obtained as follows: for antennas with each array element placed equidistantly on the circumference, the signal direction angle phi is equal to angle (w)2)-angle(w1) (ii) a For the antennas with linearly and equidistantly arranged array elements, the arrival direction angle of the signals is as follows: <math> <mrow> <mi>θ</mi> <mo>=</mo> <msup> <mi>sin</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mrow> <mo>(</mo> <mfrac> <mi>λφ</mi> <mrow> <mn>2</mn> <mi>πd</mi> </mrow> </mfrac> <mo>)</mo> </mrow> </mrow> </math>
according to the technical scheme adopted by the invention, the problem of signal number estimation is simplified by utilizing the known time delay information, so that the method is easy to realize in practice; the invention can use a plurality of baseband signals received by continuous antennas to carry out statistical signal processing, thereby avoiding the defect that the common FFT method is easily affected by noise, greatly reducing the fluctuation of the estimated result and improving the accuracy, thereby improving the performance of wireless communication receiving.
Detailed description of the invention
Generally, in an actual wireless communication system, the change of the direction of arrival of a signal is relatively slow, and the conventional FFT method does not improve the estimation result using the slowly changing information, and therefore, there is inevitably room for improvement in the performance of the signal processing method.
The method of the invention is aimed at processing the baseband signals received by each antenna element and obtained after demodulation. Let the symbol y (n) denote the resulting baseband signal column vector, the number of vector elements is P, i.e. the number of actual antenna elements, and the column vector denotes that n in the symbol corresponds to a sampling time, i.e. the vector is a vector of baseband signal samples obtained at the nth sampling time on each array element.
The method of the present invention also uses different treatments for different antenna shapes. For antennas with linearly equidistant placement of the elements, the method of the invention can be applied directly. For the antenna with each array element placed equidistantly on the ring, the following processing needs to be performed on the signal in advance:
assuming that the actual number of antenna elements is N, the radius of a circular ring is r, the carrier wavelength is lambda, the arrival signal pitch angle theta is epsilon [0, pi/2 ], and let M be 2 pi r/lambda and zeta be Msin theta
<math> <mrow> <mi>T</mi> <mo>=</mo> <mi>diag</mi> <mo>{</mo> <msup> <mi>j</mi> <mrow> <mo>-</mo> <mi>M</mi> </mrow> </msup> <msubsup> <mi>J</mi> <mi>M</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msup> <mi>j</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <msubsup> <mi>J</mi> <mn>1</mn> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>,</mo> <msubsup> <mi>J</mi> <mn>0</mn> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>,</mo> <msup> <mi>j</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <msubsup> <mi>J</mi> <mn>1</mn> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msup> <mi>j</mi> <mrow> <mo>-</mo> <mi>M</mi> </mrow> </msup> <msubsup> <mi>J</mi> <mi>M</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>}</mo> <msup> <mi>V</mi> <mi>H</mi> </msup> <mo>;</mo> </mrow> </math>
Wherein, Jm(ζ) is a first type of Bessel function with order m, and diag { a, b } represents a diagonal matrix with major diagonal elements a, b, respectively. Column vector y of baseband signal received by antenna0(N) (the vector dimension is Nx 1) is transformed as follows
y(n)=Ty0And (n) the number of elements of the equivalent signal column vector y (n) after conversion is 2M + 1. The above-mentioned transformations are transformations of the signals received on the different elements. And directly despreading a received signal vector of a linear antenna or a transformed equivalent signal column vector y (n) of a loop antenna by using known time delay information. The despread signal column vector is denoted x (n).
Let x (n) be [ < x >1(n)x2(n)…xp(n)]TFrom which new reduced-dimension signal vectors are constructed, such that
z1(n)=[x1(n),x2(n)]T
z2(n)=[x2(n),x3(n)]T
*
zP-1(n)=[xP-1(n),xP(n)]T
The calculation was performed according to the following two equations:
<math> <mrow> <msub> <mi>R</mi> <mi>ss</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mn>1</mn> <mrow> <mi>P</mi> <mo>-</mo> <mn>1</mn> </mrow> </mfrac> <munderover> <mi>Σ</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mrow> <mi>P</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msub> <mi>z</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <msub> <mi>z</mi> <mi>i</mi> </msub> <msup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>H</mi> </msup> </mrow> </math>
R(n)=λfR(n-1)+Rss(n)
wherein the forgetting factor lambdafSatisfies 0 < lambdafLess than or equal to 1. After obtaining the correlation matrix R (n) and the instantaneous correlation matrix RssAfter the result of the calculation formula (n), the required vector w (n) can be calculated by two methods:
the first method is a conjugate gradient-based method, and specifically comprises the following steps:
setting the initial conditions as follows: w (0) ═ 10]TThe residual vector g (0) [ -10 ]]TThe gradient vector p (1) is g (0), n is 1, and the update step is calculated sequentially:
<math> <mrow> <mi>α</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>=</mo> <mi>η</mi> <mfrac> <mrow> <msup> <mrow> <mi>p</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> <mi>T</mi> </msup> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> <mrow> <mi>p</mi> <msup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>T</mi> </msup> <mi>R</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>p</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo></mo> </mrow> </mfrac> <mo>,</mo> </mrow> </math> wherein: (lambdaf-0.5)≤η≤λf,
The required vector update is calculated as:
w(n)=w(n-1)+α(n)p(n)
the residual vector update formula is:
g(n)=λfg(n-1)-α(n)R(n)p(n)-Rss(n)w(n-1)
the gradient adjustment step size is calculated as follows:
<math> <mrow> <mi>β</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msup> <mrow> <mo>(</mo> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>-</mo> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mi>T</mi> </msup> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msup> <mrow> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> <mi>T</mi> </msup> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow> </math>
gradient vector update calculation:
p(n)=g(n)+β(n)p(n)
through each iterative calculation, the required vector w (n) ═ w can be obtained1 w2]T。
The second method is a method based on singular value decomposition. The decomposition computation is not very computationally intensive due to the small dimension of the matrix. In view of the signal characteristics here, it can be assumed that the singular value decomposition of the correlation matrix r (n) is as follows:
R(n)=U(n)∑(n)U(n)H=[u(n) w(n)]diag{λ1,λ2}[u(n)w(n)]Hλ1>λ2not less than 0, then w (n) ═ w1 w2]TIs the vector we need.
And finally, obtaining the estimation of the signal direction of arrival through the obtained vector. The data required in this case are two weighted weights w contained in a vector w (n)1And w2. Calculating the difference between the phase angles of two weighted weights of two elements of vector w (n), and making phi equal to angle (w)2)-angle(w1) For antennas with array elements equidistantly placed on the circumference, the angle (in radians) is the azimuth angle of the signal arrival direction to be estimated; for the antennas with linearly and equidistantly arranged array elements, the estimation of the direction angle of arrival of the signal to be estimated can be calculated by the following formula:
<math> <mrow> <mi>θ</mi> <mo>=</mo> <msup> <mi>sin</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mrow> <mo>(</mo> <mfrac> <mi>λφ</mi> <mrow> <mn>2</mn> <mi>πd</mi> </mrow> </mfrac> <mo>)</mo> </mrow> </mrow> </math>
λ is also the carrier wavelength, d is the distance between adjacent array elements, sin-1(. cndot.) represents an arcsine function.
The invention is further described below in terms of its application to a TD-SCDMA (time division synchronous code division multiple access) system.
In the TD-SCDMA system, the signal used for estimating the direction of arrival is a despread intermediate pilot (midamble) code signal, or a channel estimation signal obtained through joint detection. The system antenna is assumed to be an antenna with each array element equidistantly arranged on the circumference, and the signal obtained by the antenna is hk,l (j)(n), where J1, …, J represents different array elements, K1, …, K represents different users, L1, …, LkRepresenting signals of different paths. The specific implementation of the present invention is described with reference to fig. 1. In step 1, judging whether the array elements of the antenna are linearly placed at equal intervals or are placed on the circular ring at equal intervals, and continuing the following operations because the array elements of the antenna are not linearly placed at equal intervals; in step 2, the baseband signal received by each array element is expressed by the following formula y (n) ═ Ty0(n) transforming to obtain an equivalent signal column vector y (n);
wherein: y is0(n) is a column vector of the baseband signal received by the antenna,
<math> <mrow> <mi>T</mi> <mo>=</mo> <mi>diag</mi> <mo>{</mo> <msup> <mi>j</mi> <mrow> <mo>-</mo> <mi>M</mi> </mrow> </msup> <msubsup> <mi>J</mi> <mi>M</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msup> <mi>j</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <msubsup> <mi>J</mi> <mn>1</mn> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>,</mo> <msubsup> <mi>J</mi> <mn>0</mn> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>,</mo> <msup> <mi>j</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <msubsup> <mi>J</mi> <mn>1</mn> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msup> <mi>j</mi> <mrow> <mo>-</mo> <mi>M</mi> </mrow> </msup> <msubsup> <mi>J</mi> <mi>M</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>ξ</mi> <mo>)</mo> </mrow> <mo>}</mo> <msup> <mi>V</mi> <mi>H</mi> </msup> <mo>;</mo> </mrow> </math>
in step 3, the converted equivalent signal column vector y (n) is despread by using the known time delay information, and a despread signal column vector x (n) is obtained; in step 4, a reduced-dimension signal vector z is constructed by using the despread signal column vector x (n)i(n), i ═ 1, …, P-1, according to the following formula: <math> <mrow> <msub> <mi>R</mi> <mi>ss</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mn>1</mn> <mrow> <mi>P</mi> <mo>-</mo> <mn>1</mn> </mrow> </mfrac> <munderover> <mi>Σ</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mrow> <mi>P</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msub> <mi>z</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <msub> <mi>z</mi> <mi>i</mi> </msub> <msup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>H</mi> </msup> </mrow> </math> and r (n) ═ λfR(n-1)+Rss(n) calculating to obtain instantaneous correlation matrix Rss(n) and estimation of a correlation matrix r (n); in step 5, the instantaneous correlation matrix R obtained in step 4 is usedss(n) and the correlation matrix r (n) to obtain a desired vector w (n) ═ w1 w2]T(ii) an estimate of (d); in step 6, the vector obtained in step 5 is usedTwo weighting values w1And w2And obtaining the estimation of the direction of arrival of the required signal.
According to the instantaneous correlation matrix Rss(n) and the correlation matrix r (n) to obtain a desired vector w (n) ═ w1 w2]TThe estimate of (d) is obtained as follows:
setting the initial conditions as follows: w (0) ═ 10]TThe residual vector g (0) [ -10 ]]TThe gradient vector p (1) is g (0), n is 1, and the update step is calculated sequentially:
<math> <mrow> <mi>α</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>=</mo> <mi>η</mi> <mfrac> <mrow> <msup> <mrow> <mi>p</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> <mi>T</mi> </msup> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> <mrow> <mi>p</mi> <msup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>T</mi> </msup> <mi>R</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>p</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <msub> <mi>λ</mi> <mi>f</mi> </msub> <mo>-</mo> <mrow> <mn>0.5</mn> <mo>)</mo> </mrow> <mo>≤</mo> <mi>η</mi> <mo>≤</mo> <msub> <mi>λ</mi> <mi>f</mi> </msub> </mrow> </math> what is needed is
The required vector update is calculated as:
w(n)=w(n-1)+α(n)p(n)
the residual vector update formula is:
g(n)=λfg(n-1)-α(n)R(n)p(n)-Rss(n)w(n-1)
the gradient adjustment step size is calculated as follows:
<math> <mrow> <mi>β</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msup> <mrow> <mo>(</mo> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>-</mo> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mi>T</mi> </msup> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msup> <mrow> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> <mi>T</mi> </msup> <mi>g</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow> </math>
gradient vector update calculation:
p(n)=g(n)+β(n)p(n)
through each iterative calculation, the required vector w (n) ═ w can be obtained1 w2]T。
Obtaining the desired vector w (n) ═ w1 w2]TThe estimate of (c) can also be obtained as follows: the correlation matrix r (n) is subjected to a singular value decomposition as follows:
R(n)=U(n)∑(n)U(n)H=[u(n) w(n)]diag{λ1,λ2}[u(n)w(n)]H λ1>λ2not less than 0, the required vector w (n) ═ w can be obtained1 w2]T。
Using two weighted weights w1And w2In the process of obtaining the desired estimation of the direction of arrival of the signal, the signal direction angle phi is equal to angle (w) for the antennas having the array elements disposed at equal distances on the circumference2)-angle(w1) (ii) a For the antennas with linearly and equidistantly arranged array elements, the arrival direction angle of the signals is as follows: <math> <mrow> <mi>θ</mi> <mo>=</mo> <msup> <mi>sin</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mrow> <mo>(</mo> <mfrac> <mi>λφ</mi> <mrow> <mn>2</mn> <mi>πd</mi> </mrow> </mfrac> <mo>)</mo> </mrow> <mo>.</mo> </mrow> </math>
it can be seen from the above detailed implementation process of the present invention that the present invention is applicable to a mobile communication system requiring DOA estimation, and can provide DOA estimation with small variance.