奇偶排序网络的故障诊断

C. Hu, Chung-Len Lee, Wen Ching Wu, Jwu-E Chen
{"title":"奇偶排序网络的故障诊断","authors":"C. Hu, Chung-Len Lee, Wen Ching Wu, Jwu-E Chen","doi":"10.1109/ATS.1997.643972","DOIUrl":null,"url":null,"abstract":"This paper investigates detection and location for single faults in odd-even sorting networks. In the work, we have found that three tests are enough to locate single link fault and four tests are sufficient to detect single sorting element fault in an odd-even sorting network. For location tests for sorting element faults, the numbers of tests depend on the type of faults occurring at the sorting element. For most types of sorting element faults, the numbers are less than four specific tests. For the other types of faults, we have presented the test generation procedure and binary search procedures to generate the tests. The numbers of location tests are less than (n+log/sub 2/n), where n=log/sub 2/N and N is the number of inputs of the sorting network.","PeriodicalId":330767,"journal":{"name":"Proceedings Sixth Asian Test Symposium (ATS'97)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fault diagnosis of odd-even sorting networks\",\"authors\":\"C. Hu, Chung-Len Lee, Wen Ching Wu, Jwu-E Chen\",\"doi\":\"10.1109/ATS.1997.643972\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates detection and location for single faults in odd-even sorting networks. In the work, we have found that three tests are enough to locate single link fault and four tests are sufficient to detect single sorting element fault in an odd-even sorting network. For location tests for sorting element faults, the numbers of tests depend on the type of faults occurring at the sorting element. For most types of sorting element faults, the numbers are less than four specific tests. For the other types of faults, we have presented the test generation procedure and binary search procedures to generate the tests. The numbers of location tests are less than (n+log/sub 2/n), where n=log/sub 2/N and N is the number of inputs of the sorting network.\",\"PeriodicalId\":330767,\"journal\":{\"name\":\"Proceedings Sixth Asian Test Symposium (ATS'97)\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Sixth Asian Test Symposium (ATS'97)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ATS.1997.643972\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Sixth Asian Test Symposium (ATS'97)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATS.1997.643972","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了奇偶排序网络中单故障的检测与定位问题。在工作中,我们发现在奇偶排序网络中,三次测试足以检测单个链路故障,四次测试足以检测单个排序单元故障。对于排序元素故障的定位测试,测试的数量取决于在排序元素上发生的故障的类型。对于大多数类型的排序元件故障,数量少于四个特定的测试。对于其他类型的故障,我们给出了测试生成程序和二进制搜索程序来生成测试。定位测试个数小于(n+log/sub 2/n),其中n=log/sub 2/n, n为排序网络的输入个数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fault diagnosis of odd-even sorting networks
This paper investigates detection and location for single faults in odd-even sorting networks. In the work, we have found that three tests are enough to locate single link fault and four tests are sufficient to detect single sorting element fault in an odd-even sorting network. For location tests for sorting element faults, the numbers of tests depend on the type of faults occurring at the sorting element. For most types of sorting element faults, the numbers are less than four specific tests. For the other types of faults, we have presented the test generation procedure and binary search procedures to generate the tests. The numbers of location tests are less than (n+log/sub 2/n), where n=log/sub 2/N and N is the number of inputs of the sorting network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信