{"title":"延时可验证双电平电路的合成","authors":"W. Ke, P. R. Menon","doi":"10.1109/EDTC.1994.326861","DOIUrl":null,"url":null,"abstract":"We introduce a new type of delay test set, called a delay-verification test set, which detects the presence of any path delay fault(s) that can affect the timing of the circuit. Such test sets exist even for some circuits that are not completely delay testable. We provide necessary and sufficient conditions for delay-verifiable two-level circuits, which are less stringent than those for complete delay testability. We introduce a new type of test which is not a path delay fault test in the usual sense, but is necessary for verifying the temporal correctness of the circuit under test. A synthesis procedure for delay-verifiable two-level circuits is provided. Experimental data show that delay-verifiable implementations are generally more area-efficient than completely delay testable implementations.<<ETX>>","PeriodicalId":244297,"journal":{"name":"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Synthesis of delay-verifiable two-level circuits\",\"authors\":\"W. Ke, P. R. Menon\",\"doi\":\"10.1109/EDTC.1994.326861\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a new type of delay test set, called a delay-verification test set, which detects the presence of any path delay fault(s) that can affect the timing of the circuit. Such test sets exist even for some circuits that are not completely delay testable. We provide necessary and sufficient conditions for delay-verifiable two-level circuits, which are less stringent than those for complete delay testability. We introduce a new type of test which is not a path delay fault test in the usual sense, but is necessary for verifying the temporal correctness of the circuit under test. A synthesis procedure for delay-verifiable two-level circuits is provided. Experimental data show that delay-verifiable implementations are generally more area-efficient than completely delay testable implementations.<<ETX>>\",\"PeriodicalId\":244297,\"journal\":{\"name\":\"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-02-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDTC.1994.326861\",\"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 of European Design and Test Conference EDAC-ETC-EUROASIC","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDTC.1994.326861","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We introduce a new type of delay test set, called a delay-verification test set, which detects the presence of any path delay fault(s) that can affect the timing of the circuit. Such test sets exist even for some circuits that are not completely delay testable. We provide necessary and sufficient conditions for delay-verifiable two-level circuits, which are less stringent than those for complete delay testability. We introduce a new type of test which is not a path delay fault test in the usual sense, but is necessary for verifying the temporal correctness of the circuit under test. A synthesis procedure for delay-verifiable two-level circuits is provided. Experimental data show that delay-verifiable implementations are generally more area-efficient than completely delay testable implementations.<>