INTEGER FAST FOURIER TRANSFORM - IMPLEMENTATION AND APPLICATION (ThuAmPO4)
Author(s) :
Krzysztof Duda (AGH University of Science and Technology, Poland)
Abstract : Transforms that maps integers to integers have advantages not available for floating point transforms. Integer computa-tions are faster and free from round off errors (integer trans-forms are widely used for lossless coding). The paper pres-ents an algorithm of Integer Fast Fourier Transform (intFFT) based on lifting factorization. Integer Discrete Cosine Trans-form (intDCT) is also computed as an example of intFFT application.

Menu