Share Email Print
cover

Proceedings Paper

Jacobi method for signal subspace computation
Author(s): Steffen Paul; Juergen Goetze
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The Jacobi method for singular value decomposition is well-suited for parallel architectures. Its application to signal subspace computations is well known. Basically the subspace spanned by singular vectors of large singular values are separated from subspace spanned by those of small singular values. The Jacobi algorithm computes the singular values and the corresponding vectors in random order. This requires sorting the result after convergence of the algorithm to select the signal subspace. A modification of the Jacobi method based on a linear objective function merges the sorting into the SVD-algorithm at little extra cost. In fact, the complexity of the diagonal processor cells in a triangular array get slightly larger. In this paper we present these extensions, in particular the modified algorithm for computing the rotation angles and give an example of its usefulness for subspace separation.

Paper Details

Date Published: 24 October 1997
PDF: 9 pages
Proc. SPIE 3162, Advanced Signal Processing: Algorithms, Architectures, and Implementations VII, (24 October 1997); doi: 10.1117/12.279499
Show Author Affiliations
Steffen Paul, Technical Univ. Munich (Germany)
Juergen Goetze, Univ. of Dortmund (Germany)


Published in SPIE Proceedings Vol. 3162:
Advanced Signal Processing: Algorithms, Architectures, and Implementations VII
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top