On-line CORDIC algorithms

H. Lin, H.J. Sips
Proceedings of 9th Symposium on Computer Arithmetic  
The CORDIC algorithms provide in a fast way the calculations of a number of arithmetic basic functions. A CORDIC calculation takes O(n) steps for a function, where n is the word length of the operands. The speed is limited by the cany propagation in the adders and the U0 throughput. Speed can be improved by introducing redundancy in the calculation circuitry and U0 throughput by doing U 0 transfers while calculating. The latter is characteristic for the class of so called on-line arithmetic. At
more » ... line arithmetic. At the same time the pin requirements are limited to a single digit per operand. This paper introduces a number of new algorithms to make an on-line CORDIC implementation.
doi:10.1109/arith.1989.72806 dblp:conf/arith/LinS89 fatcat:o5vr5iav25hk3atwd57qwz2s4e