| Summary: | 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.
|
|---|