DocumentCode
699278
Title
Integer Fast Fourier Transform - implementation and application
Author
Duda, Krzysztof
Author_Institution
Dept. of Meas. & Instrum., AGH Univ. of Sci. & Technol., Kraków, Poland
fYear
2004
fDate
6-10 Sept. 2004
Firstpage
1517
Lastpage
1520
Abstract
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.
Keywords
discrete cosine transforms; fast Fourier transforms; integer programming; Integer Fast Fourier Transform; floating point transforms; intDCT; intFFT; integer discrete cosine transform; integer transforms; lifting factorization; lossless coding; Abstracts; Transforms; XML;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Conference, 2004 12th European
Conference_Location
Vienna
Print_ISBN
978-320-0001-65-7
Type
conf
Filename
7079808
Link To Document