While application-specific instruction-set processors (ASIPs) have allowed designers to
create processors with custom instructions to target specific applications, floating-point (FP) …

In the field of digital signal processing, such as in navigation and radar, a significant number
of high-precision arctangent function calculations are required. Lookup tables, polynomial …

This paper presents an 8.4 ps 500 MS/s 4-bit successive approximation register time-to-
digital converter (SAR-TDC). The TDC utilizes both the rising and falling edges of the cyclic …

This brief presents a hybrid structure to effectively compute the variable-length Fourier
transform by employing the recursive and radix-2 2 fast algorithm. After applying a hardware …

Floating-point square root is a fundamental operation in signal processing and various HPC
applications. Since this is an expensive operation in resource and energy consumption, its …

A special function unit, able to compute square root, reciprocal square root, logarithm and
exponential functions is presented in this paper. The system supports single precision IEEE …

Fast Fourier transform (FFT) is an essential algorithm in digital signal processing and
advanced mobile communications. With the continuous development of modern technology …

The Fast Fourier Transformation (FFT), as a high-efficiency algorithm of the Discrete Fourier
Transform (DFT), is widely used in Digital Signal Processing (DSP), wireless communication …

This work explores approximation in CORDIC architectures for CMOS ASIC implementation.
Coarse grain reduction in the number of iterations and bit-width are systematically evaluated …

In this brief, we present a fast algorithm for computing length-q× 2 m discrete Fourier
transforms (DFT). The algorithm divides a DFT of size-N= q× 2 m decimation in frequency …