Abstract
Coordinate Rotation Digital Computer (CORDIC) Algorithms provide an area efficient way to implement complex mathematical functions. This algorithm remains relevant to this day where trigonometric functions are used repetitively. CORDIC algorithms are used in various stages of signal processing applications and robotics. A deep dive into the concept and implementation of three types of the algorithm are presented in this paper. A comparison of three versions of the CORDIC Algorithm, viz. rotation mode-Basic CORDIC, Scale Free CORDIC, and Redundant CORDIC, is made in terms of power, area, and speed. The three algorithms are modeled in Verilog HDL and then implemented with Xilinx Vivado. The performance metrics are compared using Synopsys Design Vision tool.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Volder, J. The CORDIC trigonometric computing technique. IRE Trans. Electron. Comput. EC-8, 330–334 (1959)
Maharatna, K., Banerjee, S., Grass, E., Krstic, M., Troya, A.: Modified virtually scaling-free adaptive CORDIC rotator algorithm and architecture. IEEE Trans. Circuits Syst. Video Technol. 15, 1463–1474 (2005)
Hu, X., Harber, R., Bass, S.: Expanding the range of convergence of the CORDIC algorithm. IEEE Trans. Comput. 40, 13–21 (1991)
Noll, T.: Carry-save arithmetic for high-speed digital signal processing. In: IEEE International Symposium on Circuits and Systems
Avizienis, A.: Signed-digit numbe representations for fast parallel arithmetic. IEEE Trans. Electron. Comput. EC-10, 389–400 (1961)
Atkins, D.: Introduction to the Role of Redundancy in Computer Arithmetic. Computer 8, 74–77 (1975)
Parhami, B.: Generalized signed-digit number systems: a unifying framework for redundant number representations. IEEE Trans. Comput. 39, 89–98 (1990)
Parhami, B.: Carry-free addition of recoded binary signed-digit numbers. IEEE Trans. Comput. 37, 1470–1476 (1988)
Sacks-Davis, R.: Applications of redundant number representations to decimal arithmetic. Comput. J. 25, 471–477 (1982)
Kuninobu, S., Nishiyama, T., Edamatsu, H., Taniguchi, T., Takagi, N.: Design of high speed MOS multiplier and divider using redundant binary representation. In: 1987 IEEE 8th Symposium On Computer Arithmetic (ARITH) (1987)
Jedwab, J., Mitchell, C.: Minimum weight modified signed-digit representations and fast exponentiation. Electron. Lett. 25, 1171 (1989)
Takagi, N., Asada, T., Yajima, S.: Redundant CORDIC methods with a constant scale factor for sine and cosine computation. IEEE Trans. Comput. 40, 989–995 (1991)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Ramani, N., Mondal, S. (2022). A Deep Dive into CORDIC Architectures to Implement Trigonometric Functions. In: Shah, A.P., Dasgupta, S., Darji, A., Tudu, J. (eds) VLSI Design and Test. VDAT 2022. Communications in Computer and Information Science, vol 1687. Springer, Cham. https://doi.org/10.1007/978-3-031-21514-8_45
Download citation
DOI: https://doi.org/10.1007/978-3-031-21514-8_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-21513-1
Online ISBN: 978-3-031-21514-8
eBook Packages: Computer ScienceComputer Science (R0)