Low-complexity frequency-domain GSC for broadband beamforming

Wei Liu; S. Weiss; L. Hanzo

doi:10.1109/ICOSP.2002.1181071

Low-complexity frequency-domain GSC for broadband beamforming

Wei Liu, S. Weiss, L. Hanzo

Electronic And Electrical Engineering

Research output: Contribution to conference › Paper › peer-review

2 Citations (Scopus)

Abstract

This paper proposes a new method to reduce the computational complexity of the frequency-domain GSC. In this proposed GSC structure, the column vectors of the blocking matrix constitute a series of bandpass filters, which decompose the impinging signals into components of specific DOA angles and frequencies and lead to band-limited spectra of blocking matrix outputs. When applying a DFT to each of these outputs, some of the frequency bins of the DFT are zero and can be omitted from the adaptive processing. This, together with partial adaptivity of the beamformer, results in a low computational complexity system.

Original language	English
Pages	386-389
Number of pages	4
DOIs	https://doi.org/10.1109/ICOSP.2002.1181071
Publication status	Published - 2002
Event	6th International Conference on Signal Processing - Beijing, China Duration: 26 Aug 2002 → 30 Aug 2002

Conference

Conference	6th International Conference on Signal Processing
Abbreviated title	ICSP'02
Country/Territory	China
City	Beijing
Period	26/08/02 → 30/08/02

Keywords

covariance matrix
subspace constraints
sensor arrays
phased arrays
least squares approximation
frequency
filters
array signal processing
computational complexity
constraint optimization

Access to Document

10.1109/ICOSP.2002.1181071

Cite this

@conference{2ca0120d09584651af8467ec10da7c6f,

title = "Low-complexity frequency-domain GSC for broadband beamforming",

abstract = "This paper proposes a new method to reduce the computational complexity of the frequency-domain GSC. In this proposed GSC structure, the column vectors of the blocking matrix constitute a series of bandpass filters, which decompose the impinging signals into components of specific DOA angles and frequencies and lead to band-limited spectra of blocking matrix outputs. When applying a DFT to each of these outputs, some of the frequency bins of the DFT are zero and can be omitted from the adaptive processing. This, together with partial adaptivity of the beamformer, results in a low computational complexity system.",

keywords = "covariance matrix, subspace constraints, sensor arrays, phased arrays, least squares approximation, frequency , filters, array signal processing, computational complexity, constraint optimization",

author = "Wei Liu and S. Weiss and L. Hanzo",

year = "2002",

doi = "10.1109/ICOSP.2002.1181071",

language = "English",

pages = "386--389",

note = "6th International Conference on Signal Processing, ICSP'02 ; Conference date: 26-08-2002 Through 30-08-2002",

}

TY - CONF

T1 - Low-complexity frequency-domain GSC for broadband beamforming

AU - Liu, Wei

AU - Weiss, S.

AU - Hanzo, L.

PY - 2002

Y1 - 2002

N2 - This paper proposes a new method to reduce the computational complexity of the frequency-domain GSC. In this proposed GSC structure, the column vectors of the blocking matrix constitute a series of bandpass filters, which decompose the impinging signals into components of specific DOA angles and frequencies and lead to band-limited spectra of blocking matrix outputs. When applying a DFT to each of these outputs, some of the frequency bins of the DFT are zero and can be omitted from the adaptive processing. This, together with partial adaptivity of the beamformer, results in a low computational complexity system.

AB - This paper proposes a new method to reduce the computational complexity of the frequency-domain GSC. In this proposed GSC structure, the column vectors of the blocking matrix constitute a series of bandpass filters, which decompose the impinging signals into components of specific DOA angles and frequencies and lead to band-limited spectra of blocking matrix outputs. When applying a DFT to each of these outputs, some of the frequency bins of the DFT are zero and can be omitted from the adaptive processing. This, together with partial adaptivity of the beamformer, results in a low computational complexity system.

KW - covariance matrix

KW - subspace constraints

KW - sensor arrays

KW - phased arrays

KW - least squares approximation

KW - frequency

KW - filters

KW - array signal processing

KW - computational complexity

KW - constraint optimization

U2 - 10.1109/ICOSP.2002.1181071

DO - 10.1109/ICOSP.2002.1181071

M3 - Paper

SP - 386

EP - 389

T2 - 6th International Conference on Signal Processing

Y2 - 26 August 2002 through 30 August 2002

ER -

Low-complexity frequency-domain GSC for broadband beamforming

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this