Very-High Radix CORDIC Vectoring with Scalings and Selection by Rounding

Authors:
Elisardo Antelo;Tomas Lang;Javier D. Bruguera
Affiliations:
-;-;-
Venue:
ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
Year:
1999

Citing 0
Cited 5

Very-High Radix Circular CORDIC: Vectoring and Unified Rotation/Vectoring

IEEE Transactions on Computers - Special issue on computer arithmetic
Algorithm and Architecture for Logarithm, Exponential, and Powering Computation

IEEE Transactions on Computers
A Gaussian Noise Generator for Hardware-Based Simulations

IEEE Transactions on Computers
High-Radix Logarithm with Selection by Rounding: Algorithm and Implementation

Journal of VLSI Signal Processing Systems
Perception SoC based on an ultrasonic array of sensors: efficient DSP core implementation and subsequent experimental results

EURASIP Journal on Applied Signal Processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

A very-high radix algorithm and implementation for circular CORDIC in vectoring mode is presented. As for division, to simplify the selection function, the operands are pre-scaled. However, in the CORDIC algorithm the coordinate x varies during the execution so several scalings might be needed; we show that two scalings are sufficient. Moreover, the compensation of the variable scale factor is done by computing the logarithm of the scale factor and performing the compensation by an exponential. Estimations of the delay for 32-bit precision show a speed up of about two with respect to the radix-4 case with redundant addition. This speed up is obtained at the cost of an increase in the hardware complexity, which is moderate for the pipelined implementation.