Related Experiment Video
Updated: Jul 9, 2025

Computational Modeling of Retinal Neurons for Visual Prosthesis Research - Fundamental Approaches
Published on: June 21, 2022
Radix-4 CORDIC algorithm based low-latency and hardware efficient VLSI architecture for Nth root and Nth power
Ankur Changela1, Yogesh Kumar2, Marcin Woźniak3
1Department of Information and Communication Technology, School of Technology, Pandit Deendayal Energy University, Gandhinagar, Gujarat, India.
A novel radix-4 hyperbolic COordinate Rotion DIgital Computer (CORDIC) architecture offers reduced hardware utilization and improved error performance for fixed-point root and power computations compared to radix-2 methods.
Area of Science:
- Digital Signal Processing
- VLSI Architecture Design
- Computer Arithmetic
Background:
- Existing methods for fixed-point root and power computation often rely on radix-2 COordinate Rotion DIgital Computer (CORDIC) algorithms.
- Radix-2 CORDIC algorithms suffer from high computation latency, posing a challenge for efficient hardware implementation.
- The complexity of radix-4 CORDIC, while offering faster convergence, is a barrier due to intricate logic and scale factor management.
Purpose of the Study:
- To propose a low-complexity VLSI architecture for computing the root and power of fixed-point numbers using a radix-4 hyperbolic CORDIC.
- To address the hardware complexity and computational challenges associated with radix-4 CORDIC algorithms.
- To improve hardware utilization and error performance compared to existing radix-2 CORDIC-based approaches.
Main Methods:
- A modified radix-4 hyperbolic vectoring (R4HV) CORDIC is used for logarithm computation with simplified input-dependent rotation criteria.
- Radix-4 linear vectoring (R4LV) CORDIC is employed for division operations.
- A modified scaling-free radix-4 hyperbolic rotation (R4HR) CORDIC is utilized for exponential computation, with pre-computed scale factors and scaling-free rotations.
Main Results:
- The proposed modified R4HV CORDIC simplifies angle selection criteria, reducing hardware complexity.
- The R4HR CORDIC achieves reduced complexity by pre-computing scale factors and using scaling-free rotations.
- Hardware analysis indicates superior hardware utilization compared to recent methods, with FPGA implementation showing a 20% reduction in hardware usage and better error performance.
Conclusions:
- The proposed low-complexity VLSI architecture based on modified radix-4 hyperbolic CORDIC effectively computes root and power functions for fixed-point numbers.
- The architectural modifications significantly reduce hardware complexity and improve performance metrics.
- The implemented Virtex-6 FPGA solution demonstrates practical advantages in terms of hardware efficiency and accuracy over radix-2 CORDIC methods.
Related Concept Videos
Node Analysis for AC Circuits
To unravel the complexities of this system, nodal analysis is employed, a powerful technique founded on Kirchhoff's current law (KCL), which remains valid for phasors. AC circuits can effectively be...
Nodal Analysis
Consider, for instance, a simple circuit composed of three nodes and three resistors, as shown in...
Phasor Arithmetics
When the derivative of a sinusoid is taken in the time domain, it transforms into its corresponding phasor multiplied by j-omega (jω) in the phasor domain, where j is the imaginary unit, and ω is the angular...
Properties of the Root Locus
To determine if a point lies on the root locus, the criterion involves the sum of angles contributed by all poles and zeros to that point. Specifically, this sum must be an odd multiple of 180 degrees. The gain at any point on...
Construction of Root Locus
For positive gain values, the root locus exists on the real axis to the left of an odd number of finite open-loop poles or zeros. The root locus starts at the open-loop poles and traces the paths of the closed-loop poles as the gain...
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...

