In a previous post (here), we looked at using CORDIC (Co-ordinate Rotation by DIgital Computer) for understanding how a complex number 
can be rotated by an angle 
without using actual multipliers. Let us know try to understand how we can use CORDIC for finding the phase and magnitude of a complex number.
Basics
The CORDIC algorithm is built on successively multiplying the complex number , by 
. As can be noticed, as the elements of 
can be represented in powers of 2, the multiplication can be achieved by using the appropriate ‘bit shift’. For further details, please refer to the previous post (CORDIC for phase rotation).
Continue reading “Using CORDIC for phase and magnitude computation”
