摘要
Two existing DFT/FFT algorithms and a new prime-point Fast Fourier Transform algorithm are implemented with different serial and parallel processors. The evaluation results show that previous multiplication computational cost criterion is no longer applicable to the current parallel implementation. Total computational cost including add/subtract operation is one of the key factors affecting the speed and efficiency of implementation of parallel architecture.
| 源语言 | 英语 |
|---|---|
| 主期刊名 | 2012 International Conference on Systems and Informatics, ICSAI 2012 |
| 页 | 1693-1697 |
| 页数 | 5 |
| DOI | |
| 出版状态 | 已出版 - 2012 |
| 活动 | 2012 International Conference on Systems and Informatics, ICSAI 2012 - Yantai, 中国 期限: 19 5月 2012 → 20 5月 2012 |
出版系列
| 姓名 | 2012 International Conference on Systems and Informatics, ICSAI 2012 |
|---|
会议
| 会议 | 2012 International Conference on Systems and Informatics, ICSAI 2012 |
|---|---|
| 国家/地区 | 中国 |
| 市 | Yantai |
| 时期 | 19/05/12 → 20/05/12 |
指纹
探究 'Implementation of prime-point DFTs with programable processors' 的科研主题。它们共同构成独一无二的指纹。引用此
Liu, Z., Wang, H., Xie, Q., Zhang, Y., Zhou, W., & Liu, D. (2012). Implementation of prime-point DFTs with programable processors. 在 2012 International Conference on Systems and Informatics, ICSAI 2012 (页码 1693-1697). 文章 6223367 (2012 International Conference on Systems and Informatics, ICSAI 2012). https://doi.org/10.1109/ICSAI.2012.6223367