Low-complexity frequency-domain GSC for broadband beamforming

Wei Liu, S. Weiss, L. Hanzo

Research output: Contribution to conferencePaper

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.
LanguageEnglish
Pages386-389
Number of pages4
DOIs
Publication statusPublished - 2002
Event6th International Conference on Signal Processing - Beijing, China
Duration: 26 Aug 200230 Aug 2002

Conference

Conference6th International Conference on Signal Processing
Abbreviated titleICSP'02
CountryChina
CityBeijing
Period26/08/0230/08/02

Fingerprint

Beamforming
Discrete Fourier transforms
Computational complexity
Bins
Bandpass filters
Processing

Keywords

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

Cite this

Liu, W., Weiss, S., & Hanzo, L. (2002). Low-complexity frequency-domain GSC for broadband beamforming. 386-389. Paper presented at 6th International Conference on Signal Processing, Beijing, China. https://doi.org/10.1109/ICOSP.2002.1181071
Liu, Wei ; Weiss, S. ; Hanzo, L. / Low-complexity frequency-domain GSC for broadband beamforming. Paper presented at 6th International Conference on Signal Processing, Beijing, China.4 p.
@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",

}

Liu, W, Weiss, S & Hanzo, L 2002, 'Low-complexity frequency-domain GSC for broadband beamforming' Paper presented at 6th International Conference on Signal Processing, Beijing, China, 26/08/02 - 30/08/02, pp. 386-389. https://doi.org/10.1109/ICOSP.2002.1181071

Low-complexity frequency-domain GSC for broadband beamforming. / Liu, Wei; Weiss, S.; Hanzo, L.

2002. 386-389 Paper presented at 6th International Conference on Signal Processing, Beijing, China.

Research output: Contribution to conferencePaper

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

ER -

Liu W, Weiss S, Hanzo L. Low-complexity frequency-domain GSC for broadband beamforming. 2002. Paper presented at 6th International Conference on Signal Processing, Beijing, China. https://doi.org/10.1109/ICOSP.2002.1181071