Adaptive detection threshold optimization for tracking in clutter

The adaptive optimization of detection thresholds for tracking in clutter is investigated for the probabilistic data association (PDA) filter. Earlier work on this problem by T.E. Fortmann et al. (1985) involved an approximate steady-state analysis of the state error covariance and is only suitable for time-invariant systems. Furthermore, the method requires numerous assumptions and approximations about the error covariance update equation, and uses a cumbersome graphical optimization algorithm. In this work we propose two adaptive schemes for threshold optimization, namely prior and posterior optimization algorithms which minimize the mean-square state estimation error over detection thresholds which depend on data up to the previous and current time-step, respectively. These algorithm are suitable for real-time implementation in time-varying systems. Some simulation results are presented     

Azimuth/elevation direction finding using regular array geometries

The authors consider the problem of extending the estimation of signal parameters via rotational invariance techniques (ESPRIT) algorithm for multiple source, cochannel direction finding to the two-dimensional case (e.g., azimuth and elevation angle estimation). Two algorithms are presented, one based on the optimal (minimal variance) subspace fitting formulation of ESPRIT, and the other based on an approximation to it. The algorithms are applicable to antenna arrays composed of identical subarrays displaced in two dimensions, such as uniform rectangular phased arrays. Simulation results illustrating the relative performance of the algorithms are also presented     

Comparison of Superresolution Algorithms for Radio Direction Finding

The problem of high-frequency radio direction finding (HFDF) has perennially been compounded by the interference effects of multicomponent wavefields. The wavefields are generally produced by ionospheric multipath or cochannel interference from other transmitted signals. Because HFDF sytems must operate on short duration signals and are usually restricted to limited antenna array apertures, modern techniques of superresolution spectral analysis are applied to resolve the constituency of multicomponent wavefields. This paper presents a performance comparison of five superresolution spectral algorithms in solving the HFDF wave interference problem.     

平滑重构稀疏贝叶斯学习测向算法

针对二级嵌套阵列中的紧凑阵元结构易受互耦效应影响的问题,提出了两种不同的嵌套阵列结构改进方法：连续平移嵌套阵列和间隔平移嵌套阵列。通过对原有二级嵌套阵列阵元位置进行调整,形成了两种不同的平移嵌套阵列结构,这两种结构对应的差分共阵均"无孔",并且测向自由度和阵列稀疏度均大于原二级嵌套阵列。针对嵌套阵列的差分共阵测向模型为单测量矢量模型,稀疏贝叶斯学习测向算法复杂度高的问题,提出了平滑重构稀疏贝叶斯学习算法。该算法通过空间平滑重构将单测量矢量模型变为多测量矢量模型,降低了观测矩阵的维度,减小了计算复杂度。算法求解时,通过对变换后的观测矩阵进行奇异值分解,进一步降低了观测矩阵维度,利用稀疏贝叶斯学习算法估计辐射源角度。仿真表明,在信噪比和采样数相同的条件下,该算法收敛速度比单测量矢量稀疏贝叶斯学习（SMV-SBL）算法快,且测向精度高于SMV-SBL算法和空间平滑多重信号分类（MUSIC）算法;存在互耦影响时,两种平移嵌套阵列比原嵌套阵列受互耦影响小。     

应用时变参数建模方法辨识时变模态参数

 应用非平稳时间序列的时变自回归建模方法进行了参数随时间变化的线性系统模态参数的辨识。对线性时变系统在白噪声激励下振动响应的非平稳时间序列进行建模。通过引入基函数将非平稳过程的辨识问题转化为线性时不变过程的辨识。结合信号时频变换确定模型阶次, 通过时变的伯格尔( Bur g) 算法对时变的自回归(AR) 模型系数和时变结构模态频率进行了估算。通过对刚度随时间变化的三自由度系统模态频率的仿真辨识, 验证了辨识方法的有效性。     

Markov随机跳变系统的传感器系统误差估计

 针对Markov随机跳变系统的系统误差估计问题,提出一种基于马尔可夫链蒙特卡罗(MCMC)和最大似然估计相结合的在线系统误差估计方法。利用最大似然估计给出系统误差等效后验概率分布函数,采用Metropolis-Hastings抽样方法从该概率分布函数中进行抽样;利用系统误差估计和状态估计互为因果的关系,采用期望极大化(EM)方法迭代估计出最优的系统误差;分别对时变和时不变系统误差场景进行仿真分析,结果表明,在考虑系统误差统计特性的同时,所提方法对解决目标运动模型难以建立情况下的系统误差估计问题具有可行性和有效性。     

Navigation system design using time-varying complementary filters

