Arithmetic for an SVD processor
Journal of Parallel and Distributed Computing - Parallelism in Computer Arithmetic
The algebraic eigenvalue problem
The algebraic eigenvalue problem
SIAM Journal on Scientific and Statistical Computing
IEEE Transactions on Computers
Redundant CORDIC Methods with a Constant Scale Factor for Sine and Cosine Computation
IEEE Transactions on Computers
Bit-level systolic algorithms for real symmetric and Hermitian eigenvalue problems
Journal of VLSI Signal Processing Systems - Special issue: application specific array processors
Constant-Factor Redundant CORDIC for Angle Calculation and Rotation
IEEE Transactions on Computers - Special issue on computer arithmetic
Computational Aspects of VLSI
Low Communication Overhead Jacobi Algorithms for Eigenvalues Computation on Hypercubes
The Journal of Supercomputing
Evaluation of Fast Rotation Methods
Journal of VLSI Signal Processing Systems - special issue on CORDIC
Error Analysis of CORDIC-Based Jacobi Algorithms
IEEE Transactions on Computers
Efficient Implementation of Rotation Operations for High Performance QRD-RLS Filtering
ASAP '97 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
Jacobi Orderings for Multi-Port Hypercubes
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Hardware efficient architectures for eigenvalue computation
Proceedings of the conference on Design, automation and test in Europe: Proceedings
VLSI circuit design concept for parallel iterative algorithms in nanoscale
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Fast dimension reduction for document classification based on imprecise spectrum analysis
Information Sciences: an International Journal
| Hi-index | 14.98 |
A very fast Jacobi-like algorithm for the parallel solution of symmetric eigenvalue problems is proposed. It becomes possible by not focusing on the realization of the Jacobi rotation with a CORDIC processor, but by applying approximate rotations and adjusting them to single steps of the CORDIC algorithm, i.e., only one angle of the CORDIC angle sequence defines the Jacobi rotation in each step. This angle can be determined by some shift, add and compare operations. Although only linear convergence is obtained for the most simple version of the new algorithm, the overall operation count (shifts and adds) decreases dramatically. A slow increase of the number of involved CORDIC angles during the runtime retains quadratic convergence.