FourierPIM: High-throughput in-memory Fast Fourier Transform and polynomial multiplication

FourierPIM: High-throughput in-memory Fast Fourier Transform and polynomial multiplication

The Discrete Fourier Transform (DFT) is essential for various applications ranging from signal processing to convolution and polynomial multiplication. The groundbreaking Fast Fourier Transform (FFT) algorithm reduces DFT time complexity from the naive O(n2)to O(nlogn), and recent works have sought...

Full description

Bibliographic Details
Main Authors: Orian Leitersdorf, Yahav Boneh, Gonen Gazit, Ronny Ronen, Shahar Kvatinsky
Format: Article
Language:English
Published: Elsevier 2023-07-01
Series:Memories - Materials, Devices, Circuits and Systems
Subjects:
Processing-in-memory
Stateful logic
Fast Fourier Transform
Online Access:http://www.sciencedirect.com/science/article/pii/S2773064623000117

Internet

http://www.sciencedirect.com/science/article/pii/S2773064623000117

Similar Items