Carregant...
On computing the Discrete Fourier Transform
New algorithms for computing the Discrete Fourier Transform of n points are described. For n in the range of a few tens to a few thousands these algorithms use substantially fewer multiplications than the best algorithm previously known, and about the same number of additions.
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
1976
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC430186/ https://ncbi.nlm.nih.gov/pubmed/16592303 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|