Angular decompositions for the discrete fractional signal transforms

Authors:
Min-Hung Yeh
Affiliations:
Department of Electronic Engineering, National Ilan University, I-Lan, Taiwan, ROC
Venue:
Signal Processing
Year:
2005

Citing 16
Cited 0

Fundamentals of digital image processing

Fundamentals of digital image processing
Discrete-time signal processing

Discrete-time signal processing
Digital watermarking in the fractional Fourier transformation domain

Journal of Network and Computer Applications
Fast Transforms: Algorithms, Analyses, Applications

Fast Transforms: Algorithms, Analyses, Applications
Fractional Fourier transform pre-processing for neural networks and its application to object recognition

Neural Networks
Optimal filtering in fractional Fourier domains

IEEE Transactions on Signal Processing
Eigenvalues and eigenvectors of generalized DFT, generalized DHT,DCT-IV and DST-IV matrices

IEEE Transactions on Signal Processing
The fractional discrete cosine transform

IEEE Transactions on Signal Processing
Integer fast Fourier transform

IEEE Transactions on Signal Processing
Discrete fractional Fourier transform based on orthogonalprojections

IEEE Transactions on Signal Processing
The discrete fractional Fourier transform

IEEE Transactions on Signal Processing
Closed-form discrete fractional and affine Fourier transforms

IEEE Transactions on Signal Processing
Beamforming using the fractional Fourier transform

IEEE Transactions on Signal Processing
A method for the discrete fractional Fourier transform computation

IEEE Transactions on Signal Processing
Digital computation of the fractional Fourier transform

IEEE Transactions on Signal Processing
The discrete fractional cosine and sine transforms

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

This paper is concerned with the angular decomposition methods for the discrete fractional signal transforms. The proposed angular decomposition algorithm can be applied to many discrete fractional signal transforms, which are developed by eigen decomposition. By this angular decomposition, the discrete fractional signal transforms can be computed by a weighted summation of the transform evaluated at special angles. And the weighting coefficients are just equal to the inverse discrete Fourier transform of the eigenvalues of the fractional signal transform kernels.