Fast Convolution Algorithm for Real-Valued Finite Length Sequences
2023pp. 1–5
Citations Over TimeTop 21% of 2023 papers
Abstract
The Fast Fourier Transform (FFT)-based convolution is the most popular fast convolution algorithm. In past work, we developed the Discrete Hirschman Transform (DHT)-based convolution. When compared to the FFT-based convolution, our DHT-based convolution can reduce the computational complexity by a third. Recently, we developed a comprehensive DFT algorithm where every calculation is natively real-valued (RV) dot products. In this paper, we first apply the natively real-valued DFT to linear convolution. We call this method the RV-based convolution. The arithmetic analysis reveals that it efficiently reduces the operation counts. The algorithm is fast regardless of length.
Related Papers
- → The Convolution Theorem Involving Windowed Free Metaplectic Transform(2023)5 cited
- Space-Time Fourier Transform, Convolution and Mustard Convolution(2016)
- → Linear and Cyclic Convolutions(1997)3 cited
- → Evaluate the Convolution Integral and Convolution Sum Use Compact Formula(2011)
- Research on Convolution Algorithm Teaching of the Digital Signal Process(2015)