Redundant and On-Line CORDIC: Application to Matrix Triangularization and SVD
IEEE Transactions on Computers
IEEE Transactions on Computers
Redundant CORDIC Methods with a Constant Scale Factor for Sine and Cosine Computation
IEEE Transactions on Computers
Low Latency Time CORDIC Algorithms
IEEE Transactions on Computers - Special issue on computer arithmetic
Constant-Factor Redundant CORDIC for Angle Calculation and Rotation
IEEE Transactions on Computers - Special issue on computer arithmetic
High Performance Rotation Architectures Based on the Radix-4 CORDIC Algorithm
IEEE Transactions on Computers
Double Step Branching CORDIC: A New Algorithm for Fast Sine and Cosine Generation
IEEE Transactions on Computers
Very-High Radix Circular CORDIC: Vectoring and Unified Rotation/Vectoring
IEEE Transactions on Computers - Special issue on computer arithmetic
Very-High Radix CORDIC Rotation Based on Selection by Rounding
Journal of VLSI Signal Processing Systems - special issue on CORDIC
High-Speed CORDIC Based on an Overlapped Architecture and a Novel σ-Prediction Method
Journal of VLSI Signal Processing Systems - special issue on CORDIC
An Angle Recording Method for CORDIC Algorithm Implementation
IEEE Transactions on Computers
The CORDIC Algorithm: New Results for Fast VLSI Implementation
IEEE Transactions on Computers
Redundant and On-Line CORDIC for Unitary Transformations
IEEE Transactions on Computers
IEEE Transactions on Computers
A Radix-4 Redundant Cordic Algorithm with Fast On-Line Variable Scale Factor Compensation
ICASSP '97 Proceedings of the 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97) -Volume 1 - Volume 1
Hi-index | 0.00 |
This work proposes a new rotation mode CORDIC algorithm, which considerably reduces the iteration number. It is achieved by combining several design techniques. Particularly, a new table-lookup recoding scheme for rotation angles and variable scale factors is developed to reduce the iteration numbers for rotation and scale factor compensation. By addressing the MSB parts of the residual rotation angles to a lookup table, two micro rotation angles are retrieved that in combination best matches the MSB parts. We also combine the leading-one bit detection operations for residual rotation angles, to skip unnecessary rotations. The resulting problems of variable scale factors are then solved by our previous fast decomposition and compensation algorithm (C.C. Li and S.G. Chen, in Proceedings of 1996 IEEE International Symposium Circuits and Systems, May 1996, Atlanta, USA, pp. 264–267; C.C. Li and S.G. Chen, in Proceedings of 1997 IEEE International Conference on Acoustic, Speech and Signal Processing, Munich, 1997, Germany, pp. 639–642). To further reduce the iteration number of scale factor compensation, we again apply the mentioned residual recoding technique and the leading-one bit detection scheme to the fast variable scale factor algorithm. Those techniques collectively reduce the iteration number significantly. Simulations show that in average the new design needs only 9.78 iterations to generate results with 22-bit accuracy, including all the iterations for rotations and scale factor compensations. Statistically, the total iteration number is less than n/2 for results with n-bit accuracy. The introduced extra table size is of the same order of magnitude as that for the angle set {tan−1 2−i, i = 0,1,…,n}, required by general CORDIC algorithms. The new recoding scheme can be applied to other elementary function such as division and square-root functions.