Redundant CORDIC Methods with a Constant Scale Factor for Sine and Cosine Computation
IEEE Transactions on Computers
Elementary functions: algorithms and implementation
Elementary functions: algorithms and implementation
High Performance Rotation Architectures Based on the Radix-4 CORDIC Algorithm
IEEE Transactions on Computers
The CORDIC Algorithm: New Results for Fast VLSI Implementation
IEEE Transactions on Computers
Fast Hardware-Based Algorithms for Elementary Function Computations Using Rectangular Multipliers
IEEE Transactions on Computers
Very-High Radix Division with Prescaling and Selection by Rounding
IEEE Transactions on Computers
High Radix Cordic Rotation Based on Selection by Rounding
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Very-high radix combined division and square root with prescaling and selection by rounding
ARITH '95 Proceedings of the 12th Symposium on Computer Arithmetic
Complex Logarithmic Number System Arithmetic Using High-Radix Redundant CORDIC Algorithms
ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
Very-High Radix Circular CORDIC: Vectoring and Unified Rotation/Vectoring
IEEE Transactions on Computers - Special issue on computer arithmetic
Fast CORDIC Algorithm Based on a New Recoding Scheme for Rotation Angles and Variable Scale Factors
Journal of VLSI Signal Processing Systems
High-Radix Logarithm with Selection by Rounding: Algorithm and Implementation
Journal of VLSI Signal Processing Systems
Hi-index | 0.00 |
A very-high radix algorithm and implementation for CORDIC rotation in circular and hyperbolic coordinates is presented. The selection function consists of rounding the residual. It is shown that this assures convergence from the second iteration on. For the first iteration, the selection is done by table, using a lower radix than for the remaining iterations. The compensation of the variable scale factor is done by computing the logarithm of the scale factor and performing the compensation by an exponential. Estimations of the delay for 32-bit and 64-bit precision show a substantial speed up when compared to low radix implementations. The proposed algorithm is also compared with previously proposed very-high radix ones, and significant advantages are identified.