07-31-2014 05:50 AM
Which core are you referring here?
08-01-2014 01:08 AM - edited 08-01-2014 01:09 AM
We have cores which can do Square root functions only using cordic or Floating point cores and no cores to do the cube root.
11-21-2018 10:10 PM
We can solve the cuberoot problem with using the basic ADD, DIVIDE and SQUARE IPs available in the IP Catalog.
Consider for instance, that you want to find a cuberoot of a number C. Then, use the following equation Iteratively for say 20-50 Iterations and a fairly acceptable value can be computed.
X_(n+1) = (1/3) * [2*X_(n) + (C/(X_(n)^2))] ---
Here X_(n) is the initial guess of the cuberoot. For more information see the following paper:
Below is a simple MatLab Code for computing 3^1/3.
clear all; c=3; z=1.01; for i=1:100 z = (1/3)*((2*z) + (c/(z^2))); end z;