完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Chen, Yu-Wei | |
| dc.contributor.author | Chung, Kuo-Liang | |
| dc.date.accessioned | 2009-06-02T06:19:59Z | |
| dc.date.accessioned | 2020-05-25T06:39:13Z | - |
| dc.date.available | 2009-06-02T06:19:59Z | |
| dc.date.available | 2020-05-25T06:39:13Z | - |
| dc.date.issued | 2006-10-25T06:25:27Z | |
| dc.date.submitted | 2000-12-08 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2498 | - |
| dc.description.abstract | This paper presents an efficient fault–tolerant algorithm for Fast Fourier Transform (FFT) with 2n data on an n–dimensional hypercube with n− 1 faulty nodes in 9n − 15 communication steps and O(n) computation steps. To the best of our knowledge, this is the first time that such a fault– tolerant algorithm for FFT on hypercubes is proposed in the literature. | |
| dc.description.sponsorship | 中正大學,嘉義縣 | |
| dc.format.extent | 5p. | |
| dc.format.extent | 97898 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2000 ICS會議 | |
| dc.subject | Fast Fourier Transform | |
| dc.subject | parallel algorithm | |
| dc.subject | free dimensions | |
| dc.subject | faulty hypercube | |
| dc.subject | fault tolerance | |
| dc.subject | FFT | |
| dc.subject.other | Parallel Computing | |
| dc.title | Fault-Tolerant Algorithm for Fast Fourier Transform on Hypercubes | |
| 分類: | 2000年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002000000014.pdf | 95.6 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。