By Topic

An algorithm transformation approach to CORDIC based parallel singular value decompositions architectures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jun Ma ; Dept. of Electr. & Comput. Eng., Minnesota Univ., Minneapolis, MN, USA ; Parhi, K.K. ; Deprettere, E.F.

Singular value decomposition (SVD) has become a standard linear algebra tool in modern digital signal processing. CORDIC based SVD algorithms are among the most popular SVD algorithms which exhibit good numerical properties. The speed of the sequential algorithms is however limited by the recursive feedback loops in the underlying signal flow graph. The critical loop computation time is proportional to the size of the problem which prohibits pipelined processing. This paper addresses the derivation of parallel architectures for SVD updating algorithms. An algorithm transformation approach based on re-timing and matrix associativity is presented to drive parallel SVD updating architectures. These architectures have critical loop computation time independent of the problem size and are suitable for CORDIC arithmetic based VLSI implementations.

Published in:

Signals, Systems, and Computers, 1999. Conference Record of the Thirty-Third Asilomar Conference on  (Volume:2 )

Date of Conference:

24-27 Oct. 1999