By Topic

Efficient complex matrix transformations with CORDIC

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
$33 $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

2 Author(s)
N. D. Hemkumar ; Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA ; J. R. Cavallaro

A two-sided unitary transformation (Q transformation) structured to permit integrated evaluation and application using CORDIC primitives is introduced. The Q transformation is shown to be useful as an atomic operation in parallel arrays for computing the eigenvalue/singular value decomposition of Hermitian/arbitrary matrices, and three specific Q transformations that are needed in such arrays are identified. Issues related to the use of CORDIC for complex arithmetic are addressed, and implementations in both conventional (nonredundant) CORDIC and redundant and online modifications to CORDIC are described. If the time to compute a CORDIC operation in nonredundant CORDIC is Tc, the Q transformations identified here can be evaluated and/or applied in 2T c using four CORDIC modules for maximum concurrency. In either case, 0.5 Tc is required to account for scale factor correction. It is shown that a Q transformation can be evaluated and/or applied in ≈10n, where n is the desired bit-precision

Published in:

Computer Arithmetic, 1993. Proceedings., 11th Symposium on

Date of Conference:

29 Jun-2 Jul 1993