2025
Fast DCT+: A Family of Fast Transforms Based on Rank-One Updates of the Path Graph
ICASSP 2025accepted
This paper develops fast graph Fourier transform (GFT) algorithms with O(nlogn) runtime complexity for rank-one updates of the path graph. We first show that several commonly-used audio and video coding transforms belong to this class of GFTs, which we denote by DCT+. Next, starting from an arbitrar…