Premium
A multiplier‐free dft algorithm using differential coding of coefficients
Author(s) -
Kocsis Ferenc
Publication year - 1988
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.4490160103
Subject(s) - multiplier (economics) , algorithm , mathematics , computation , digital filter , coding (social sciences) , realization (probability) , finite impulse response , filter (signal processing) , computer science , statistics , economics , computer vision , macroeconomics
The proposed procedure is a new, practically multiplier‐free DFT algorithm which is especially suitable for the computation of longer transforms. the method is based on the realization of prime‐length transforms using a single kind of optimized FIR filter. the transform coefficients have been coded differentially and the approximation is signal independent. the accuracy has been characterized by the ratio of the squared sum of the DFT coefficients and the squared sum of the errors of the approximating coefficients. the algorithm producing the approximate sequence is simple, its computational and memory requirements are minimal. and finally, for some transform lengths the characteristics of the algorithms have been derived.