DISCRETE FOURIER TRANSFORM CALCULATION METHOD USING NON-INTEGER ARGUMENT
The invention relates to a method for calculating the discrete Fourier transform (DFT) intended for reducing the picket-fence effect. According to the invention, the method uses a non-integer number k of cycles for kernel functions. For an R times multiplication of resolution in frequency, the argum...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Patent |
Sprache: | eng ; rum |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The invention relates to a method for calculating the discrete Fourier transform (DFT) intended for reducing the picket-fence effect. According to the invention, the method uses a non-integer number k of cycles for kernel functions. For an R times multiplication of resolution in frequency, the argument pitch is calculated as p=1/R. The number of frequency points shall become M=RN, where N is the number of points in the signal time sequence, the non-integer k varies from 0 to N-1, with a subunit pitch p. The use of a non-integer argument is equivalent with the zero-padding method while the number of operations is reduced log2M/log2N times.
Invenţia se referă la o metodă de calcul a transformatei Fourier discrete (TFD), destinate reducerii efectului numit picket fence. Metoda conform invenţiei utilizează un număr k neîntreg de cicluri pentru funcţiile kernel. Pentru o multiplicare de R ori a rezoluţiei în frecvenţă se calculează pasul argumentului ca fiind p=1/R. Numărul punctelor în frecvenţă vor deveni M=RN, unde N reprezintă numărul punctelor din secvenţa de timp a semnalului, k neîntreg variază de la 0 la N-1, cu pasul subpunitar p. Utilizarea unui argument neîntreg este echivalentă cu metoda zero padding, dar numărul de operaţii este redus de log2M/log2N ori. |
---|