DocumentCode :
3431726
Title :
The CORDIC Householder algorithm
Author :
Hsiao, Shen-Fu ; Delosme, Jean-Marc
Author_Institution :
Dept. of Electr. Eng., Yale Univ., New Haven, CT, USA
fYear :
1991
fDate :
26-28 Jun 1991
Firstpage :
256
Lastpage :
263
Abstract :
A novel n-dimensional (n-D) CORDIC algorithm for Euclidean and pseudo-Euclidean rotations is proposed. This algorithm is closely related to Householder transformations. It is shown to converge faster than CORDIC algorithms developed earlier for n=3 and 4. Processor architectures for the algorithm are presented. The area and time performance of n-D CORDIC processors are evaluated. For a comparable time performance, the processors require significantly less area than parallel Householder processors. Furthermore, arrays of n -D Euclidean CORDIC processors are shown to speed up the QR decomposition of rectangular matrices by a factor of n-1 in comparison with a 2-D CORDIC processor array
Keywords :
computational complexity; digital arithmetic; matrix algebra; parallel algorithms; CORDIC Householder algorithm; Euclidean rotations; QR decomposition; n-D CORDIC processors; pseudo-Euclidean rotations; rectangular matrices; Computer architecture; Digital arithmetic; Eigenvalues and eigenfunctions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Arithmetic, 1991. Proceedings., 10th IEEE Symposium on
Conference_Location :
Grenoble
Print_ISBN :
0-8186-9151-4
Type :
conf
DOI :
10.1109/ARITH.1991.145569
Filename :
145569
Link To Document :
بازگشت