Abstract

The COordinate Rotation DIgital Computer (CORDIC) algorithm is an iterative procedure to evaluate various elementary functions. It usually consists of one scaling multiplication and n+1 elementary shift-add iterations in an n bit processor. These iterations can be paired off to form double iterations to lower the hardware complexity while the computational complexity stays the same. With this structure, the shifter size is reduced to 1/2 (1+9/n+1). In this paper, we present this merged algorithm, its error analysis, and software simulation results.

Keywords:
CORDIC Computer science Algorithm Multiplication (music) Computational complexity theory Rotation (mathematics) Iterative method Software Arithmetic Parallel computing Mathematics Computer hardware Field-programmable gate array

Metrics

22
Cited By
1.70
FWCI (Field Weighted Citation Impact)
7
Refs
0.82
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Numerical Methods and Algorithms
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Digital Filter Design and Implementation
Physical Sciences →  Computer Science →  Signal Processing
Low-power high-performance VLSI design
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

BOOK-CHAPTER

CORDIC Algorithm

Jouko VankkaK. Halonen

Year: 2001 Pages: 23-32
BOOK-CHAPTER

CORDIC Algorithm

Shirshendu Roy

Year: 2023 Pages: 207-225
JOURNAL ARTICLE

Para-CORDIC: Parallel CORDIC Rotation Algorithm

T.-B. JuangShen‐Fu HsiaoMing-Te Tsai

Journal:   IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications Year: 2004 Vol: 51 (8)Pages: 1515-1524
JOURNAL ARTICLE

α-CORDIC: An adaptive CORDIC algorithm

F. El-Guibaly

Journal:   Canadian Journal of Electrical and Computer Engineering Year: 1998 Vol: 23 (3)Pages: 133-138
© 2026 ScienceGate Book Chapters — All rights reserved.