In this paper, we present a full precision floating-point Cordic algorithm and a correponding word-serial Cordic architecture. The extension to existing block floating-point Cordic algorithms is in a floating-point representation for the angle. The angle is represented as a combination of exponent, micro-rotation bits and two bits to indicate prerotations over 2 and radians.

This paper describes the application of the CORDIC Algorithm’s to find the coordinates of the satellite in the x-y plane. The mathematical and analytical approach for the CORDIC algorithm implementation is presented here which shows that CORDIC algorithm revolves around the idea of "rotating" the phase of a complex number, by multiplying it by a succession of constant values.

In this paper, the complete error analysis of the conventional CORDIC (COordinate Rotation DIgital Computer) algorithm and the CORDIC with expanded convergence range is presented. All the computational error consisting of the approximation error and truncation error in both the rotation mode and vectoring mode has been derived systematically. It has been shown that the computation errors of COR...

Duprat and Muller [1] introduced the ingenious “Branching CORDIC” algorithm. It enables a fast implementation of CORDIC algorithm using signed digits and requires a constant normalization factor. The speedup is achieved by performing two basic CORDIC rotations in parallel in two separate modules. In their method, both modules perform identical computation except when the algorithm is in a “bran...

In this work we present a new CORDIC algorithm for the vectoring mode, based on the use of radix-4, preserving a complexity in the microrotations that is similar to that of the conventional radix-2 CORDIC. The use of this radix, together with the inclusion in the CORDIC algorithm of the zero skipping technique, reduces by more than half the number of iterations with respect to the conventional ...

In this paper we compare implementations of Duprat and Muller’s Branching CORDIC and Phatak’s Double Step Branching (DSB)–CORDIC algorithms for Sine and Cosine evaluation. For reference we also report on classical CORDIC implementations for the same wordlengths. We have also implemented Double Stepping in the classical algorithm and report on the performance of this method. CORDIC evaluation of...

With increasing on chip complexities the on chip area is a major concern. Today users desire every gadget to be small enough, particularly the hand held systems. CORDIC is one such algorithm which serves this purpose. CORDIC algorithm has become a widely used approach to elementary function evaluation when silicon area is a primary concern. CORDIC is more economical than DSP algorithms both in ...

A CORDIC based processor array which can be programmed by switch settings to compute the Discrete Hariley, Cosine or Sine lhnsforms or their inverses is described. Through a novel formulation of the transform computations in the CORDIC framework, N-point transforms are mapped on to a linear a m y of [XJ +1 CORDIC processors with minimal control owedead to incorporate the programmability.

Calculation of exponentiation is an essential part of many real life applications such as medical, finance and spatial science etc. In this paper, an FPGA based efficient hardware for calculation of exponentiation with the help of COordinate Rotation DIgital Computer (CORDIC) has been proposed. With the use of CORDIC algorithm accuracy up-to five decimal digits on 32 bits input length has been ...

The LMS algorithm is one of the most successful adaptive filtering algorithms. It uses the instantaneous value of the square of the error signal as an estimate of the mean-square error (MSE). The LMS algorithm changes (adapts) the filter tap weights so that the error signal is minimized in the mean square sense. In Trigonometric LMS (TLMS) and Hyperbolic LMS (HLMS), two new versions of LMS algo...