Architecture for CORDIC algorithm realization without ROM lookup tables

This paper proposes an architecture for implementing the CORDIC algorithm. By decomposing an arbitrary rotation angle into a sequence of coarse angles (the tangent value of each of which is a power of 2) and a fine angle which is small enough, this architecture can be implemented by performing a sequence of shift-and-add operations in the radix-2 system without any ROM lookup table or real multiplication requirement. It is suitable to be designed in a pipelined architecture for performing high-speed operations.