International Conference on Field Programmable Logic and Applications, 2005.
DOI: 10.1109/fpl.2005.1515779
|View full text |Cite
|
Sign up to set email alerts
|

Efficient fpga implementation of cordic algorithm for circular and linear coordinates

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
1

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 26 publications
(21 citation statements)
references
References 5 publications
0
20
1
Order By: Relevance
“…To show the effectiveness of our NFGs for one-variable functions, we compare our NFGs with a CORDIC shown in [1], which is well known as a standard one-variable NFG for FPGA implementation, in terms of performance. Table 6 shows the results.…”
Section: Fpga Implementation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…To show the effectiveness of our NFGs for one-variable functions, we compare our NFGs with a CORDIC shown in [1], which is well known as a standard one-variable NFG for FPGA implementation, in terms of performance. Table 6 shows the results.…”
Section: Fpga Implementation Resultsmentioning
confidence: 99%
“…By adding 1 to account for the terminal node to this, we have (1). From Lemma A, the number of Mp-monotone increasing functions that can be represented in the lower part is (p + 1) …”
Section: Appendixmentioning
confidence: 99%
“…The simplest and most popular approach to perform Cartesian-topolar coordinate conversion uses the CORDIC algorithm in the so-called vectoring mode [10]. The CORDIC algorithm involves rotation of a vector 'u' on the X-Y plane in circular, linear and hyperbolic coordinate system depending on the function to be evaluated [11]. This is a linear iterative convergence algorithm that performs a rotation iteratively using a series of specific incremental rotation angles selected so that each iteration is performed by shift and add operation.…”
Section: Cordic -The Linear Convergence Algorithm 31 Iterative Equatmentioning
confidence: 99%
“…The CORDIC algorithm involves rotation of a vector v on the X-Y plane in circular, linear and hyperbolic coordinate system depending on the function to be evaluated [9]. This is a linear iterative convergence algorithm that performs a rotation iteratively using a series of specific incremental rotation angles selected so that each iteration is performed by shift and add operation.…”
Section: Iterative Equationsmentioning
confidence: 99%