### Abstract

In this paper, the linearly constrained minimum variance (LCMV) beamforming problem is formulated in the frequency domain based on the time-domain formulation of the cost function and the constraints. We then derive a frequency-domain constrained adaptive broadband beam-forming algorithm, which has a much lower computational complexity than the time-domain algorithm, although it suffers from a slower convergence speed, as shown by simulations. It is however an attractive option when the implementation of the time-domain algorithm is prohibitive due to large computational complexity. An alternative implementation of this constrained frequency-domain algorithm using the generalised sidelobe canceller (GSC) structure is also studied.

Original language | English |
---|---|

Title of host publication | Sensor Array and Multichannel Signal Processing Workshop Proceedings, 2004 |

Publisher | IEEE |

Pages | 94-98 |

Number of pages | 5 |

ISBN (Print) | 0-7803-8545-4 |

DOIs | |

Publication status | Published - 2004 |

Event | Third IEEE Sensor Array and Multidimensional Signal Processing Workshop - Barcelona, Spain Duration: 18 Jul 2004 → 21 Jul 2004 |

### Conference

Conference | Third IEEE Sensor Array and Multidimensional Signal Processing Workshop |
---|---|

Country | Spain |

City | Barcelona |

Period | 18/07/04 → 21/07/04 |

### Keywords

- adaptive algorithm
- adaptive signal processing
- array signal processing
- computational complexity

## Fingerprint Dive into the research topics of 'Constrained adaptive broadband beamforming algorithm in frequency domain'. Together they form a unique fingerprint.

## Cite this

Liu, W., Koh, C. L., & Weiss, S. (2004). Constrained adaptive broadband beamforming algorithm in frequency domain. In

*Sensor Array and Multichannel Signal Processing Workshop Proceedings, 2004*(pp. 94-98). IEEE. https://doi.org/10.1109/SAM.2004.1502915