Sampling and series expansion theorems for fractional Fourier and other transforms
Signal Processing - Special issue: Fractional signal processing and applications
Angular decompositions for the discrete fractional signal transforms
Signal Processing
Linear summation of fractional-order matrices
IEEE Transactions on Signal Processing
PCM'10 Proceedings of the Advances in multimedia information processing, and 11th Pacific Rim conference on Multimedia: Part II
Discrete HARWHT and discrete fractional HARWHT transforms
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part II
Nearest feature line discriminant analysis in DFRCT domain for image feature extraction
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
| Hi-index | 35.69 |
This paper is concerned with the definitions of the discrete fractional cosine transform (DFRCT) and the discrete fractional sine transform (DFRST). The definitions of DFRCT and DFRST are based on the eigen decomposition of DCT and DST kernels. This is the same idea as that of the discrete fractional Fourier transform (DFRFT); the eigenvalue and eigenvector relationships between the DFRCT, DFRST, and DFRFT can be established. The computations of DFRFT for even or odd signals can be planted into the half-size DFRCT and DFRST calculations. This will reduce the computational load of the DFRFT by about one half