Off-broadside main beam design for frequency invariant beamformers

In a previously proposed design method for frequency invariant beamforming, the design for the case of an off-broadside main beam is not satisfactory. After a detailed analysis, we propose two methods to overcome this problem: one is to increase the length of the FIR filter attached to each sensor, as a result, we need to sample the transformed desired response more densely in the associated direction; the other one is to design a broadside main beam first, then it is convolved with appropriate steering delay filters. Design examples show that the two methods can provide satisfactory results

Critical analysis of the eigenfilter method for the design of FIR filters and wideband beamformers

The least squares based eigenfilter method has been applied to the design of both finite impulse response (FIR) filters and wideband beamformers successfully. It involves calculating the resultant filter coefficients as the eigenvector of an appropriate Hermitian matrix, and offers lower complexity and less computation time with better numerical stability as compared to the standard least squares method. In this paper, we revisit the method and critically analyze the eigenfilter approach by revealing a serious performance issue in the passband of the designed FIR filter and the mainlobe of the wideband beamformer, which occurs due to a formulation problem. A solution is then proposed to mitigate this issue, and design examples for both FIR filters and wideband beamformers are provided to demonstrate the effectiveness of the proposed method

Adaptive beamforming using frequency invariant uniform concentric circular arrays

This paper proposes new adaptive beamforming algorithms for a class of uniform concentric circular arrays (UCCAs) having near-frequency invariant characteristics. The basic principle of the UCCA frequency invariant beamformer (FIB) is to transform the received signals to the phase mode representation and remove the frequency dependence of individual phase modes through the use of a digital beamforming or compensation network. As a result, the far field pattern of the array is electronic steerable and is approximately invariant over a wider range of frequencies than the uniform circular arrays (UCAs). The beampattern is governed by a small set of variable beamformer weights. Based on the minimum variance distortionless response (MVDR) and generalized sidelobe canceller (GSC) methods, new recursive adaptive beamforming algorithms for UCCA-FIB are proposed. In addition, robust versions of these adaptive beamforming algorithms for mitigating direction-of-arrival (DOA) and sensor position errors are developed. Simulation results show that the proposed adaptive UCCA-FIBs converge much faster and reach a considerable lower steady-state error than conventional broadband UCCA beamformers without using the compensation network. Since fewer variable multipliers are required in the proposed algorithms, it also leads to lower arithmetic complexity and faster tracking performance than conventional methods. © 2007 IEEE.published_or_final_versio

Broadband adaptive beamforming with low complexity and frequency invariant response

This thesis proposes different methods to reduce the computational complexity as well as increasing the adaptation rate of adaptive broadband beamformers. This is performed exemplarily for the generalised sidelobe canceller (GSC) structure. The GSC is an alternative implementation of the linearly constrained minimum variance beamformer, which can utilise well-known adaptive filtering algorithms, such as the least mean square (LMS) or the recursive least squares (RLS) to perform unconstrained adaptive optimisation.A direct DFT implementation, by which broadband signals are decomposed into frequency bins and processed by independent narrowband beamforming algorithms, is thought to be computationally optimum. However, this setup fail to converge to the time domain minimum mean square error (MMSE) if signal components are not aligned to frequency bins, resulting in a large worst case error. To mitigate this problem of the so-called independent frequency bin (IFB) processor, overlap-save based GSC beamforming structures have been explored. This system address the minimisation of the time domain MMSE, with a significant reduction in computational complexity when compared to time-domain implementations, and show a better convergence behaviour than the IFB beamformer. By studying the effects that the blocking matrix has on the adaptive process for the overlap-save beamformer, several modifications are carried out to enhance both the simplicity of the algorithm as well as its convergence speed. These modifications result in the GSC beamformer utilising a significantly lower computational complexity compare to the time domain approach while offering similar convergence characteristics.In certain applications, especially in the areas of acoustics, there is a need to maintain constant resolution across a wide operating spectrum that may extend across several octaves. To attain constant beamwidth is difficult, particularly if uniformly spaced linear sensor array are employed for beamforming, since spatial resolution is reciprocally proportional to both the array aperture and the frequency. A scaled aperture arrangement is introduced for the subband based GSC beamformer to achieve near uniform resolution across a wide spectrum, whereby an octave-invariant design is achieved. This structure can also be operated in conjunction with adaptive beamforming algorithms. Frequency dependent tapering of the sensor signals is proposed in combination with the overlap-save GSC structure in order to achieve an overall frequency-invariant characteristic. An adaptive version is proposed for frequency-invariant overlap-save GSC beamformer. Broadband adaptive beamforming algorithms based on the family of least mean squares (LMS) algorithms are known to exhibit slow convergence if the input signal is correlated. To improve the convergence of the GSC when based on LMS-type algorithms, we propose the use of a broadband eigenvalue decomposition (BEVD) to decorrelate the input of the adaptive algorithm in the spatial dimension, for which an increase in convergence speed can be demonstrated over other decorrelating measures, such as the Karhunen-Loeve transform. In order to address the remaining temporal correlation after BEVD processing, this approach is combined with subband decomposition through the use of oversampled filter banks. The resulting spatially and temporally decorrelated GSC beamformer provides further enhanced convergence speed over spatial or temporal decorrelation methods on their own

Signal Subspace Processing in the Beam Space of a True Time Delay Beamformer Bank

A number of techniques for Radio Frequency (RF) source location for wide bandwidth signals have been described that utilize coherent signal subspace processing, but often suffer from limitations such as the requirement for preliminary source location estimation, the need to apply the technique iteratively, computational expense or others. This dissertation examines a method that performs subspace processing of the data from a bank of true time delay beamformers. The spatial diversity of the beamformer bank alleviates the need for a preliminary estimate while simultaneously reducing the dimensionality of subsequent signal subspace processing resulting in computational efficiency. The pointing direction of the true time delay beams is independent of frequency, which results in a mapping from element space to beam space that is wide bandwidth in nature. This dissertation reviews previous methods, introduces the present method, presents simulation results that demonstrate the assertions, discusses an analysis of performance in relation to the Cramer-Rao Lower Bound (CRLB) with various levels of noise in the system, and discusses computational efficiency. One limitation of the method is that in practice it may be appropriate for systems that can tolerate a limited field of view. The application of Electronic Intelligence is one such application. This application is discussed as one that is appropriate for a method exhibiting high resolution of very wide bandwidth closely spaced sources and often does not require a wide field of view. In relation to system applications, this dissertation also discusses practical employment of the novel method in terms of antenna elements, arrays, platforms, engagement geometries, and other parameters. The true time delay beam space method is shown through modeling and simulation to be capable of resolving closely spaced very wideband sources over a relevant field of view in a single algorithmic pass, requiring no course preliminary estimation, and exhibiting low computational expense superior to many previous wideband coherent integration techniques