Adaptive Wideband Beamforming with Combined Spatial/Temporal Subband Decomposition

An adaptive wideband beamforming structure with a lower computational com- plexity and higher convergence speed is proposed, which is achieved by combined spatial/temporal subband decomposition. First, the received array signals are processed by a transformation ma- trix, and then split into subbands by a series of analysis fllter banks. At each subband, an independent beamformer can be operated, where some of the lower subbands can be discarded without afiecting its performance due to the highpass flltering efiect of the transformation matrix. 1. INTRODUCTION Beamforming has found many applications in various areas ranging from sonar and radar to wireless communications (1). It is a signal processing technique to form beams in order to receive signals illuminating a sensor array from speciflc directions, whilst attenuating signals from other directions. In a statistically optimum beamformer (2), since the statistics of the array data are often not known or may change over time, adaptive algorithms may be used to determine the beamformer's coe-cients. A beamformer structure for wideband array signals is shown in Fig. 1, where each of the M received signals is processed by an FIR fllter with a length of J and the outputs of these FIR fllters are then sumed up to form the flnal output. To perform adaptive wideband beamforming with high interference rejection and angular resolu- tion, arrays with a large number of sensors and fllter coe-cients have to be employed. Reducing the resultant high computational complexity and increasing its convergence speed has motivated many difierent solutions, including partially adaptive beamforming (3), transform-domain or frequency- domain beamforming (4,5), and subband beamforming (6,7). Recently, a generalised sidelobe can- celler (GSC) with combined subband decomposition in both the temporal and spatial domains was proposed in (8), where the columns of the blocking matrix are judiciously designed to generate a highpass flltering efiect to the array signals. The bandlimited spectra of the resultant outputs are then exploited by subband decomposition and appropriately discarding the low-pass subbands, where there is no signal existing. In this paper, we generalize the idea in (8) and propose a subband-selective transformation matrix, which is applied to the received array signals as a preprocessing step. Each of the outputs

[1]  Lajos Hanzo,et al.  Subband adaptive generalized sidelobe canceller for broadband beamforming , 2001, Proceedings of the 11th IEEE Signal Processing Workshop on Statistical Signal Processing (Cat. No.01TH8563).

[2]  Wen-Hsien Fang,et al.  Wavelet-Based Broadband Beamformers with Dynamic Subband Selection , 2000 .

[3]  B. Champagne,et al.  GSC realisations using the two-dimensional transform-domain LMS algorithm , 1994 .

[4]  Harry L. Van Trees,et al.  Optimum Array Processing , 2002 .

[5]  L. J. Griffiths,et al.  An alternative approach to linearly constrained adaptive beamforming , 1982 .

[6]  Stephan Weiss,et al.  On adaptive filtering in oversampled subbands , 1998 .

[7]  B.D. Van Veen,et al.  Beamforming: a versatile approach to spatial filtering , 1988, IEEE ASSP Magazine.

[8]  Wei Liu,et al.  A subband-selective broadband GSC with cosine-modulated blocking matrix , 2004, IEEE Transactions on Antennas and Propagation.

[9]  Yuan‐Hwang Chen,et al.  Frequency‐domain implementation of Griffiths–Jim adaptive beamformer , 1992 .

[10]  S. Weiss,et al.  An efficient scheme for broadband adaptive beamforming , 1999, Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers (Cat. No.CH37020).