A new methodology for the design of navigation systems for autonomous vehicles is introduced. Using simple kinematic relationships, the problem of estimating the velocity and position of an autonomous vehicle is solved by resorting to special bilinear time-varying filters. These are the natural generalization of linear time-invariant complementary filters that are commonly used to properly merge sensor information available at low frequency with that available in the complementary region. Complementary filters lend themselves to frequency domain interpretations that provide valuable insight into the filtering design process. This work extends these properties to the time-varying setting by resorting to the theory of linear differential inclusions and by converting the problem of weighted filter performance analysis into that of determining the feasibility of a related set of linear matrix inequalities (LMIs). Using this set-up, the stability of the resulting filters as well as their "frequency-like" performance can be assessed using efficient numerical analysis tools that borrow from convex optimization techniques. The mathematical background that is required for complementary time-varying filter analysis and design is introduced. Its application to the design of a navigation system that estimates position and velocity of an autonomous vehicle by complementing position information available from GPS with the velocity information provided by a Doppler sonar system is described.     

Circular array STAP

Traditionally, space-time adaptive processing (STAP) for airborne early warning (AEW) radar has been applied to uniform linear arrays (ULAs). However, when considering the overall radar system, electronically scanned circular arrays have advantages: a better combination of even and continual angular and temporal coverage, and mechanical simplicity because it does not need to rotate. This paper answers the question “How well does STAP perform when applied to a circular array?” This paper shows that for the AEW mission, circular arrays are indeed STAP compatible. However, when conventional STAP algorithms are used there may be a small loss in performance when compared with a ULA. With some care in the choice and implementation of the STAP algorithm, the majority of the degradation is at close ranges, where the target returns are relatively strong. At long ranges performance is barely affected. A STAP algorithm which compensates for the circular array environment and provides better performance than existing algorithms is presented     

Optimal FIR filters for time-varying state-space models

An optimal FIR (finite impulse response) filter and smoother is introduced for the time-varying state-space model. The suggested filter has an FIR structure and utilizes finite observation. It is shown that the impulse response of the optimal FIR filter can be obtained by a simple Riccati-type matrix differential equation. Especially for time-invariant systems, this FIR filter reduces to previously known simple forms. For implementation, a recursive form of the optimal FIR filter and smoother is derived by using adjoint variables, and computational algorithms are suggested. It is also shown by sensitivity analysis that the proposed optimal FIR filter alleviates potential divergence characteristics of the standard Kalman filter     

Array shape estimation tracking using active sonar reverberation

This paper concerns the problem of array shape estimation and tracking for towed active sonar arrays, using received reverberation returns from a single transmitted CW pulse. Uniform linear arrays (ULAs) deviate from their nominal geometry while being towed due to ship maneuvers as well as ocean currents. In such scenarios, conventional beamforming performed under the assumption of a ULA can sometimes lead to unacceptably high spatial sidelobes. The reverberation leaking through the sidelobes can potentially mask weak targets in Doppler, especially when the target Doppler is close to that of the mainlobe reverberation and the reverberation-to-target ratio (RTR) is very high. Although heading sensors located along the array can be used to provide shape estimates, they may not be sufficiently available or accurate to provide the required sidelobe levels. We propose an array shape calibration algorithm using multipath reverberation returns from each ping as a distributed source of opportunity. More specifically, a maximum likelihood (ML) array shape calibration algorithm is developed, which exploits a deterministic relationship between the reverberation spatial and Doppler frequencies causing it to be low rank in the space-time vector space formed across a single coherent processing interval (CPI). In this application, a sequence of overlapped CPI length snapshots of duration less than the CW pulse is used. The ML estimates obtained for each snapshot are tracked using a Kalman filter with a state equation corresponding to the water pulley model for array dynamics. Simulations performed using real heading sensor data in conjunction with simulated reverberation suggest that 8-10 dB improvement in sidelobe level may be possible using the proposed array shape tracking algorithm versus an algorithm that uses only the available heading information.     

基于平面图形的典型浮标规划算法

针对海上应召反潜、检查反潜等常规任务场景以及新型浮标的使用,本文提出了基于折线阵、多直线阵和方形覆盖阵共三种平面图形的典型浮标规划算法,通过优化设置参数和改进规划阵形生成不同的浮标布阵方案。仿真表明该三种图形种类丰富,广泛适用于目标搜索阶段,满足应召反潜、检查反潜等常规反潜任务场景的使用需求,相比于传统规划阵形,具有更高的目标搜索概率。     

Rapid convergence by cascading Applebaum adaptive arrays

An adaptive array architecture is described which has improved convergence speed over the conventional Applebaum array when the eigenvalue spread of the input signal covariance matrix is large. The architecture uses N+1 Applebaum adaptive arrays in a two-layer cascaded configuration. The gain constants in the first layer are set so that large interfering sources are quickly nulled, but small interfering sources are suppressed more slowly. Since the first layer removes the large interfering signals, the gain constant for the second layer can be set to a large value to quickly null the smaller interferers. The adaptation time is examined for several combinations of signal levels and array sizes. It is shown that, in many signal environments, the computational requirements for the cascaded array compare favorably with those of conventional sample matrix inversion (SMI) methods for large arrays     

