Paper
28 October 1994 Updating rate of Jacobi singular value decomposition (SVD) arrays and data nonstationarity
Flavio Lorenzelli, Kung Yao
Author Affiliations +
Abstract
An effective updating algorithm for singular value decomposition, based on Jacobi rotations, has recently been proposed. This algorithm is composed of two basic steps: QR updating and rediagonalization. By proper interleaving these two operations, parallel implementations with very high updating rates are possible. In this paper, we are concerned with the behavior of this algorithm for nonstationary data, and the effect of the pipeline rate on tracking accuracy. In order to overcome the trade-off between accuracy and updating rate intrinsic in the original algorithm, we proposed two schemes which improve the overall performance when the rate of change of the data is high. In the `variable rotational rate' scheme, the number of Jacobi rotations per update is dynamically determined. The alternative approach is to make the forgetting factor variable and data-dependent. Behavior and performance of both schemes are discussed and compared.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Flavio Lorenzelli and Kung Yao "Updating rate of Jacobi singular value decomposition (SVD) arrays and data nonstationarity", Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); https://doi.org/10.1117/12.190853
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Signal to noise ratio

Radon

Detection and tracking algorithms

Matrices

Interference (communication)

Error analysis

Algorithm development

RELATED CONTENT


Back to Top