Fast unitary transforms are widely used in different areas such as data compression, pattern recognition and image reconstruction, interpolation, linear filtering, and spectral analysis. In this paper, we analyze the general concept of rotation and processing of data around not only circles but ellipses, in general. For that, we describe and analyze the general concept of the elliptic Fourier transform which was developed by Grigoryan in 2009. The block-wise representation of the discrete Fourier transform is considered in the real space, which is effective and that can be generalized to obtain new methods in spectral analysis. The N-point Elliptic discrete Fourier transform (EDFT) uses as a basic 2 × 2 transformation the rotations around ellipses. The EDFT distinguishes well from the carrying frequencies of the signal in both real and imaginary parts. It also has a simple inverse matrix. It is parameterized and includes also the DFT. Our preliminary results show that by using different parameters, the EDFT can be used effectively for solving many problems in signal and image processing field, in which includes problems such as image enhancement, filtration, encryption and many others.