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.
Gardado en:
| Publicado en: | Proc Natl Acad Sci U S A |
|---|---|
| Autor Principal: | |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
National Academy of Sciences
1976
|
| Assuntos: | |
| Acceso en liña: | https://ncbi.nlm.nih.govhttps://pmc.ncbi.nlm.nih.gov/articles/PMC430186/ https://ncbi.nlm.nih.govhttps://pubmed.ncbi.nlm.nih.gov/16592303/ https://ncbi.nlm.nih.govhttps://doi.org/10.1073/pnas.73.4.1005 |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|