Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
CORDIC
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|Algorithm for computing trigonometric, hyperbolic, logarithmic and exponential functions}} {{redirect|Pseudo-division|polynomial pseudo-division|Pseudo-remainder}} {{use list-defined references|date=January 2022}} {{use dmy dates|date=February 2020|cs1-dates=y}} {{anchor|Differential CORDIC|Branching CORDIC|Compensated CORDIC|Redundant CORDIC|Hybrid CORDIC|Merged CORDIC|All-serial CORDIC|Pipelined CORDIC|hyperbolic mode|modified rotation mode|Generalized Hyperbolic CORDIC|GH CORDIC}} {{Trigonometry}} '''CORDIC''' ('''coordinate rotation digital computer'''), '''Volder's algorithm''', '''Digit-by-digit method''', '''Circular CORDIC''' ([[Jack E. Volder]]),<ref name="Volder_1959_1"/><ref name="Volder_1959_2"/> '''Linear CORDIC''', '''Hyperbolic CORDIC''' (John Stephen Walther),<ref name="Walther_1971"/><ref name="Walther_2000"/> and '''Generalized Hyperbolic CORDIC''' ('''GH CORDIC''') (Yuanyong Luo et al.),<ref name="Luo_2019_TVLSI"/><ref name="Luo_2019_TVLSI_c"/> is a simple and efficient [[algorithm]] to calculate [[trigonometric function]]s, [[hyperbolic function]]s, [[square roots]], [[multiplications]], [[Division (mathematics)|divisions]], and [[Exponentiation|exponentials]] and [[logarithms]] with arbitrary base, typically converging with one digit (or bit) per iteration. CORDIC is therefore also an example of '''digit-by-digit algorithms'''.<!-- however, there are other digit-by-digit algorithms, which are not related to CORDIC, see f.e. http://www.cs.nyu.edu/cs/faculty/overton/book/docs/KahanTalk.pdf --> CORDIC and closely related methods known as '''pseudo-multiplication''' and '''pseudo-division''' or '''factor combining''' are commonly used when no [[hardware multiplier]] is available (e.g. in simple [[microcontroller]]s and [[field-programmable gate array]]s or FPGAs), as the only operations they require are [[addition]], [[subtraction]], [[bitshift]] and [[lookup table]]s. As such, they all belong to the class of [[shift-and-add algorithm]]s. In computer science, CORDIC is often used to implement [[floating-point arithmetic]] when the target platform lacks hardware multiply for cost or space reasons.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)