Issue No. 04 - April (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.219759
<p>Parallel implementations of the extended square-root covariance filter (ESRCF) for tracking applications are developed. The decoupling technique and special properties used in the tracking Kalman filter (KF) are employed to reduce computational requirements and to increase parallelism. The application of the decoupling technique to the ESRCF results in the time and measurement updates of m decoupled (n/m)-dimensional matrices instead of one coupled n-dimensional matrix, where m denotes the tracking dimension and n denotes the number of state elements. The updates of m decoupled matrices are found to require approximately m fewer processing elements and clock cycles than the updates of one coupled matrix. The transformation of the Kalman gain which accounts for the decoupling is found to be straightforward to implement. The sparse nature of the measurement matrix and the sparse, band nature of the transition matrix are explored to simplify matrix multiplications.</p>
Index Termsextended square-root covariance filter; tracking; tracking Kalman filter; computationalrequirements; parallelism; decoupling technique; Kalman gain; Kalman filters; parallelalgorithms
E. Lee and S. Haykin, "Parallel Implementation of the Extended Square-Root Covariance Filter for Tracking Applications," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 446-457, 1993.