FAULT-TOLERANT FFT NETWORKS.

Jing Yang Jou, Jacob A. Abraham

研究成果: 書貢獻/報告類型會議論文篇章同行評審

17 引文 斯高帕斯(Scopus)

摘要

With the advent of VLSI technology, large collections of processing elements, which cooperate with each other to achieve high-speed computation, have become economically feasible. Since any functional error in a high performance system may seriously jeopardize the operation of the system and its data integrity, some level of fault tolerance must be incorporated in order to ensure that the results of long computations are valid. A concurrent error detection (CED) scheme is proposed for FFT networks which consist of (N/2)log//2 N 2-point butterfly modules. The method assumes that failures are confined to a single complex multiplier or adder or one input or output set of lines; such a model covers a broad class of faults. It is shown that only a small overhead ratio--O(2/log//2 N) of hardware--is required for the FFT networks to obtain fault-secure results. Finally, a time redundancy method is used to locate the faulty modules.

原文???core.languages.en_GB???
主出版物標題Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)
發行者IEEE
頁面338-343
頁數6
ISBN(列印)0818606185
出版狀態已出版 - 1985

出版系列

名字Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)
ISSN(列印)0731-3071

指紋

深入研究「FAULT-TOLERANT FFT NETWORKS.」主題。共同形成了獨特的指紋。

引用此