Design of broadband beamformers with low complexity
dc.contributor.author | Feng, Zhi | |
dc.contributor.author | Yiu, Ka Fai | |
dc.contributor.author | Teo, Kok Lay | |
dc.contributor.author | Nordholm, Sven | |
dc.date.accessioned | 2017-01-30T13:39:54Z | |
dc.date.available | 2017-01-30T13:39:54Z | |
dc.date.created | 2013-03-05T20:00:33Z | |
dc.date.issued | 2012 | |
dc.identifier.citation | Feng, Zhiguo and Yiu, Cedric Ka Fai and Teo, Kok Lay and Nordholm, Sven. 2012. Design of broadband beamformers with low complexity. EURASIP Journal on Advances in Signal Processing. 2012:62. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/33863 | |
dc.identifier.doi | 10.1186/1687-6180-2012-62 | |
dc.description.abstract |
In this article, we consider the design of broadband beamformers with low complexity. In fact, the design problem is multi-objective in nature, trading off between speech distortion and noise suppression. Finding a balance between these two objectives is important in order to achieve a desired sound quality. These measures are introduced as the objectives here. The design can then be obtained via a bi-objective integer programming problem, where the coefficients of the filters are expressed as sums of signed powers-of-two terms. We study two different integer spaces and penalty functions for solving the problem. Then, an algorithm based on a discrete filled function is developed for finding the optimal design. In order to illustrate the effectiveness of the algorithm, real data is used and two broadband beamformers are demonstrated. | |
dc.publisher | SpringerOpen | |
dc.title | Design of broadband beamformers with low complexity | |
dc.type | Journal Article | |
dcterms.source.startPage | 1 | |
dcterms.source.endPage | 11 | |
dcterms.source.issn | 1687-6180 | |
dcterms.source.title | EURASIP Journal on Advances in Signal Processing | |
curtin.note |
This article is published under the Open Access publishing model and distributed under the terms of the Creative Commons Attribution License | |
curtin.department | ||
curtin.accessStatus | Open access |