Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFT's and their connection with practical algorithms
- Author
- DUHAMEL, P
CNET, Issy-les-Moulineaux 92131, France - Source
IEEE transactions on acoustics, speech, and signal processing. 1990, Vol 38, Num 9, pp 1504-1511 ; ref : 20 ref
- ISSN
- 0096-3518
- Scientific domain
- Control theory, operational research; Electronics; Computer science; Mechanics acoustics; Telecommunications
- Publisher
- Institute of electrical and electronics engineers, New York, NY
- Publication country
- United States
- Document type
- Article
- Language
- English
- Keyword (fr)
- Algorithme Analyse mathématique Polynôme Traitement numérique Traitement signal Transformation Fourier discrète Transformation Fourier rapide
- Keyword (en)
- Algorithm Mathematical analysis Polynomial Digital processing Signal processing Discrete Fourier transformation Fast Fourier transformation
- Keyword (es)
- Algoritmo Análisis matemático Polinomio Tratamiento numérico Procesamiento señal Transformación Fourier discreta Transformación Fourier rápida
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04A Information, signal and communications theory / 001D04A02 Mathematical methods
- Discipline
- Telecommunications and information theory
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 5285219
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1109/29.60070 
https://dx.doi.org/10.1109/29.60070
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:16:\"10.1109\/29.60070\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:134:\"Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFT's and their connection with practical algorithms\";s:9:\"\u0000*\u0000jtitle\";s:61:\"IEEE transactions on acoustics, speech, and signal processing\";s:9:\"\u0000*\u0000stitle\";s:41:\"IEEE trans. acoust. speech signal process\";s:7:\"\u0000*\u0000date\";s:4:\"1990\";s:9:\"\u0000*\u0000volume\";s:2:\"38\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"1504\";s:8:\"\u0000*\u0000epage\";s:4:\"1511\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3518\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"DUHAMEL\";s:10:\"\u0000*\u0000aufirst\";s:1:\"P\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:134:\"Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFT's and their connection with practical algorithms\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:49:\"Institute of electrical and electronics engineers\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:16:\"10.1109\/29.60070\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:134:\"Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFT's and their connection with practical algorithms\";s:9:\"\u0000*\u0000jtitle\";s:61:\"IEEE transactions on acoustics, speech, and signal processing\";s:9:\"\u0000*\u0000stitle\";s:41:\"IEEE trans. acoust. speech signal process\";s:7:\"\u0000*\u0000date\";s:4:\"1990\";s:9:\"\u0000*\u0000volume\";s:2:\"38\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"1504\";s:8:\"\u0000*\u0000epage\";s:4:\"1511\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3518\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"DUHAMEL\";s:10:\"\u0000*\u0000aufirst\";s:1:\"P\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:134:\"Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFT's and their connection with practical algorithms\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:49:\"Institute of electrical and electronics engineers\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:16:\"10.1109\/29.60070\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:16:\"10.1109\/29.60070\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:134:\"Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFT's and their connection with practical algorithms\";s:9:\"\u0000*\u0000jtitle\";s:61:\"IEEE transactions on acoustics, speech, and signal processing\";s:9:\"\u0000*\u0000stitle\";s:41:\"IEEE trans. acoust. speech signal process\";s:7:\"\u0000*\u0000date\";s:4:\"1990\";s:9:\"\u0000*\u0000volume\";s:2:\"38\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"1504\";s:8:\"\u0000*\u0000epage\";s:4:\"1511\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3518\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"DUHAMEL\";s:10:\"\u0000*\u0000aufirst\";s:1:\"P\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:134:\"Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFT's and their connection with practical algorithms\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:49:\"Institute of electrical and electronics engineers\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:16:\"10.1109\/29.60070\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:134:\"Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFT's and their connection with practical algorithms\";s:9:\"\u0000*\u0000jtitle\";s:61:\"IEEE transactions on acoustics, speech, and signal processing\";s:9:\"\u0000*\u0000stitle\";s:41:\"IEEE trans. acoust. speech signal process\";s:7:\"\u0000*\u0000date\";s:4:\"1990\";s:9:\"\u0000*\u0000volume\";s:2:\"38\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"1504\";s:8:\"\u0000*\u0000epage\";s:4:\"1511\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3518\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"DUHAMEL\";s:10:\"\u0000*\u0000aufirst\";s:1:\"P\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:134:\"Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFT's and their connection with practical algorithms\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:49:\"Institute of electrical and electronics engineers\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:16:\"10.1109\/29.60070\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:134:\"Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFT's and their connection with practical algorithms\";s:9:\"\u0000*\u0000jtitle\";s:61:\"IEEE transactions on acoustics, speech, and signal processing\";s:9:\"\u0000*\u0000stitle\";s:41:\"IEEE trans. acoust. speech signal process\";s:7:\"\u0000*\u0000date\";s:4:\"1990\";s:9:\"\u0000*\u0000volume\";s:2:\"38\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"1504\";s:8:\"\u0000*\u0000epage\";s:4:\"1511\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3518\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"DUHAMEL\";s:10:\"\u0000*\u0000aufirst\";s:1:\"P\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:134:\"Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFT's and their connection with practical algorithms\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:49:\"Institute of electrical and electronics engineers\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
