4 accepted papers
Efficient computation of the Discrete Fourier Transform (DFT) for signals with structured frequency support remains a significant challenge in signal processing. The traditional Fast Fourier Transform (FFT) algorithm achieves O(NlogN) complexity, but substantial improvements are possible for signals…
In this paper, we investigate the intriguing connection between the Discrete Cosine Transform (DCT) and integral graphs, contributing to the field of signal processing on graphs. Throughout our investigation, we discover two types of novel integral graphs based on DCT. The first type emerges as a re…
In this paper, we present a novel operator designed to handle the shifting of multiple periodic signals. By exploiting the unique properties of the companion matrix and the elegant structure of cyclotomic polynomials, we have developed an efficient and versatile tool for signal processing applicatio…
We investigate the reconstruction of a binary image from its sparse 2D discrete Fourier transform (2D-DFT) coefficients. Specifically, we focus on the case where the image height is equal to its width and is a prime number. We derive a lower bound on the number of coefficients required for perfect i…