Finite word length effects on array processing algorithms
E. Long, J. Schumpert · 2005
Finite word length effects on the performance of several array processing/beam forming algorithms are considered for bearing estimation criterion based on minimum mean square error linear prediction, maximum likelihood, and eigenvector analysis. Algorithms are evaluated via computer simulations which represent quantized input signals and (some of) the arithmetic operations by various word lengths. Adaptive and non-adaptive algorithms were studied and trade-offs were established between word lengths, convergence rates, averaging times and beam patterns.