In this work the problem of evaluating the Digital Fourier Transform on ordered sets of N elements staggered of M is considered. A recursive procedure for solving such a problem is given, whose complexity is (N/2) log 4M. A structured of implementing such a procedure is presented. Other solutions of this problem are given elsewhere.
Digital fourier transform of staggered blocks: recursive solution II
1975
Abstract
In this work the problem of evaluating the Digital Fourier Transform on ordered sets of N elements staggered of M is considered. A recursive procedure for solving such a problem is given, whose complexity is (N/2) log 4M. A structured of implementing such a procedure is presented. Other solutions of this problem are given elsewhere.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_425088-doc_151634.pdf
accesso aperto
Descrizione: Digital fourier transform of staggered blocks: recursive solution II
Tipologia:
Versione Editoriale (PDF)
Dimensione
476.73 kB
Formato
Adobe PDF
|
476.73 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
