In this work the problem of evaluating the Digital Fourier Transform on sets of N elements staggered of M is considered. A procedure for solving such a problem is given, whose complexity, in terms of complex multiplications, is (n/2)log24M-M. A structure for implementing such a procedure is presented. Other solutions of this problem are given in Ref.4.
Digital fourier transform on staggered blocks: a first solution
1975
Abstract
In this work the problem of evaluating the Digital Fourier Transform on sets of N elements staggered of M is considered. A procedure for solving such a problem is given, whose complexity, in terms of complex multiplications, is (n/2)log24M-M. A structure for implementing such a procedure is presented. Other solutions of this problem are given in Ref.4.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_424807-doc_151515.pdf
accesso aperto
Descrizione: Digital fourier transform on staggered blocks: a first solution
Dimensione
740.79 kB
Formato
Adobe PDF
|
740.79 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
