Abstract
A new discrete fractional transform defined by two parameters (angle and fractional order) is presented. All eigenvectors of the transform are obtained by an angle using recursion method. This transform is named as discrete fractional angular transform (DFAT). The computational load of kernel matrix of the DFAT is minimum than all other transforms with fractional order. This characteristics has very important practical applications in signal and image processing. Numerical results and the mathematical properties of this transform are also given. As fractional Fourier transform, this transform can be applied in one and two dimensional signal processing.