Computationally efficient QRD-based wide-band beamforming

Taking advantage of the time-shift properties inherent in the data makes it possible to reduce the computational load of a least-squares wideband beamforming algorithm from O(N/sup 2/p/sup 2/) to O(Np/sup 2/), assuming a p-channel beamformer with an N-tap filter in each channel. It is shown how the...

Full description

Saved in:
Bibliographic Details
Published inInternational Conference on Acoustics, Speech, and Signal Processing pp. 1799 - 1802 vol.3
Main Authors Proudler, I.K., Shepherd, T.J., McWhirter, J.G.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1990
Subjects
Adaptive filters
Array signal processing
Computer architecture
Filtering algorithms
Filtering theory
Lattices
Wideband
Online AccessGet full text

Cover

More Information
Summary:Taking advantage of the time-shift properties inherent in the data makes it possible to reduce the computational load of a least-squares wideband beamforming algorithm from O(N/sup 2/p/sup 2/) to O(Np/sup 2/), assuming a p-channel beamformer with an N-tap filter in each channel. It is shown how the theory behind the recent work on QR decomposition (QRD)-based lattice filter algorithms can be applied to the wideband beamforming problem, and the computationally efficient QRD-based algorithm that results is described. The resulting architecture is essentially the same as the lattice of triangular arrays that has been derived, separately, by B. Yang and J.F. Bohme (1989) and by F. Ling (1989). The connection between these different approaches is reviewed. Also described is a simplified derivation of the QRD-based lattice algorithm that is applicable to both the adaptive filtering and the wideband beamforming problems.< >
ISSN:1520-6149
2379-190X
DOI:10.1109/ICASSP.1990.115839