Application of Newton iteration in fixed-point cubic-root calculation
Ke Wang · Application of Electronic Technique · 2010
The defect of standard Newton iteration used for cubic-root calculation is analyzed.For common 32 bit fixed-point integer,an algorithm based on the combination of modified newton iteration and look-up table is proposed,software and hardware simulation of which is implemented.The simulation results show that errors of this algorithm never exceed 1,which satisfies the requirement of fixed-point cubic-root,and the resources occupied is resonable.Besides,time delay of this algorithm outperforms digit -recurrence algorithm used commonly for square-root calculation.Therefore,it's an effective algorithm for rapid cubic-root calculation.