A modiied version of the QR{decomposition (QRD) is presented. It uses approximate Givens rotations instead of exact Givens rotations, i.e., a matrix entry usually annihilated with an exact rotation by an angle is only reduced by using an approximate rotation by an angle ~. The approximation of the rotations is based on the idea of CORDIC. Evaluating a CORDIC{based approximate rotation is to det...

We propose a novel implementation of the discrete cosine transform (DCT) and the inverse DCT (IDCT) algorithms using a CORDIC (Coordinate Rotation DIgital Computer)-based systolic processor array structure. First, we reformulate an :\--point DCT or IDCT aigorithm into a rotation formulation which makes it suitable for CORDIC processor implementation. We then propose to use a pipelined CORDIC pr...

ÐA very-high radix algorithm and implementation for circular CORDIC is presented. We first present in depth the algorithm for the vectoring mode in which the selection of the digits is performed by rounding of the control variable. To assure convergence with this kind of selection, the operands are prescaled. However, in the CORDIC algorithm, the coordinate x varies during the execution so seve...

Many of us who teach calculus and mathematical topics that use calculus have taken for granted that hand-held calculators use Taylor series or a variant to compute transcendental functions. Thus, it was a surprise to learn that this was not the case. The CORDIC method (Coordinate Rotation Digital Computer) was developed by Jack Volder [6] in the late 1950’s. Hewlett-Packard was quick to realize...

In this paper an area efficient Cordic based adaptive algorithm has been designed and simulated for Digital Signal Processing. An adaptive filter is useful whenever the statistics of the input signals to the filter are not known. Many adaptive algorithms like LMS, NLMS and RLS are used for adaptive filtering. An efficient QR decomposition based RLS algorithm is an efficient way to filter out no...