Reducing the number of elements in the synthesis of a broadband linear array with multiple simultaneous frequency-invariant beam patterns

© 2018 IEEE. The problem of reducing the number of elements in a broadband linear array with multiple simultaneous crossover frequency-invariant (FI) patterns is considered. Different from the single FI pattern array case, every element channel in the multiple FI pattern array is divided and followed by multiple finite-impulse-response (FIR) filters, and each of the multiple FIR filters has a set of coefficients. In this situation, a collective filter coefficient vector and its energy bound are introduced for each element, and then the problem of reducing the number of elements is transformed as minimizing the number of active collective filter coefficient vectors. In addition, the radiation characteristics including beam pointing direction, mainlobe FI property, sidelobe level, and space-frequency notching requirement for each of the multiple patterns can be formulated as multiple convex constraints. The whole synthesis method is implemented by performing an iterative second-order cone programming (SOCP). This method can be considered as a significant extension of the original SOCP for synthesizing broadband sparse array with single FI pattern. Numerical synthesis results show that the proposed method by synthesizing multiple discretized crossover FI patterns can save more elements than the original iterative SOCP by using a single continuously scannable FI pattern for covering the same space range. Moreover, even for multiple FI-patterns case with complicated space-frequency notching, the proposed method is still effective in the reduction of the number of elements

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

Towards Unified All-Neural Beamforming for Time and Frequency Domain Speech Separation

Recently, frequency domain all-neural beamforming methods have achieved remarkable progress for multichannel speech separation. In parallel, the integration of time domain network structure and beamforming also gains significant attention. This study proposes a novel all-neural beamforming method in time domain and makes an attempt to unify the all-neural beamforming pipelines for time domain and frequency domain multichannel speech separation. The proposed model consists of two modules: separation and beamforming. Both modules perform temporal-spectral-spatial modeling and are trained from end-to-end using a joint loss function. The novelty of this study lies in two folds. Firstly, a time domain directional feature conditioned on the direction of the target speaker is proposed, which can be jointly optimized within the time domain architecture to enhance target signal estimation. Secondly, an all-neural beamforming network in time domain is designed to refine the pre-separated results. This module features with parametric time-variant beamforming coefficient estimation, without explicitly following the derivation of optimal filters that may lead to an upper bound. The proposed method is evaluated on simulated reverberant overlapped speech data derived from the AISHELL-1 corpus. Experimental results demonstrate significant performance improvements over frequency domain state-of-the-arts, ideal magnitude masks and existing time domain neural beamforming methods

Development of a Resource Manager Framework for Adaptive Beamformer Selection

Adaptive digital beamforming (DBF) algorithms are designed to mitigate the effects of interference and noise in the electromagnetic (EM) environment encountered by modern electronic support (ES) receivers. Traditionally, an ES receiver employs a single adaptive DBF algorithm that is part of the design of the receiver system. While the traditional form of receiver implementation is effective in many scenarios it has inherent limitations. This dissertation proposes a new ES receiver framework capable of overcoming the limitations of traditional ES receivers. The proposed receiver framework is capable of forming multiple, independent, simultaneous adaptive digital beams toward multiple signals of interest in an electromagnetic environment. The main contribution of the research is the development, validation, and verification of a resource manager (RM) algorithm. The RM estimates a set of parameters that characterizes the electromagnetic environment and selects an adaptive digital beam forming DBF algorithm for implementation toward all each signal of interest (SOI) in the environment. Adaptive DBF algorithms are chosen by the RM based upon their signal to interference plus noise ratio (SINR) improvement ratio and their computational complexity. The proposed receiver framework is demonstrated to correctly estimate the desired electromagnetic parameters and select an adaptive DBF from the LUT

Array signal processing for source localization and enhancement

“A common approach to the wide-band microphone array problem is to assume a certain array geometry and then design optimal weights (often in subbands) to meet a set of desired criteria. In addition to weights, we consider the geometry of the microphone arrangement to be part of the optimization problem. Our approach is to use particle swarm optimization (PSO) to search for the optimal geometry while using an optimal weight design to design the weights for each particle’s geometry. The resulting directivity indices (DI’s) and white noise SNR gains (WNG’s) form the basis of the PSO’s fitness function. Another important consideration in the optimal weight design are several regularization parameters. By including those parameters in the particles, we optimize their values as well in the operation of the PSO. The proposed method allows the user great flexibility in specifying desired DI’s and WNG’s over frequency by virtue of the PSO fitness function. Although the above method discusses beam and nulls steering for fixed locations, in real time scenarios, it requires us to estimate the source positions to steer the beam position adaptively. We also investigate source localization of sound and RF sources using machine learning techniques. As for the RF source localization, we consider radio frequency identification (RFID) antenna tags. Using a planar RFID antenna array with beam steering capability and using received signal strength indicator (RSSI) value captured for each beam position, the position of each RFID antenna tag is estimated. The proposed approach is also shown to perform well under various challenging scenarios”--Abstract, page iv

Acoustic Speaker Localization with Strong Reverberation and Adaptive Feature Filtering with a Bayes RFS Framework

The thesis investigates the challenges of speaker localization in presence of strong reverberation, multi-speaker tracking, and multi-feature multi-speaker state filtering, using sound recordings from microphones. Novel reverberation-robust speaker localization algorithms are derived from the signal and room acoustics models. A multi-speaker tracking filter and a multi-feature multi-speaker state filter are developed based upon the generalized labeled multi-Bernoulli random finite set framework. Experiments and comparative studies have verified and demonstrated the benefits of the proposed methods