一种新的FFT网络并发错误检测方案

[1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium Pub Date : 1990-06-26 DOI:10.1109/FTCS.1990.89346

D. Tao, C. Hartmann

{"title":"一种新的FFT网络并发错误检测方案","authors":"D. Tao, C. Hartmann","doi":"10.1109/FTCS.1990.89346","DOIUrl":null,"url":null,"abstract":"A novel algorithm-based fault tolerance scheme is proposed for fast Fourier transform (FFT) networks. It is shown that the proposed scheme achieves 100% fault coverage theoretically. An accurate measure of the fault coverage for FFT networks is provided by taking the roundoff error into account. It is shown that the proposed scheme maintains the low hardware overhead and high throughput of J.Y. Jou and J.A. Abraham's scheme and, at the same time, increases the fault coverage significantly.<<ETX>>","PeriodicalId":174189,"journal":{"name":"[1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"79","resultStr":"{\"title\":\"A novel concurrent error detection scheme for FFT networks\",\"authors\":\"D. Tao, C. Hartmann\",\"doi\":\"10.1109/FTCS.1990.89346\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel algorithm-based fault tolerance scheme is proposed for fast Fourier transform (FFT) networks. It is shown that the proposed scheme achieves 100% fault coverage theoretically. An accurate measure of the fault coverage for FFT networks is provided by taking the roundoff error into account. It is shown that the proposed scheme maintains the low hardware overhead and high throughput of J.Y. Jou and J.A. Abraham's scheme and, at the same time, increases the fault coverage significantly.<<ETX>>\",\"PeriodicalId\":174189,\"journal\":{\"name\":\"[1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"79\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTCS.1990.89346\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTCS.1990.89346","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 79

摘要

针对快速傅里叶变换(FFT)网络，提出了一种新的基于算法的容错方案。结果表明，该方案在理论上实现了100%的故障覆盖率。通过将舍入误差考虑在内，提供了对FFT网络故障覆盖率的精确度量。结果表明，该方案在保持J.Y. Jou和J.A. Abraham方案的低硬件开销和高吞吐量的同时，显著提高了故障覆盖率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A novel concurrent error detection scheme for FFT networks

A novel algorithm-based fault tolerance scheme is proposed for fast Fourier transform (FFT) networks. It is shown that the proposed scheme achieves 100% fault coverage theoretically. An accurate measure of the fault coverage for FFT networks is provided by taking the roundoff error into account. It is shown that the proposed scheme maintains the low hardware overhead and high throughput of J.Y. Jou and J.A. Abraham's scheme and, at the same time, increases the fault coverage significantly.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium

自引率

0.00%

发文量