共查询到20条相似文献,搜索用时 31 毫秒
1.
Gansman J.A. Zoltowski M.D. Krogmeier J.V. 《Signal Processing, IEEE Transactions on》1996,44(11):2780-2792
This paper presents a beamspace version of ESPRIT for uniform rectangular arrays that supports closed-form 2-D angle estimation, automatically couples the two components of the source directions, and works with any front end beamformer. The proposed algorithm is based on the observation that beamspace noise eigenvectors can be transformed to vectors that are bandpass and have spectral nulls at the inband source locations. This facilitates multirate processing (involving modulation to baseband, filtering, and decimation) and yields a space with dimensionality equal to the number of beams used to probe the subband rather than the number of elements in the sensor array. The MUSIC algorithm can be applied to this noise subspace. Alternatively, a transformation matrix can be computed a priori, which maps the beamspace signal eigenvectors to the corresponding signal subspace that has the ESPRIT structure. The TLS-ESPRIT algorithm is then modified to obtain the two directions for each source from a single eigenvalue-eigenvector pair. Hence, they are automatically coupled 相似文献
2.
3.
Beamspace ESPRIT 总被引:9,自引:0,他引:9
Guanghan Xu Silverstein S.D. Roy R.H. Kailath T. 《Signal Processing, IEEE Transactions on》1994,42(2):349-356
Most high-resolution algorithms for sensor array processing require an eigendecomposition, which is a computation that is difficult to implement in parallel and requires O(M3) multiplications for an M×M matrix, corresponding to M sensors. Beamspace transformation is one way of reducing computation and sometimes improving the estimation accuracy. As a consequence of the beamspace transformation performed, however, arrays such as uniform linear arrays commonly used in direction finding lose their displacement invariance structure. As a result, computational complexity may actually increase since the computationally efficient ESPRIT algorithm cannot be applied directly. In this paper, a method for restoring the invariance structure resulting in a beamspace ESPRIT algorithm is described. Asymptotic performance analysis of beamspace ESPRIT and simulation results are presented as well 相似文献
4.
5.
单基地多输入多输出(MIMO)雷达的波达方向(DOA)估计问题是近年来研究的热点。高维度的MIMO雷达数据,导致传统旋转不变性参数估计技术(ESPRIT)算法需要付出较大的运算代价。在低信噪比、低快拍数的条件下,传统ESPRIT算法性能会严重下降。为了克服传统ESPRIT算法的以上缺点,该文提出一种降维波束空间的实值ESPRIT算法。该算法通过转换矩阵,将高维度MIMO雷达数据转换到低维度的数据,从而去除数据中的冗余。然后再将低维数据变换到波束空间,构造实值旋转不变性等式,用以估计目标的角度。仿真结果表明,在低信噪比和低快拍数时,相比于传统ESPRIT算法,该文所提方法具有更好的角度估计性能和更少的运算量。 相似文献
6.
Guimei Zheng 《Wireless Personal Communications》2014,75(4):1879-1889
The computational complexity for the direction of departure (DOD) and direction of arrival (DOA) estimation in bistatic MIMO radar increases very rapidly with the number of sensors. To reduced computational complexity, a beamspace Root-MUSIC algorithm for joint DOD and DOA is proposed in this paper. Ingenuous mathematical manipulations utilizing the properties of common out-of-band nulls offered by discrete Fourier transform matrix beamformer are proposed to restore the Vandermonde structure with a reduced degree, which is lost in beamspace transformation for both the transmit array and the receive array. Then the DOD and DOA can be estimated via polynomials root finding procedure. The proposed algorithm can work in reduced dimension beamspace data and reduced degree polynomial root finding procedure in the final stage of Root-MUSIC. Moreover, automatic paring between the DODs and DOAs can be obtained. Simulation results demonstrate that the effectiveness of the proposed algorithm. 相似文献
7.
This paper introduces a method for solving DOA estimation ambiguity in ESPRIT algorithm with the conventional beamformer. With the help of it, for any space of two subarrays, the signal DOA in [-π/2 ,π/2] can be estimated effectively by using ESPRIT algorithm. Finally, some simulation results to verify the theoretical analyses are presented. 相似文献
8.
Conjugate ESPRIT (C-SPRIT) 总被引:5,自引:0,他引:5
In this paper, we present an algorithm to estimate the direction of the arrival angles (DOAs) from noncoherent one-dimensional (1-D) signal sources such as binary phase shift keying (BPSK) and M-ary amplitude shift keying (MASK). The proposed algorithm can provide a more precise DOA estimation and can detect more signals than well-known classical subspace-methods MUSIC and ESPRIT for the 1-D signals. The complexity is the same as that of ESPRIT since the proposed algorithm uses the same array geometry and subarray processing that ESPRIT does. The main differences between the proposed algorithm and the ESPRIT algorithm are as follows: 1) the number of overlapping array elements between two subarrays is equal to M in the proposed algorithm, while in ESPRIT the maximum number of overlapping elements is M-1, where M denotes the total number of array elements, and 2) the proposed algorithm employs the conjugate of rotation matrix (CRM) /spl Phi//sup */ while ESPRIT uses /spl Phi/ with no conjugate for the second subarray geometry. 相似文献
9.
The UCA-ESPRIT is a closed-form algorithm developed for use in conjunction with a uniform circular array (UCA) that provides automatically paired source azimuth and elevation angle estimates. The 2-D unitary ESPRIT is presented as an algorithm providing the same capabilities for a uniform rectangular array (URA). In the final stage of the algorithm, the real and imaginary parts of the ith eigenvalue of a matrix are one-to-one related to the respective direction cosines of the ith source relative to the two major array axes. The 2-D unitary ESPRIT offers a number of advantages over other proposed ESPRIT based closed-form 2-D angle estimation techniques. First, except for the final eigenvalue decomposition of a dimension equal to the number of sources, it is efficiently formulated in terms of real-valued computation throughout. Second, it is amenable to efficient beamspace implementations that are presented. Third, it is applicable to array configurations that do not exhibit identical subarrays, e.g., two orthogonal linear arrays. Finally, the 2-D unitary ESPRIT easily handles sources having one member of the spatial frequency coordinate pair in common. Simulation results are presented verifying the efficacy of the method 相似文献
10.
均匀线列阵下的快速TLS-ESPRIT算法 总被引:3,自引:0,他引:3
TLS-ESPRIT算法是一种方位估计算法,由于采用了全局最小二乘估计,其在低信噪比下的估计性能较ESPRIT算法有所提高,但算法略显复杂。本文针对均匀线列阵,构成了TLS-ESPRIT的简化算法,使其运算量明显减少,同时还可给出源功率的估计。文中给出了算法的结构及计算机仿真结果。 相似文献
11.
A novel wavelet-based generalized sidelobe canceller 总被引:1,自引:0,他引:1
Yi Chu Wen-Hsien Fang 《Antennas and Propagation, IEEE Transactions on》1999,47(9):1485-1494
This paper presents a novel narrow-band adaptive beamformer with the generalized sidelobe canceller (GSC) as the underlying structure. The new beamformer employs a wavelet-based approach for the design of the blocking matrix of the GSC, which is now constituted by a set of regular M-band wavelet filters. Such a construction of the blocking matrix can not only block the desired signals from the lower path as required provided the wavelet filters have sufficiently high regularity, but it also encompasses the widely used one with ones and minus ones along the diagonals as a special case. In addition, it possesses two advantageous features. First, the eigenvalue spreads of the covariance matrices of the blocking matrix outputs, as demonstrated in various scenarios, are decreased as compared with those of previous approaches. Since the popular least mean squares (LMS) algorithm has been notorious for its slow convergence rate, the reduction of the eigenvalue spreads can, in general, accelerate the convergence speed of the succeeding LMS algorithm. Second, the new beamformer belongs to a specific type of partially adaptive beamformers, wherein only a portion of the available degree of freedom is utilized in the adaptive processing. As such, the overall computational complexity is substantially reduced when compared to previous works. The issues of choosing the parameters involved for superior performance are also addressed. Simulation results are furnished as well to justify this new approach 相似文献
12.
13.
14.
提出了共轭增强ESPRIT(CA-ESPRIT)算法,利用阵列输出的延迟相关函数及其共轭形成伪阵列输出,从而得到伪协方差矩阵,对其进行特征分解,用ESPRIT算法得到波迭方向。仿真实验表明,新算法可对多于阵元数的信号进行测向,其测角精度和分辨能力优于ESPRIT算法,运行时间小于有相同阵列扩展能力的MUSIC—like算法。 相似文献
15.
If one incorporates a beamformer composed of conjugate centro-symmetric weight vectors as a preprocessor to an eigenstructure direction finding algorithm, a real-valued decomposition can be employed to estimate the noise and signal subspaces from the sample covariance matrix. The effect of employing the real processing methodology on the angle estimation performance of beamspace MUSIC is explored. Specifically, the distribution of the real-valued signal subspace eigenvectors is derived and used in an asymptotic analysis of the bias and variance of the MUSIC estimator. The theoretical analysis shows that processing the real part of the beamspace sample covariance matrix offers significant performance gains, in addition to the obvious computational benefit, relative to the conventional complex-valued procedure, particularly in the case of correlated sources. Monte Carlo simulations are included to verify the theoretical expressions. A trade-off study of the estimation accuracy versus the desire to provide adequate rejection of unwanted signals in a sector-based interrogation scheme for various beamforming architectures is also presented 相似文献
16.
17.
This paper proposes a new digital beamformer for uniform concentric circular arrays (UCCAs) having nearly frequency-invariant (FI) characteristics. The basic principle is to transform the received signals to the phase mode and remove the frequency dependency of the individual phase mode through the use of a digital beamforming or compensation network. As a result, the far-field pattern of the array, which is governed by a set of variable beamformer weights, is electronically steerable, and it is approximately invariant over a wider range of frequencies than conventional uniform circular arrays (UCAs). This also makes it possible to design the compensation network and the beamformer weights separately. The design of the compensation network is formulated as a second order cone programming (SOCP) problem and is solved optimally for minimax criterion. By employing the beamspace approach using the outputs of a set of fixed UCCA frequency-invariant beamformers (FIBs), a new beamspace MUSIC algorithm is proposed for estimating the direction-of-arrivals (DOAs) of broadband sources. Since the beampatterns of the UCCA-FIB is approximately invariant with frequency and is governed by a small set of weights, a very efficient adaptive beamformer using the minimum variance beamforming (MVB) approach can be developed. Simulation results using broadband Gaussian and multisinusoidal inputs show that the proposed adaptive UCCA-FIB is numerically better conditioned than the conventional broadband tapped-delay-line-based adaptive beamformers, due to the FI property and significantly fewer numbers of adaptive parameters. Consequently, a higher output signal-to-inference-plus-noise ratio over the conventional tapped-delay-line approach is observed. The usefulness of the proposed UCCA-FIB in broadband DOA estimation is also verified by computer simulation 相似文献
18.
高分辨波达方向(DOA)估计是地基/空基预警雷达实现主波束内多目标精细跟踪需要解决的关键问题。针对上述问题,该文提出一种波束-多普勒酉ESPRIT多目标DOA估计算法。该方法首先通过时域平滑技术构造多个快拍。然后采用中心共轭对称傅里叶变换矩阵将数据变换至波束-多普勒域,同时保留旋转不变结构。最后采用实值ESPRIT算法估计目标的DOA。所提方法充分利用了信号的时域信息来改善空域参数估计性能,同时具有较低的计算复杂度。实验结果证明了所提方法的有效性。 相似文献
19.
20.
An adaptive generalized sidelobe canceller with derivative constraints 总被引:12,自引:0,他引:12
An adaptive broad-band beamforming structure is presented which employs a gradient-based weight adjustment algorithm to minimize output variance subject to a set ofJ linear constraints on broadband directional derivatives in the desired look direction. A generalized sidelobe-cancelling structure is employed in which a nonadaptive (conventional) beamformer operates in parallel with an adaptive beamformer. The conventional portion has a broad-band beampattern which adheres to the specified constraints while the adaptive path is a cascade of a fixed signal blocking matrix and a set of tapped-delay line filters. Blocking is employed to ensure that all incident waveforms which meet the specified constraints do not reach the tapped-delay lines. As a result, an unconstrained least mean square (LMS) power minimization algorithm is employed to adapt the delay line weights. It is shown that with the addition of the directional derivative constraints, the beamformer quiescent bcampattern becomes a function of the location of the phase center used to specify the constraints. A design criterion for choosing this location is suggested and simulation experiments which illustrate the performance of this new adaptive beamformer are presented. 相似文献