This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Double Step Branching CORDIC: A New Algorithm for Fast Sine and Cosine Generation
May 1998 (vol. 47 no. 5)
pp. 587-602

Abstract—Duprat and Muller [1] introduced the ingenious "Branching CORDIC" algorithm. It enables a fast implementation of CORDIC algorithm using signed digits and requires a constant normalization factor. The speedup is achieved by performing two basic CORDIC rotations in parallel in two separate modules. In their method, both modules perform identical computation except when the algorithm is in a "branching" [1]. We have improved the algorithm and show that it is possible to perform two circular mode rotations in a single step, with little additional hardware. In our method, both modules perform distinct computations at each step which leads to a better utilization of the hardware and the possibility of further speedup over the original method. Architectures for VLSI implementation of our algorithm are discussed.

[1] J. Duprat and J.-M Muller,"The CORDIC Algorithm: New Results for Fast VLSI Implemenation," IEEE Trans. Computers, vol. 42, no. 2, pp. 168-178 Feb. 1993.
[2] J.E. Volder, "The CORDIC Trigonometric Computing Technique," IRE Trans. Electronic Computers, vol. 8, pp. 330-334, Sept. 1959.
[3] J.S. Walther, "A Unified Algorithm for Elementary Functions," Proc. 28th Spring Joint Computer Conf., pp. 379-385, 1971.
[4] A.M. Despain, "Fourier Transform Computers Using CORDIC Iterations," IEEE Trans. Computers, vol. 30, no. 10, pp. 993-1,001, Oct. 1981.
[5] S.-F. Hsiao and J.-M. Delosme, "The CORDIC Householder Algorithm," Proc. 10th Symp. Computer Arithmetic, pp. 256-263, 1991.
[6] J.R. Cacallaro and F.T. Luk,"CORDIC Arithmetic for a SVD Processor," J. Parallel and Distributed Computing, vol. 5, pp. 271-290, 1988.
[7] M.D. Ercegovac and T. Lang,"Redundant and On-Line CORDIC: Application to Matrix Triangularisation and SVD," IEEE Trans. Computers, vol. 38, no. 6 pp. 725-740, June 1990.
[8] E. Depettere, P. Dewilde, and R. Udo, "Pipelined CORDIC Architecture for Fast VLSI Filtering and Array Processing," Proc. ICASSP '84, pp. 41.A.6.1-41.A.6.4, 1984.
[9] P. Strobach, "The Square-Root Schur RLS Adaptive Filer," Proc. ICASSP '91, pp. 1,845-1,848,Toronto, May 1991.
[10] M. Terre and M. Bellanger, "Systolic QRD-Based Algorithm for Adaptive Filtering and Its Implementation," Proc. 1993 IEEE Int'l Conf. Acoustics, Speech, and Signal Processing, vol. III, pp. 296-298,Minneapolis, Minn., 1993.
[11] I. Koren, Computer Arithmetic Algorithms.Englewood Cliffs, N.J.: Prentice Hall, 1993.
[12] CORDIC Bibliography site, including tutorials and simulation code, http://research.ivv.nasa.gov/RMPhttp:/devil.ece.utexas.edu .
[13] B. Parhami, "Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations," IEEE Trans. Computers, vol. 39, no. 1, pp. 89-98, Jan. 1990.
[14] D.S. Phatak and I. Koren, "Hybrid Signed-Digit Number Systems: A Unified Framework for Redundant Number Representations with Bounded Carry Propagation Chains," IEEE Trans. Computers, special issue on computer arithmetic, vol. 43, no. 8, pp. 880-891, Aug. 1994. (An unabridged version is available on the web at.)
[15] N. Takagi,T. Asada, and S. Yajima,"Redundant CORDIC Methods with a Constant Scale Factor for Sine and Cosine Computation," IEEE Trans. Computers, vol. 40, no. 9, pp. 989-995, Sept. 1991.
[16] N. Weste and K. Eshraghian, Principles of CMOS VLSI Design, Addison-Wesley, 1994.

Index Terms:
Double step, branching CORDIC, constant scale factor, redundant signed-digit CORDIC.
Citation:
Dhananjay S. Phatak, "Double Step Branching CORDIC: A New Algorithm for Fast Sine and Cosine Generation," IEEE Transactions on Computers, vol. 47, no. 5, pp. 587-602, May 1998, doi:10.1109/12.677251
Usage of this product signifies your acceptance of the Terms of Use.