Design of Low Complexity Robust Broadband Beamformers with Least Squared Performance Criterion
MetadataShow full item record
This paper investigates the design of low complexity, non-robust and robust broadband beamformers with least squared criterion. An iterative algorithm is proposed to reduce the number of non-zero coefficients in both the non-robust and robust beamformers to reduce the computational complexity. 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, the robust beamformer is less sensitive to non-zero coefficient reduction than the non-robust beamformer. In particular, the number of non-zero coefficients for the robust beamformer can be reduced by up to 74% with only a small reduction of 1.34dB in the integral squared error.
Showing items related by title, author, creator and subject.
Dam, Hai; Nordholm, Sven (2013)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 ...
Adaptive antenna array beamforming using a concatenation of recursive least square and least mean square algorithmsSrar, Jalal Abdulsayed (2011)In recent years, adaptive or smart antennas have become a key component for various wireless applications, such as radar, sonar and cellular mobile communications including worldwide interoperability for microwave ...
Dam, Hai; Rimantho, D.; Nordholm, Sven (2013)This paper extends the design of frequency invariant beamformer by incorporating robustness in the design formulation to cater for array element mismatches and other non-ideal characteristics. In this approach, a 2-norm ...