On-Line CORDIC For Generalized Singular Value Decomposition(GSVD)

An on-line CORDIC implementation for computing the Generalized Singular Value Decomposition is presented. Among several algorithms, the implementation shown is based on Luk's parallel version for a triangular processor array, using odd-even ordering. To implement GSVD, the CORDIC approach is attractive compared with using conventional arithmetic units, such as square root, divider and multiplier. However, the CORDIC module is relatively slow because of the requirement of full precision computation to determine the direction of the angle and the variable shifter in the basic step. To avoid this, the use of redundant and on-line CORDIC has been proposed previously for SVD and matrix triangularization. This results in a significant speedup at some additional cost because of the variable scaling factor introduced. The extension of on-line CORDIC approach to the GSVD is presented. The advantages of this approach are more significant in GSVD because of the longer sequence of dependent operations. This makes the combination of the short step time of on-line CORDIC and the overlapping capability of on-line very attractive. By comparing it with conventional approach as well as CORDIC approach with full precision computation, we show that a speedup of about 5 can be achieved.

[1]  J.-M. Delosme,et al.  VLSI implementation of rotations in pseudo-Euclidean spaces , 1983, ICASSP.

[2]  Franklin T. Luk,et al.  A parallel method for computing the generalized singular value decomposition , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

[3]  M. Saunders,et al.  Towards a Generalized Singular Value Decomposition , 1981 .

[4]  Franklin T. Luk,et al.  Computation Of The Generalized Singular Value Decomposition Using Mesh-Connected Processors , 1983, Optics & Photonics.

[5]  Christopher C. Paige,et al.  The general linear model and the generalized singular value decomposition , 1985 .

[6]  Yu Hen Hu,et al.  Doubly pipelined Cordic array for digital signal processing algorithms , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[7]  G. Stewart A method for computing the generalized singular value decomposition , 1983 .

[8]  C. Loan Generalizing the Singular Value Decomposition , 1976 .

[9]  Milos D. Ercegovac,et al.  An on-line square rooting algorithm , 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).

[10]  Jack E. Volder The CORDIC Trigonometric Computing Technique , 1959, IRE Trans. Electron. Comput..

[11]  Tomás Lang,et al.  Redundant and On-Line CORDIC: Application to Matrix Triangularization and SVD , 1990, IEEE Trans. Computers.

[12]  Joseph R. Cavallaro,et al.  CORDIC arithmetic for an SVD processor , 1987, IEEE Symposium on Computer Arithmetic.

[13]  Milos D. Ercegovac,et al.  An On-Line Square Root Algorithm , 1982, IEEE Transactions on Computers.

[14]  C. Loan Computing the CS and the generalized singular value decompositions , 1985 .

[15]  C. Paige Computing the generalized singular value decomposition , 1986 .

[16]  Charles Van Loan,et al.  Signal Processing Computations Using The Generalized Singular Value Decomposition , 1984, Optics & Photonics.

[17]  R. Brent,et al.  Almost linear-time computation of the singular value decomposition using mesh-connected processors , 1983 .

[18]  S. Walther A unified algorithm for elementary functions , 1899 .