Integer Fast Fourier Transform - implementation and application

Transforms that maps integers to integers have advantages not available for floating point transforms. Integer computations are faster and free from round off errors (integer transforms are widely used for lossless coding). The paper presents an algorithm of Integer Fast Fourier Transform (intFFT) based on lifting factorization. Integer Discrete Cosine Transform (intDCT) is also computed as an example of intFFT application.