Mathematics is a key subject for success in Computer Science and it continues to be a
challenging subject. Use of technology has given rise to a new pedagogy called Flip …

Split-radix fast Fourier transform (SRFFT) is an ideal candidate for the implementation of a
low-power FFT processor, because it has the lowest number of arithmetic operations among …

Abstract Fast Fourier Transform (FFT) is a rudimentary operation in signal processing.
Modern high speed signal processing and communications standards, such as 4G LTE, 5G …

This paper proposes a new method of calculating Discrete Fourier Transform (DFT) for 1-bit
signals sampled by 1-bit samplers based on Field Programmable Gate Array (FPGA), which …

This paper gives a new method to replace the discrete Fourier transform (DFT) for monobit
receivers by using dynamic twiddle factors based on the split-radix fast Fourier transform …

Efficient algorithms have been developed over the past 30 years for computing the forward
and inverse discrete Hartley transforms (DHTs). These are similar to the fast Fourier …

In this brief, we propose a novel method which realizes conflictfree strategy in memory-
based FFT, of which the hardware complexity is simplified, since only a few extra registers …

Discrete Fourier transform (DFT) is used widely in almost all fields of science and
engineering, and is generally calculated using the fast Fourier transform (FFT) algorithm. In …

This paper proposes an optimized design of Discrete Hilbert Transform (DHT) processor
using Complex Binary Number System (CBNS). The conventional implementation of DHT …

This paper reports the architecture of a Network-on-Chip (NoC) based constant geometry
FFT (CGFFT). The twiddle factor complex multiplications have been realized using new …