Three different structures for computing the Digital Fourier Transform on N elements are given. Every structure generates P coefficients (with P dividing N) at every computational step. These structures are evaluated in terms of hardware requirements and their operation speed is discussed.
Digital fourier transformers with arbitrary parallelism
1975
Abstract
Three different structures for computing the Digital Fourier Transform on N elements are given. Every structure generates P coefficients (with P dividing N) at every computational step. These structures are evaluated in terms of hardware requirements and their operation speed is discussed.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_422810-doc_150403.pdf
solo utenti autorizzati
Descrizione: Digital fourier transformers with arbitrary parallelism
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.02 MB
Formato
Adobe PDF
|
1.02 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