一种基于最小流形长度的高精度线阵设计

 传统上以阵列孔径来比较各种线阵的测向性能,但这一指标没有考虑到阵元数目及阵列几何布局对阵列性能的影响。因子空间类算法需搜索阵列流形来进行测向,所以阵列流形对阵列性能有重要影响。阵列流形又是阵元数、阵列几何布局的函数,可通过阵列流形来研究阵元数、阵列几何布局与阵列测向性能的关系。在分析了线阵流形与线阵测向精度的关系的基础上,提出了一个基于线阵最小流形长度的指标来比较不同线阵的性能,该指标综合考虑了阵元数、阵列几何布局对阵列测向精度的影响。通过对此指标的讨论,给出了提高线阵测向精度的设计思路。对几个不同线阵的仿真证实了该指标的有效性,也验证了该设计思路的可行性。     

Joint time-frequency transform for radar range-Doppler imaging

Conventional radar imaging uses the Fourier transform to retrieve Doppler information. However, due to the complex motion of a target, the Doppler frequency shifts are actually time-varying. By using the Fourier transform, the Doppler spectrum becomes smeared and the image is blurred. Without resorting to sophisticated motion compensation algorithms, the image blurring problem can be resolved with the joint time-frequency transform. High-resolution time-frequency transforms are investigated, and examples of applications to radar imaging of single and multiple targets with complex motion are given     

航天器相对运动估计的一种并行推广卡尔曼滤波方法

 从并行的观点出发，研究应用推广卡尔曼滤波估计航天器交会对接寻的期相对位置和速率问题。推导出交会推广卡尔曼滤波公式；提出了基于奇异值分解（ＳＶＤ）和Ｆａｄｄｅｖ算法的并行平方根算法；给出了其脉动阵列（Ｓｙｓｔｏｌｉｃ）实现结构；并对阵列所需的处理单元数目和执行一次迭代所需的时间步进行了分析，说明了其实现的优越性。为航天器相对运动估计提供了一种新的有效方法     

Improved Feedback Loop for Adaptive Arrays

This paper is concerned with the problem of time constants in adaptive arrays. The paper presents a improved form of an adaptive array feedback loop, which has the property that its time constants are fixed. This property is an advantage over the well-known least mean square (LMS) loop, for which time constants depend on received signal power. Fixed time constants are of interest because they simplify dynamic range problems for adaptive arrays in communication and radar systems.     

运动单阵元被动合成阵列波达方向估计

 提出了一种运动单阵元被动合成阵列波达方向(DOA)估计算法。该算法基于被动合成阵列(PSA)的概念,结合空间谱估计的思想构建了运动单阵元被动合成阵列模型,通过多次不同速度合成阵列过程实现对信号DOA的无模糊估计。通过对单次匀速合成阵列过程进行分析得到,在假设信号频率已知条件下,合成阵列算法能够达到与同孔径实阵列多重信号分类（MUSIC）算法相当的DOA估计性能。仿真验证了被动合成阵列与同孔径实阵列的渐近等效性及算法的有效性。     

Constrained Least-Squares Synthesis of Coefficients for Arrays of Sensors and FIR Digital Filters

A general method is presented for synthesizing weighting coefficients for arrays of sensors or for finite-impulse-response (FIR) digital filters. The beam pattern of the array or the frequency response of the digital filter is a weighted, least mean-square (LMS) approximation to a desired function, subject to constrained pattern values at specified points. The method is applied to the problem of producing beam patterns of a line array for the rejection of interfering point sources. For this case, we show that adaptive array processing can be based on modification of the roots of the array polynomial.     

Two low-cost phased arrays

In a phased array antenna, the phase shifters (or T/R modules in an active aperture phased array) with their beam-steering control circuitry along with the feed network account for the major hardware cost. This paper presents two antenna array configurations that use simpler feed, simpler phase-shifting and simpler beam-steering control circuitry for realizing low-cost phased arrays. Both are lens configurations. The first one uses a Radant lens, which provides a medium that is loaded with diodes and provides the needed phase shift by switching the diodes on and off. The other configuration employs a ferroelectric dielectric material whose dielectric constant can be varied with an applied DC bias voltage. It is shown that the ferroelectric lens may have further advantages of smaller thickness, simpler beam-steering controls and lower cost     

Signal Acquisition Techniques for Receiving Arrays of Large-Aperture Antennas

This paper considers the signal phase acquisition problem for arrays of large-aperture steerable antennas. In particular, long-range signal acquisition is considered for those cases in which the signal-to-noise ratio in each antenna-receiver channel is too low to permit signal phase-lock in each individual receiver. Techniques are discussed which promise to extend the array acquisition sensitivity toward that of an equivalent-area single-aperture antenna. Several acquisition methods are analyzed mathematically and an approximate minimum power threshold estimated for each technique. A numerical comparison between the acquisition techniques for various assumed atmospheric conditions is presented which indicates the limitations on array sensitivity imposed by both the transmission medium and the acquisition technique.