Discrete Fourier transform (DFT) implementation requires high computational resources and
time; a computational complexity of order O (N 2) for a signal of size N. Fast Fourier …

Fully Homomorphic Encryption (FHE) is a technique that allows computation on encrypted
data. It has the potential to drastically change privacy considerations in the cloud, but high …

Large language models (LLMs) have garnered significant attention across various research
disciplines, including the wireless communication community. There have been several …

Emerging communication technologies, such as 5G and beyond, have introduced diverse
requirements that demand high performance and energy efficiency at all levels …

Homomorphic encryption (HE) is a type of cryptography that allows computations to be
performed on encrypted data. The technique relies on learning with errors problem, where …

This brief presents a new energy efficient Fast-Fourier Transform (FFT) architecture for real-
valued applications. The proposed architecture decimates the FFT in time domain with bit …

This paper presents new serial butterflies for non-power-of-two (NP2) fast Fourier transform
(FFT) architectures. The paper considers radices 2, 3, 4, and 5, which are used in FFTs for …

Specialized hardware accelerators continue to be a source of performance improvement.
However, such specialization comes at a programming price. The fundamental issue is that …

This article presents a 60-mode high-throughput parallel-processing memory-based fast
Fourier transform (FFT) processor for fifth-generation (5G)/4G applications. The proposed …

This brief presents a new-parallel radix-2 memory-based fast Fourier transform (FFT)
architecture. The aim of this brief is to reduce the number of multiplexers and achieve an …