In this work the problem of evaluating successively the discrete Fourier transform (DFT) on ordered sets of N elements staggered of M is considered. Three procedures for solving such a problem are given, of which two are recursive and one nonrecursive. The complexity of each procedure, in number of complex multiplications, is (N/2) log? 4M.
Procedures for computing the discrete Fourier transform on staggered blocks
1976
Abstract
In this work the problem of evaluating successively the discrete Fourier transform (DFT) on ordered sets of N elements staggered of M is considered. Three procedures for solving such a problem are given, of which two are recursive and one nonrecursive. The complexity of each procedure, in number of complex multiplications, is (N/2) log? 4M.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_424800-doc_151510.pdf
solo utenti autorizzati
Descrizione: Procedures for computing the discrete Fourier transform on staggered blocks
Tipologia:
Versione Editoriale (PDF)
Dimensione
396.54 kB
Formato
Adobe PDF
|
396.54 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
