What is the derivation of cordic's FPGA concept and algorithm?
What is the derivation of cordic's FPGA concept and algorithm? aiming at this problem, this article introduces the corresponding analysis and solution in detail, hoping to help more partners who want to solve this problem to find a more simple and feasible method.
A brief introduction to CORDIC
CORDIC is the abbreviation of Coordinate Rotation Digital Computer, namely coordinate rotation digital operation, which is mainly used to solve the real-time operation problems of trigonometric function, inverse trigonometric function and open operation in navigation system. CORDIC algorithm provides an approximation method of digital computation, and finally decomposes the operation into a series of addition, subtraction and shift operations, so it is very suitable for hardware implementation.
CORDIC algorithm has two modes: rotation and vector, which can be used in circular coordinate system, linear coordinate system and hyperbolic coordinate system respectively.
2. Derivation of rotation mode algorithm
It seems that the Greek alphabet can't be inserted? Then I'll take a screenshot of my notes and ask you to understand.
Since each pseudo rotation results in a change in the vector modulus length, the compensation factor of the I th pseudo rotation mode length is represented by Ki, so the result of the I th pseudo rotation real rotation should be:
When n approaches infinity, An approaches 1.646760258, so that xo=1/An and yo=0 can get the sine and cosine values of the target rotation angle.
This is the answer to the question about the derivation of the FPGA concept and algorithm of cordic. I hope the above content can be of some help to everyone. If you still have a lot of doubts to be solved, you can follow the industry information channel to learn more about it.
