作者: S.-F. Hsiao , J.-M. Delosme
DOI: 10.1109/ARITH.1991.145569
关键词:
摘要: A novel n-dimensional (n-D) CORDIC algorithm for Euclidean and pseudo-Euclidean rotations is proposed. This closely related to Householder transformations. It shown converge faster than algorithms developed earlier n=3 4. Processor architectures the are presented. The area time performance of n-D processors evaluated. For a comparable performance, require significantly less parallel processors. Furthermore, arrays speed up QR decomposition rectangular matrices by factor n-1 in comparison with 2-D processor array. >