A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
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. Atdoi:10.1109/arith.1989.72806 dblp:conf/arith/LinS89 fatcat:o5vr5iav25hk3atwd57qwz2s4e