Show simple item record

dc.contributor.authorDam, Hai
dc.contributor.authorNordholm, Sven
dc.date.accessioned2017-01-30T14:28:21Z
dc.date.available2017-01-30T14:28:21Z
dc.date.created2014-01-23T20:00:50Z
dc.date.issued2013
dc.identifier.citationDam, Hai Huyen and Nordholm, Sven. 2013. Design of robust broadband beamformers with discrete coefficients and least squared criterion. IEEE Transactions on Circuits and Systems II: Express Briefs. 60 (12): pp. 897-901.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/38942
dc.identifier.doi10.1109/TCSII.2013.2285971
dc.description.abstract

This brief investigates the performance of robust and nonrobust broadband beamformers with least squares and discrete coefficients to achieve low complexity and efficient hardware implementation. The broadband beamformer coefficients are expressed as the sum of power-of-two terms with a restriction on the total number of power-of-two terms for the beamformer coefficients. An iterative algorithm is employed to reduce the number of nonzero coefficients and, thereby, multipliers in both the robust and nonrobust beamformers. A quantization scheme in combination with a random search is then applied to efficiently distribute the power-of-two terms for the beamformer coefficients. Design examples show that the number of nonzero coefficients for the beamformers can be significantly reduced without a significant degradation in the integral squared error. In addition, robust beamformers are shown to be less sensitive to nonzero coefficient reduction and quantization than nonrobust beamformers. This brief investigates the performance of robust and nonrobust broadband beamformers with least squares and discrete coefficients to achieve low complexity and efficient hardware implementation. The broadband beamformer coefficients are expressed as the sum of power-of-two terms with a restriction on the total number of power-of-two terms for the beamformer coefficients. An iterative algorithm is employed to reduce the number of nonzero coefficients and, thereby, multipliers in both the robust and nonrobust beamformers. A quantization scheme in combination with a random search is then applied to efficiently distribute the power-of-two terms for the beamformer coefficients.Design examples show that the number of nonzero coefficients for the beamformers can be significantly reduced without a significant degradation in the integral squared error. In addition, robust beamformers are shown to be less sensitive to nonzero coefficient reduction and quantization than nonrobust beamformers.

dc.publisherIEEE Circuits and Systems Society
dc.subjectrobust
dc.subjectdiscrete coefficients
dc.subjectBroadband beamformer design
dc.titleDesign of robust broadband beamformers with discrete coefficients and least squared criterion
dc.typeJournal Article
dcterms.source.volume60
dcterms.source.number12
dcterms.source.startPage897
dcterms.source.endPage901
dcterms.source.issn1549-7747
dcterms.source.titleIEEE Transactions on Circuits and Systems II: Express Briefs
curtin.note

Copyright © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

curtin.department
curtin.accessStatusOpen access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record