Optimized distributed processing of scaling factor in CORDIC

Abstract

CORDIC is a well known iterative algorithm used to evaluate various transcendental functions. There have been a number of papers describing various ways of speeding up this algorithm. One of the performance bottlenecks of CORDIC is the requirement to multiply the results of the x and y data path by a constant scaling factor. Depending on the architecture, such solutions might not necessarily provide added benefits. In this paper, processing of the scaling factor is applied in a distributed way in order to achieve maximum efficiency for both pipelined and recursive architectures.