Fast discrete Fourier transform computations using the reduced adder graph technique
- Author
- MEYER-BÄSE, Uwe1 ; NATARAJAN, Hariharan1 ; DEMPSTER, Andrew G2
[1] Department of Electrical and Computer Engineering, Florida State University, 2525 Pottsdamer Street, Tallahassee, FL 32310-6046, United States
[2] School of Surveying and Spatial Information Systems, University of New South Wales, Sydney 2052, Australia - Source
EURASIP Journal on Advances in Signal Processing (Print). 2007, Vol 2007, Num 10 ; H1-H8 ; ref : 41 ref
- ISSN
- 1687-6172
- Scientific domain
- Telecommunications
- Publisher
- Hindawi Publishing Corporation, Cairo
- Publication country
- Egypt
- Document type
- Article
- Language
- English
- Keyword (fr)
- Additionneur Algorithme Circuit VLSI Filtre numérique Filtre réponse impulsion finie Filtre réponse impulsion infinie Fluctuation fréquence impulsion Flux donnée Implémentation Multiplicateur Processeur signal numérique Transformation Fourier discrète Transformation Fourier rapide
- Keyword (en)
- Adder Algorithm VLSI circuit Digital filter Finite impulse response filter Infinite impulse response filter Chirp Data flow Implementation Multiplier Digital signal processor Discrete Fourier transformation Fast Fourier transformation
- Keyword (es)
- Adicionador Algoritmo Circuito VLSI Filtro numérico Filtro respuesta impulsión acabada Filtro respuesta impulsión inacabada Fluctuación frecuencia impulso Flujo datos Implementación Multiplicador Procesador señal numérica 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 / 001D04A04 Signal and communications theory / 001D04A04A Signal, noise / 001D04A04A2 Detection, estimation, filtering, equalization, prediction
- Discipline
- Telecommunications and information theory
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 18790898
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
Install on your browser
"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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"Fast discrete Fourier transform computations using the reduced adder graph technique\";s:9:\"\u0000*\u0000jtitle\";s:56:\"EURASIP Journal on Advances in Signal Processing (Print)\";s:9:\"\u0000*\u0000stitle\";s:39:\"EURASIP J. Adv. Signal Process. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:4:\"2007\";s:8:\"\u0000*\u0000issue\";s:2:\"10\";s:8:\"\u0000*\u0000spage\";s:0:\"\";s:8:\"\u0000*\u0000epage\";s:0:\"\";s:8:\"\u0000*\u0000pages\";s:5:\"H1-H8\";s:7:\"\u0000*\u0000issn\";s:9:\"1687-6172\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"MEYER-B\u00c4SE\";s:10:\"\u0000*\u0000aufirst\";s:3:\"Uwe\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:20:\"NATARAJAN, Hariharan\";i:1;s:18:\"DEMPSTER, Andrew G\";}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:84:\"Fast discrete Fourier transform computations using the reduced adder graph technique\";s:8:\"\u0000*\u0000place\";s:5:\"Cairo\";s:6:\"\u0000*\u0000pub\";s:30:\"Hindawi Publishing Corporation\";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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"Fast discrete Fourier transform computations using the reduced adder graph technique\";s:9:\"\u0000*\u0000jtitle\";s:56:\"EURASIP Journal on Advances in Signal Processing (Print)\";s:9:\"\u0000*\u0000stitle\";s:39:\"EURASIP J. Adv. Signal Process. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:4:\"2007\";s:8:\"\u0000*\u0000issue\";s:2:\"10\";s:8:\"\u0000*\u0000spage\";s:0:\"\";s:8:\"\u0000*\u0000epage\";s:0:\"\";s:8:\"\u0000*\u0000pages\";s:5:\"H1-H8\";s:7:\"\u0000*\u0000issn\";s:9:\"1687-6172\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"MEYER-B\u00c4SE\";s:10:\"\u0000*\u0000aufirst\";s:3:\"Uwe\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:20:\"NATARAJAN, Hariharan\";i:1;s:18:\"DEMPSTER, Andrew G\";}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:84:\"Fast discrete Fourier transform computations using the reduced adder graph technique\";s:8:\"\u0000*\u0000place\";s:5:\"Cairo\";s:6:\"\u0000*\u0000pub\";s:30:\"Hindawi Publishing Corporation\";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:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"Fast discrete Fourier transform computations using the reduced adder graph technique\";s:9:\"\u0000*\u0000jtitle\";s:56:\"EURASIP Journal on Advances in Signal Processing (Print)\";s:9:\"\u0000*\u0000stitle\";s:39:\"EURASIP J. Adv. Signal Process. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:4:\"2007\";s:8:\"\u0000*\u0000issue\";s:2:\"10\";s:8:\"\u0000*\u0000spage\";s:0:\"\";s:8:\"\u0000*\u0000epage\";s:0:\"\";s:8:\"\u0000*\u0000pages\";s:5:\"H1-H8\";s:7:\"\u0000*\u0000issn\";s:9:\"1687-6172\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"MEYER-B\u00c4SE\";s:10:\"\u0000*\u0000aufirst\";s:3:\"Uwe\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:20:\"NATARAJAN, Hariharan\";i:1;s:18:\"DEMPSTER, Andrew G\";}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:84:\"Fast discrete Fourier transform computations using the reduced adder graph technique\";s:8:\"\u0000*\u0000place\";s:5:\"Cairo\";s:6:\"\u0000*\u0000pub\";s:30:\"Hindawi Publishing Corporation\";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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"Fast discrete Fourier transform computations using the reduced adder graph technique\";s:9:\"\u0000*\u0000jtitle\";s:56:\"EURASIP Journal on Advances in Signal Processing (Print)\";s:9:\"\u0000*\u0000stitle\";s:39:\"EURASIP J. Adv. Signal Process. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:4:\"2007\";s:8:\"\u0000*\u0000issue\";s:2:\"10\";s:8:\"\u0000*\u0000spage\";s:0:\"\";s:8:\"\u0000*\u0000epage\";s:0:\"\";s:8:\"\u0000*\u0000pages\";s:5:\"H1-H8\";s:7:\"\u0000*\u0000issn\";s:9:\"1687-6172\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"MEYER-B\u00c4SE\";s:10:\"\u0000*\u0000aufirst\";s:3:\"Uwe\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:20:\"NATARAJAN, Hariharan\";i:1;s:18:\"DEMPSTER, Andrew G\";}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:84:\"Fast discrete Fourier transform computations using the reduced adder graph technique\";s:8:\"\u0000*\u0000place\";s:5:\"Cairo\";s:6:\"\u0000*\u0000pub\";s:30:\"Hindawi Publishing Corporation\";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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"Fast discrete Fourier transform computations using the reduced adder graph technique\";s:9:\"\u0000*\u0000jtitle\";s:56:\"EURASIP Journal on Advances in Signal Processing (Print)\";s:9:\"\u0000*\u0000stitle\";s:39:\"EURASIP J. Adv. Signal Process. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:4:\"2007\";s:8:\"\u0000*\u0000issue\";s:2:\"10\";s:8:\"\u0000*\u0000spage\";s:0:\"\";s:8:\"\u0000*\u0000epage\";s:0:\"\";s:8:\"\u0000*\u0000pages\";s:5:\"H1-H8\";s:7:\"\u0000*\u0000issn\";s:9:\"1687-6172\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"MEYER-B\u00c4SE\";s:10:\"\u0000*\u0000aufirst\";s:3:\"Uwe\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:20:\"NATARAJAN, Hariharan\";i:1;s:18:\"DEMPSTER, Andrew G\";}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:84:\"Fast discrete Fourier transform computations using the reduced adder graph technique\";s:8:\"\u0000*\u0000place\";s:5:\"Cairo\";s:6:\"\u0000*\u0000pub\";s:30:\"Hindawi Publishing Corporation\";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
