In this paper a procedure and a structured are presented for evaluating the Digital Fourier Transform on successive sets of N elements staggered of M.The procedure is recursive and requires (N/2) Log24M complex multiplications. The structured works in real time and needs (N/(2M) log24M multipliers.
Digital fourier transform on staggered blocks: recursive solution I
1975
Abstract
In this paper a procedure and a structured are presented for evaluating the Digital Fourier Transform on successive sets of N elements staggered of M.The procedure is recursive and requires (N/2) Log24M complex multiplications. The structured works in real time and needs (N/(2M) log24M multipliers.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_425073-doc_151627.pdf
accesso aperto
Descrizione: Digital fourier transform on staggered blocks: recursive solution I
Tipologia:
Versione Editoriale (PDF)
Dimensione
689.85 kB
Formato
Adobe PDF
|
689.85 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
