Computer architecture and organization; (2nd ed.)
Computer architecture and organization; (2nd ed.)
Signal processing algorithms and architectures
Signal processing algorithms and architectures
A Novel Implementation of CORDIC Algorithm Using Backward Angle Recoding (BAR)
IEEE Transactions on Computers
High Performance Rotation Architectures Based on the Radix-4 CORDIC Algorithm
IEEE Transactions on Computers
A survey of CORDIC algorithms for FPGA based computers
FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays
Fast CORDIC Algorithm Based on a New Recoding Scheme for Rotation Angles and Variable Scale Factors
Journal of VLSI Signal Processing Systems
High-SFDR and multiplierless direct digital frequency synthesizer
IMCAS'09 Proceedings of the 8th WSEAS international conference on Instrumentation, measurement, circuits and systems
High-SFDR and multiplierless direct digital frequency synthesizer
WSEAS Transactions on Circuits and Systems
50 years of CORDIC: algorithms, architectures, and applications
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Performance of the CORDIC algorithm in I-Q modulators
CSN '07 Proceedings of the Sixth IASTED International Conference on Communication Systems and Networks
Leading One Detection Hyperbolic CORDIC with Enhanced Range of Convergence
Journal of Signal Processing Systems
Area-time efficient scaling-free CORDIC using generalized micro-rotation selection
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
CORDIC designs for fixed angle of rotation
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 14.99 |
The coordinate rotation digital computer (CORDIC), an iterative arithmetic algorithm for computing generalized vector rotations without performing multiplications, is discussed. For applications where the angle of rotation is known in advance, a method to speed up the execution of the CORDIC algorithm by reducing the total number of iterations is presented. This is accomplished by using a technique called angle recoding, which encodes the desired rotation angle as a linear combination of very few elementary rotation angles. Each of these elementary rotation angles takes one CORDIC iteration to compute. The fewer the number of elementary rotation angles, the fewer the number of iterations are required. A greedy algorithm which takes only O(n/sup 2/) operations is developed to perform CORDIC angle recoding. It is proven that this algorithm is able to reduce the total number of required elementary rotation angles by at least 50% without affecting the computational accuracy.