Ultralow-Latency VLSI Architecture Based on a Linear Approximation Method for Computing Nth Roots of Floating-Point Numbers
- 1 December 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 68 (2) , 715-727
Abstract
State-of-the-art approaches that perform root computations based on the COordinate Rotation Digital Computer (CORDIC) algorithm suffer from high latency in performing multiple iterations. Therefore, root computations based on the CORDIC algorithm cannot meet the strict latency requirements of some applications. In this paper, we propose a methodology for performing Nth root computations on floating-point numbers based on the piecewise linear (PWL) approximation method. The proposed method divides an Nth root computation into several subtasks approximated by the PWL algorithm. It determines the widest segments of the subtasks and the smallest fractional width needed to satisfy the predefined maximum relative error Max_Err r . Our design is coded in Verilog HDL and synthesized under TSMC 40 nm CMOS technology. The synthesized results show that our design can reach the highest frequency of 2.703 GHz with an area consumption of 2608.84 μ m 2 and a power consumption of 2.4476 mW. Compared with one stateof-the-art architecture, our design saves 91.60%, 89.84%, and 63.33% of the area, power, and latency @1.89GHz frequency, respectively, while reducing Max_Err r by 57.30%. In addition, it saves 94.52%, 92.68%, and 73.17% of the area, power, and delay @1.89GHz frequency, respectively, and reduces Max_Err r by 1.65% when compared with the other state-of-the-art design.Keywords
Funding Information
- Scientific Research Foundation for the High-Level Talents of Jinling Institute of Technology (jit-b-201907)
- Natural Science Foundation of the Jiangsu Higher Education Institutions of China (SF1017088127469)
This publication has 34 references indexed in Scilit:
- A Low-Error, Cost-Efficient Design Procedure for Evaluating Logarithms to Be Used in a Logarithmic Arithmetic ProcessorIEEE Transactions on Computers, 2015
- Design and implementation of goldschmidts algorithm for floating point division and square root2015
- FPGA implementation of a binary32 floating point cube root2014
- Design and Implementation of Double Precision Floating Point Division and Square Root on FPGAs2006
- Decimal floating-point: algorism for computers2004
- Design issues in radix-4 SRT square root & divide unit2001
- A powering unit for an OpenGL lighting engine2001
- Area and performance tradeoffs in floating-point divide and square-root implementationsACM Computing Surveys, 1996
- Accurate rounding scheme for the Newton-Raphson method using redundant binary representationIEEE Transactions on Computers, 1994
- Expanding the range of convergence of the CORDIC algorithmIEEE Transactions on Computers, 1991