Recursive algorithm for the calculation of the adaptive Kalman filter weighting coefficients

The optimal discrete adaptive Kalman filter, as presented by Magill, necessitates the iterative calculation of a weighting coefficient for each value of the quantized parameter space. This correspondence proposes a new recursive algorithm for the calculation of the weighting coefficients and compares it to the weighting coefficient algorithm of Magill. When there are
L
elements in the a priori known parameter space, it is shown that the memory and computational savings include 1)
L
memory allocations, 2)
L
scalar additions per iteration, and 3)
L
scalar multiplications per iteration.