Scalable 2×2 rotation processor for singular value...

Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C708S208000

Reexamination Certificate

active

07937425

ABSTRACT:
A two-plane rotation (TPR) approach to Gaussian elimination (Jacobi) is used for computational efficiency in determining rotation parameters. A rotation processor is constructed using the TPR approach to perform singular value decomposition (SVD) on two by two matrices yielding both eigenvalues and left and right eigenvectors. The rotation processor can then be replicated and interconnected to achieve higher dimensioned matrices. For higher dimensional matrices, the rotation processors on the diagonal solve the 2×2 rotation angles, broadcast the results to off-diagonal processors, whereby all processors perform matrix rotations in parallel.

REFERENCES:
patent: 6041340 (2000-03-01), Mintzer
patent: 6864897 (2005-03-01), Brand
patent: 2005/0091298 (2005-04-01), Kalafala et al.
patent: 2006/0106902 (2006-05-01), Howard et al.
patent: 2006/0123363 (2006-06-01), Williams et al.
patent: 2006/0155798 (2006-07-01), Ketchum et al.
patent: 2007/0226287 (2007-09-01), Lin et al.
Liu, Z. et al., “A floating-point CORDIC based SVD processor”, IEEE, 2003, pp. 1-10.
“Singular Value Decomposition (SVD)”, [retrieved on Nov. 19, 2004], Retrieved from the internet <URL:http://kwon3d.com/theory/jkinem/svd.html, pp. 1-3.
Wall, Michael E. et al., “Singular value decomposition and principal component analysis”, [retrieved on Nov. 19, 2004], Retrieved from the internet <URL: http://pubic.lanl.gov/mewall/kluwer2002.html, pp. 1-21.
Ahmedsaid, A. et al., “Improved SVD systolic array and implementation on FPGA”, pp. 1-8.
Haller, B. et al., “Efficient Implementation of Rotation Operations for High Performance QRD-RLS Filtering”, IEEE, 1997, pp. 162-174.
Hekstra, Gerben J. et al., “Fast Rotations: Low-cost arithmetic methods for orthonormal rotation”, IEEE, 1997, pp. 116-125.
Fu, Dengwei et al., “A High-Speed Processor for Digital Sine/Cosine Gernation and Angle Rotation”, IEEE, 1998, pp. 177-181.
Chen, Sau-Gee et al., “A New Efficient Algorithm for Singular Value Decomposition”, IEEE, 1999, pp. V-523-V-526.
Xingjun, Wu et al., “Jacobi-type SVD and its Floating-point Realization Based on Fast Rotations”, IEEE, 2000, pp. 583-586.
Gotze, Jurgen et al., “A CORDIC-Based Jacobi-Like Algorithm for Eigenvalue Computation”, IEEE, 1993, pp. III-296-III299.
Hekstra, Gerben J. et al., “Floating Point CORDIC”, IEEE, 1993, pp. 130-137.
Gotze, Jurgen, “Monitoring the Stage of Diagonalization in Jacobi-Type Methods”, IEEE, 1994, pp. III-441-III-444.
Paul, Steffen et al., “Error Analysis of CORDIC-Based Jacobi Algorithms”, IEEE Transactions on Computers, Jul. 1995, pp. 947-951, vol. 44, No. 7.
Gotze, Jurgen et al., “A Bit Level Algorithm for Subspace Tracking”, Institute of Network Theory and Circuit Design, pp. 352-360.
De Lange, A.A.J. et al., “An Optimal Floating-Point Pipeline CMOS CORDIC Processor Algorithm, Automated Design, Layout and Performance”, IEEE ISCAS, 1988, pp. 2043-2047.
Ercegovac, Milos et al., “Implemenation of Fast Angle Calculation and Rotation Using On-Line CORDIC”, IEEE ISCAS, 1988, pp. 2703-2706.
Cavallaro, Joseph R. et al., “Floating-Point CORDIC for Matrix Computations”, IEEE, 1988, pp. 40-42.
Cavallaro, Joseph R. et al., “VSLI Implementation of a CORDIC SVD Processor”, IEEE, 1989, pp. 256-260.
Ercegovac, Milos D. et al., “Redundant and On-Line CORDIC: Application to Matrix Triangularization and SVD”, IEEE Trasactions on Computers, Jun. 1990, pp. 725-740, vol. 39, No. 6.
Hu, Xiaobo et al., “Expanding the Range of Convergence of the CORDIC Algorithm”, IEEE Transactions on Computers, Jan. 1991, pp. 13-21, vol. 40, No. 1.
Hu, Yu Hen, “The Quantization Effects of the CORDIC Algorithm”, IEEE Transactions on Signal Processing, Apr. 1992, pp. 834-844, vol. 40, No. 4.
Hu, Yu Hen, “CORDIC-Based VLSI Architectures for Digital Signal Processing”, IEEE Signal Processing, Jul. 1992, pp. 16-35.
Delosme, Jean-Marc, “Bit-Level Systolic Algorithm for the Symetric Eigenvalue Problem”, IEEE, 1990, pp. 770-781.
Hemkumar, Nariankadu D. et al., “CAPE—VLSI Implementation of a Systolic Processor Array: Architecture, Design and Testing”, IEEE, 1991, pp. 64-69.
Rader, C. M., “MUSE—A Systolic Array for Adaptive Nulling with 64 Degrees of Freedom, using Givens Transformations and Wafer Scale Integration”, IEEE, 1992, pp. 277-291.
Hemkumar, Nariankadu D. et al., “A Systolic VLSI Architecture for Complex SVD”, IEEE, 1992, pp. 1061-1064.
Gotze, Jurgen et al., “An Efficient Jacobi-like Algorithm for Parallel Eigenvalue Computation”, IEEE Transactions on Computers, Sep. 1993, pp. 1058-1065, vol. 42, No. 9.
Hemkumar, Nariankadu D. et al., “Redundant and On-Line CORDIC for Unitary Transformations”, IEEE Transactions on Computers, Aug. 1994, pp. 941-954, vol. 43, No. 8.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Scalable 2&#xd7;2 rotation processor for singular value... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Scalable 2&#xd7;2 rotation processor for singular value..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable 2&#xd7;2 rotation processor for singular value... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2626656

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.