
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
N. Takagi, T. Asada, S. Yajima, "Redundant CORDIC Methods with a Constant Scale Factor for Sine and Cosine Computation," IEEE Transactions on Computers, vol. 40, no. 9, pp. 989995, September, 1991.  
BibTex  x  
@article{ 10.1109/12.83660, author = {N. Takagi and T. Asada and S. Yajima}, title = {Redundant CORDIC Methods with a Constant Scale Factor for Sine and Cosine Computation}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {9}, issn = {00189340}, year = {1991}, pages = {989995}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.83660}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Redundant CORDIC Methods with a Constant Scale Factor for Sine and Cosine Computation IS  9 SN  00189340 SP989 EP995 EPD  989995 A1  N. Takagi, A1  T. Asada, A1  S. Yajima, PY  1991 KW  sine computation; CORDIC methods; constant scale factor; coordinate rotation digital computer; cosine computation; redundant binary number representation; digital arithmetic; redundancy. VL  40 JA  IEEE Transactions on Computers ER   
Proposes two redundant CORDIC (coordinate rotation digital computer) methods with a constant scale factor for sine and cosine computation, called the double rotation method and the correcting rotation method. In both methods, the CORDIC is accelerated by the use of a redundant binary number representation, as in the previously proposed redundant CORDIC. In the proposed methods, since the number of rotationextensions performed for each angle is a constant, the scale factor is a constant independent of the operand. Hence, one does not need to calculate the scale factor during the computation, and can make a more efficient sine and cosine generator than that based on the previous redundant CORDIC.
[1] J. Volder, "The CORDIC trigonometric computing technique,"IRE Trans. Electron. Comput., vol. EC8, pp. 330334, Sept. 1959.
[2] J. S. Walther, "A unified algorithm for elementary functions," inProc. AFIPS Spring Joint Comput. Conf., 1971, pp. 379385.
[3] G. L. Haviland and A. A. Tuszynsky, "A CORDIC arithmetic processor chip,"IEEE Trans. Comput., vol. C29, pp. 6879, Feb. 1980.
[4] H. M. Ahmed, J. M. Delosme, and M. Morf, "Highly concurrent computing structures for matrix arithmetic and signal processing,"IEEE Comput. Mag., vol. 15, no. 1, pp. 6582, Jan. 1982.
[5] J. R. Cavallaro and F. T. Luk, "CORDIC arithmetic for an SVD processor," inProc. 8th Symp. Comput. Arithmetic, May 1987, pp. 113120.
[6] M. D. Ercegovac and T. Lang, "Redundant and online CORDIC: Application to matrix triangulation and SVD," UCLA Comput. Sci. Dep. Rep., CSD870046 Sep. 1987.
[7] M. D. Ercegovac and T. Lang, "Fast cosine/sine implementation using online CORDIC," inProc. 21st Asilomar Conf. Signals, Syst., Comput., 1987.
[8] N. Takagi, T. Asada, and S. Yajima, "A hardware algorithm for computing sine and cosine using redundant binary representation,"Trans. IECE Japan, vol. J69D, no. 6, pp. 841847, June 1986 (in Japanese). English translated version is available inSystems and Computersin Japan, vol. 18, no. 8, pp. 19, Aug. 1987.
[9] T. Asada, N. Takagi, and S. Yajima, "Acceleration of a hardware algorithm for calculating sine and cosine using redundant binary representation," inIEICE Japan, Nat. Convention Rec., part 2, Mar. 1987, pp. 408409 (in Japanese).
[10] A. Avizienis, "Signeddigit number representations for fast parallel arithmetic,"IRE Trans. Electron. Comput., vol. EC10, pp. 389400, Sept. 1961.
[11] C. Y. Chow and J. E. Robertson, "Logical design of a redundant binary adder," inProc. 4th Symp. Comput. Arithmetic, Oct. 1978, pp. 109115.
[12] T. Asada, N. Takagi, and S. Yajima, "Algorithms based on CORDIC for calculating hyperbolic functions using redundant binary representation," inProc. 34th Nat. Convention IPS Japan, Mar. 1987, pp. 3334 (in Japanese).