A low-latency power series approximate computing and architecture for co-calculation of division and square root

D Tian, N Yu, M Xie, J Tang, Z Feng… - … on Circuits and …, 2024 - ieeexplore.ieee.org
The calculation of division and square root is widely used in edge computing related to
image processing, clustering, recognition, and reconstruction, among others. Their common …

Low-latency low-complexity method and architecture for computing arbitrary Nth root of complex numbers

R Wu, H Chen, G He, Y Fu, L Li - IEEE Transactions on Circuits …, 2022 - ieeexplore.ieee.org
This paper presents a new architecture, based on CORDIC and parabolic synthesis
methodology, for computing Nth root of a complex number. The proposed architecture uses …

An Efficient Hardware Implementation for Complex Square Root Calculation Using a PWL Method

Y Wang, X Liang, W Xu, C Han, F Lyu, Y Luo, Y Li - Electronics, 2023 - mdpi.com
In this paper, we propose a methodology for computing the square root of a complex number
based on a piecewise linear (PWL) approximation method. The proposed method relies on …

Low-complexity methodology for complex square-root computation

S Mopuri, A Acharyya - IEEE Transactions on Very Large Scale …, 2017 - ieeexplore.ieee.org
In this brief, we propose a low-complexity methodology to compute a complex square root
using only a circular coordinate rotation digital computer (CORDIC) as opposed to the state …

Design of high-throughput fixed-point complex reciprocal/square-root unit

D Wang, MD Ercegovac… - IEEE Transactions on …, 2010 - ieeexplore.ieee.org
Complex reciprocal and square-root operations are used in many digital signal processing
(DSP) and numerical computations. In particular, high-throughput fixed-point …

Low-complexity and high-speed architecture design methodology for complex square root

S Mopuri, A Acharyya - Circuits, Systems, and Signal Processing, 2021 - Springer
In this paper, we propose a low-complexity and high-speed VLSI architecture design
methodology for complex square root computation using COordinate Rotation DIgital …

Ultralow-Latency VLSI Architecture Based on a Linear Approximation Method for Computing Nth Roots of Floating-Point Numbers

F Lyu, X Xu, Y Wang, Y Luo, Y Wang… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
State-of-the-art approaches that perform root computations based on the COordinate
Rotation Digital Computer (CORDIC) algorithm suffer from high latency in performing …

High-speed double-precision computation of reciprocal, division, square root, and inverse square root

JA Pineiro, JD Bruguera - IEEE Transactions on Computers, 2002 - ieeexplore.ieee.org
A new method for the high-speed computation of double-precision floating-point reciprocal,
division, square root, and inverse square root operations is presented in this paper. This …

Low precision table based complex reciprocal approximation

P Dormiani, MD Ercegovac… - 2009 Conference Record …, 2009 - ieeexplore.ieee.org
A recently proposed complex valued division algorithm designed for efficient hardware
implementations requires a prescaling step by a constant factor. Techniques for obtaining …

Optimizing fast trigonometric functions on modern CPUs

J Shen, B Long, C Huang - 2022 IEEE 24th Int Conf on High …, 2022 - ieeexplore.ieee.org
Traditional math libraries in high performance computing (HPC) are designed with accuracy
as the first priority. With the development of modern hardware processors and the expansion …