Pub Date : 1994-02-28DOI: 10.1109/EDTC.1994.326825
A. Kunzmann, Frank Böhland
In this paper a new algorithm for automatic test pattern generation for finding gate-delay faults will be presented. In contrast to the state-of-the-art approaches the necessary test pattern sequences are generated using the logic function of the circuit to be tested. This enables the usage of both conventional scan flipflops and boundary scan cells, instead of enlarged area-consuming scannable flipflops. Additionally, the test application time can be distinctly reduced since only one test pattern of each test pair has to be loaded into the scan register. Experimental results of the ISCAS-89 benchmark circuits illustrate the efficiency of this new approach.<>
{"title":"Gate-delay fault test with conventional scan-design","authors":"A. Kunzmann, Frank Böhland","doi":"10.1109/EDTC.1994.326825","DOIUrl":"https://doi.org/10.1109/EDTC.1994.326825","url":null,"abstract":"In this paper a new algorithm for automatic test pattern generation for finding gate-delay faults will be presented. In contrast to the state-of-the-art approaches the necessary test pattern sequences are generated using the logic function of the circuit to be tested. This enables the usage of both conventional scan flipflops and boundary scan cells, instead of enlarged area-consuming scannable flipflops. Additionally, the test application time can be distinctly reduced since only one test pattern of each test pair has to be loaded into the scan register. Experimental results of the ISCAS-89 benchmark circuits illustrate the efficiency of this new approach.<<ETX>>","PeriodicalId":244297,"journal":{"name":"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131493730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-02-28DOI: 10.1109/EDTC.1994.326795
L. Burgun, N. Dictus, A. Greiner, E. Pradho, C. Sarwary
This paper presents an approach based on ROBDD representation for multilevel logic synthesis. This approach makes it possible to handle very high complexity circuits that cannot be synthesized by the classical factorization algorithms. Two important algorithms are used. The former generates a multilevel expression from an ROBDD. The latter builds a minimal ROBDD from the two ROBDDs representing an incompletely specified Boolean function. This approach is implemented in the logic synthesis software LOGIC developed as part of the ALLIANCE CAD package.<>
{"title":"Multilevel logic synthesis of very high complexity circuits","authors":"L. Burgun, N. Dictus, A. Greiner, E. Pradho, C. Sarwary","doi":"10.1109/EDTC.1994.326795","DOIUrl":"https://doi.org/10.1109/EDTC.1994.326795","url":null,"abstract":"This paper presents an approach based on ROBDD representation for multilevel logic synthesis. This approach makes it possible to handle very high complexity circuits that cannot be synthesized by the classical factorization algorithms. Two important algorithms are used. The former generates a multilevel expression from an ROBDD. The latter builds a minimal ROBDD from the two ROBDDs representing an incompletely specified Boolean function. This approach is implemented in the logic synthesis software LOGIC developed as part of the ALLIANCE CAD package.<<ETX>>","PeriodicalId":244297,"journal":{"name":"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123784635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-02-28DOI: 10.1109/EDTC.1994.326863
A. Vuksic, K. Fuchs
A new built-in self testing (BIST) method for the detection of delay faults is proposed. It is shown that all possible pattern pairs can be generated with a MISR using all input combinations. In order to reduce the test pattern set, deterministic delay test generation is used and a minimal set of input vectors is derived via clique covering. Experimental results show that by just using the all-0 and all-1 input vectors, the non-robust path delay fault coverage ranges from 85% to 100%.<>
{"title":"A new BIST approach for delay fault testing","authors":"A. Vuksic, K. Fuchs","doi":"10.1109/EDTC.1994.326863","DOIUrl":"https://doi.org/10.1109/EDTC.1994.326863","url":null,"abstract":"A new built-in self testing (BIST) method for the detection of delay faults is proposed. It is shown that all possible pattern pairs can be generated with a MISR using all input combinations. In order to reduce the test pattern set, deterministic delay test generation is used and a minimal set of input vectors is derived via clique covering. Experimental results show that by just using the all-0 and all-1 input vectors, the non-robust path delay fault coverage ranges from 85% to 100%.<<ETX>>","PeriodicalId":244297,"journal":{"name":"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121311292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-02-28DOI: 10.1109/EDTC.1994.326841
How-Rern Lin, Ching-Lung Chou, Y. Hsu, TingTing Hwang
We consider the transistor sizing problem in a module layout which consists of several rows of automatically generated leaf cells based on a new layout style proposed by Hwang et al. (1991). The sizing is performed in two levels. At the module level, a leaf cell is chosen based on a height slack (usable area) and timing slack. At the cell level, the cell is sized based on a width constraint imposed from the module level. The problem of sizing a cell is formulated as a nonlinear program. The objective is to minimize the difference of actual arrival time and the required time of all output nodes simultaneously. A benchmarking process has been conducted at both cell level and module level. Experiments on a set of cells show that on the average over 25% performance improvement is obtained by using 0.06% more area. Moreover, for a leaf cell with multiple outputs, the sizer can indeed simultaneously make the arrival time of all output nodes close to the required time. Results of a module level experiment show that using height slack the maximum delay of the circuit can be reduced up to 17.7% without area penalty for the example shown.<>
{"title":"Cell height driven transistor sizing in a cell based module design","authors":"How-Rern Lin, Ching-Lung Chou, Y. Hsu, TingTing Hwang","doi":"10.1109/EDTC.1994.326841","DOIUrl":"https://doi.org/10.1109/EDTC.1994.326841","url":null,"abstract":"We consider the transistor sizing problem in a module layout which consists of several rows of automatically generated leaf cells based on a new layout style proposed by Hwang et al. (1991). The sizing is performed in two levels. At the module level, a leaf cell is chosen based on a height slack (usable area) and timing slack. At the cell level, the cell is sized based on a width constraint imposed from the module level. The problem of sizing a cell is formulated as a nonlinear program. The objective is to minimize the difference of actual arrival time and the required time of all output nodes simultaneously. A benchmarking process has been conducted at both cell level and module level. Experiments on a set of cells show that on the average over 25% performance improvement is obtained by using 0.06% more area. Moreover, for a leaf cell with multiple outputs, the sizer can indeed simultaneously make the arrival time of all output nodes close to the required time. Results of a module level experiment show that using height slack the maximum delay of the circuit can be reduced up to 17.7% without area penalty for the example shown.<<ETX>>","PeriodicalId":244297,"journal":{"name":"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122375466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-02-28DOI: 10.1109/EDTC.1994.326880
R. Hahn, Rolf Krieger, B. Becker
One central point of testing is the choice of the fault model and the faults which have to be considered to ensure the correct behaviour of a circuit. The number of faults has a strong influence on the costs which must be paid for in the generation of a test set. For logical fault models this number can be reduced using equivalence relations between faults. Since the complexity of digital circuits is increasing, hierarchical design is becoming more and more important. In this paper, we show that in the case of a hierarchical circuit description often more equivalence relations between faults can be recognized efficiently than in the case of a nonhierarchical description. With respect to the stuck-at fault model, our experiments show that the computation of these equivalence relations can be performed in negligible time and that the number of faults can be reduced considerably.<>
{"title":"A hierarchical approach to fault collapsing","authors":"R. Hahn, Rolf Krieger, B. Becker","doi":"10.1109/EDTC.1994.326880","DOIUrl":"https://doi.org/10.1109/EDTC.1994.326880","url":null,"abstract":"One central point of testing is the choice of the fault model and the faults which have to be considered to ensure the correct behaviour of a circuit. The number of faults has a strong influence on the costs which must be paid for in the generation of a test set. For logical fault models this number can be reduced using equivalence relations between faults. Since the complexity of digital circuits is increasing, hierarchical design is becoming more and more important. In this paper, we show that in the case of a hierarchical circuit description often more equivalence relations between faults can be recognized efficiently than in the case of a nonhierarchical description. With respect to the stuck-at fault model, our experiments show that the computation of these equivalence relations can be performed in negligible time and that the number of faults can be reduced considerably.<<ETX>>","PeriodicalId":244297,"journal":{"name":"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126466130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-02-28DOI: 10.1109/EDTC.1994.326915
J. Bern, Jordan Gergov, C. Meinel, A. Slobodová
It is shown that Free Binary Decision Diagrams (FBDD's), with respect to a predefined type, provide a canonical representation and allow efficient solutions of the basic tasks in Boolean manipulation in a similar manner to the well-known OBDD's. However, in contrast to OBDD's, the FBDD's allow more succinct representations of Boolean functions. For experimentation we have used an FBDD-package and the types worked with are tree-based. Using different type-creating heuristics, we compare the size of FBDD-representations of some ISCAS benchmarks with the size of their OBDD-representations.<>
{"title":"Boolean manipulation with free BDD's. First experimental results","authors":"J. Bern, Jordan Gergov, C. Meinel, A. Slobodová","doi":"10.1109/EDTC.1994.326915","DOIUrl":"https://doi.org/10.1109/EDTC.1994.326915","url":null,"abstract":"It is shown that Free Binary Decision Diagrams (FBDD's), with respect to a predefined type, provide a canonical representation and allow efficient solutions of the basic tasks in Boolean manipulation in a similar manner to the well-known OBDD's. However, in contrast to OBDD's, the FBDD's allow more succinct representations of Boolean functions. For experimentation we have used an FBDD-package and the types worked with are tree-based. Using different type-creating heuristics, we compare the size of FBDD-representations of some ISCAS benchmarks with the size of their OBDD-representations.<<ETX>>","PeriodicalId":244297,"journal":{"name":"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127932768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-02-28DOI: 10.1109/EDTC.1994.326903
Shan-Hsi Huang, J. Rabaey
Meeting the stringent throughput requirements of high performance DSP applications is a challenging task. Extensive optimization of the computational structure is essential to satisfy these constraints. This paper proposes a new transformational approach for performance optimization. This approach consists of an ordered set of transformations, including algebraic transformations, loop unrolling, and retiming/pipelining, aimed at speeding up both recursive and non-recursive, us well as linear and non-linear applications. Impressive and close to optimal speed-up's have been obtained for a large range of benchmark examples.<>
{"title":"Maximizing the throughput of high performance DSP applications using behavioral transformations","authors":"Shan-Hsi Huang, J. Rabaey","doi":"10.1109/EDTC.1994.326903","DOIUrl":"https://doi.org/10.1109/EDTC.1994.326903","url":null,"abstract":"Meeting the stringent throughput requirements of high performance DSP applications is a challenging task. Extensive optimization of the computational structure is essential to satisfy these constraints. This paper proposes a new transformational approach for performance optimization. This approach consists of an ordered set of transformations, including algebraic transformations, loop unrolling, and retiming/pipelining, aimed at speeding up both recursive and non-recursive, us well as linear and non-linear applications. Impressive and close to optimal speed-up's have been obtained for a large range of benchmark examples.<<ETX>>","PeriodicalId":244297,"journal":{"name":"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133795304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-02-28DOI: 10.1109/EDTC.1994.326919
Gunnar Bartels, P. M. Kist, Kees Schot, M. Sim
A test harness is a system for testing the reliability of electronic CAD systems (ECADS). Modern ECADS's utilize a framework component for basic services. Since frameworks were originally applied to ECADS's, little is known about the framework requirements for supporting a test harness. Previous work shows that the framework's design data manager can be used. We conclude here that a design flow manager, with slight adaptations, can be used as well. We provide a motivated list of flow requirements, give insight into good and bad features and discuss implementation aspects.<>
{"title":"Flow management requirements of a test harness for testing the reliability of an electronic CAD system","authors":"Gunnar Bartels, P. M. Kist, Kees Schot, M. Sim","doi":"10.1109/EDTC.1994.326919","DOIUrl":"https://doi.org/10.1109/EDTC.1994.326919","url":null,"abstract":"A test harness is a system for testing the reliability of electronic CAD systems (ECADS). Modern ECADS's utilize a framework component for basic services. Since frameworks were originally applied to ECADS's, little is known about the framework requirements for supporting a test harness. Previous work shows that the framework's design data manager can be used. We conclude here that a design flow manager, with slight adaptations, can be used as well. We provide a motivated list of flow requirements, give insight into good and bad features and discuss implementation aspects.<<ETX>>","PeriodicalId":244297,"journal":{"name":"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130410774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-02-28DOI: 10.1109/EDTC.1994.326874
O. Haberl, T. Kropf
In this paper we present the PMSC (Programmable Module Selftest Controller) chip, which realizes an intelligent module test and maintenance (MTM) bus interface for boards as specified in the IEEE 1149.5 standard. Using the standardized "Reset Module with SBIT" command the PMSC chip performs a complete self test of the whole board, which includes the test of all interconnects and all chips. We support chips with a self test capability as well as chips without self test since the PMSC chip allows on-line test pattern generation and test response evaluation.<>
本文提出了PMSC(可编程模块自测控制器)芯片，该芯片实现了IEEE 1149.5标准中主板的智能模块测试与维护(MTM)总线接口。使用标准化的“Reset Module with SBIT”命令，PMSC芯片对整个板进行完整的自检，包括所有互连和所有芯片的测试。我们支持具有自检能力的芯片以及没有自检的芯片，因为PMSC芯片允许在线测试模式生成和测试响应评估。
{"title":"Self testable boards with standard IEEE 1149.5 module test and maintenance (MTM) bus interface","authors":"O. Haberl, T. Kropf","doi":"10.1109/EDTC.1994.326874","DOIUrl":"https://doi.org/10.1109/EDTC.1994.326874","url":null,"abstract":"In this paper we present the PMSC (Programmable Module Selftest Controller) chip, which realizes an intelligent module test and maintenance (MTM) bus interface for boards as specified in the IEEE 1149.5 standard. Using the standardized \"Reset Module with SBIT\" command the PMSC chip performs a complete self test of the whole board, which includes the test of all interconnects and all chips. We support chips with a self test capability as well as chips without self test since the PMSC chip allows on-line test pattern generation and test response evaluation.<<ETX>>","PeriodicalId":244297,"journal":{"name":"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132590940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-02-28DOI: 10.1109/EDTC.1994.326845
H. Esbensen, P. Mazumder
A genetic algorithm (GA) for the Steiner Problem in a graph (SPG) is presented, and its application to global routing of VLSI layouts discussed. In this context the GA's capability to provide several distinct high-quality solutions to a given problem is very advantageous. The performance of the algorithm is compared to that of two heuristics from the literature. The GA is clearly superior in terms of result quality while also being competitive with respect to runtime.<>
{"title":"A genetic algorithm for the Steiner Problem in a graph","authors":"H. Esbensen, P. Mazumder","doi":"10.1109/EDTC.1994.326845","DOIUrl":"https://doi.org/10.1109/EDTC.1994.326845","url":null,"abstract":"A genetic algorithm (GA) for the Steiner Problem in a graph (SPG) is presented, and its application to global routing of VLSI layouts discussed. In this context the GA's capability to provide several distinct high-quality solutions to a given problem is very advantageous. The performance of the algorithm is compared to that of two heuristics from the literature. The GA is clearly superior in terms of result quality while also being competitive with respect to runtime.<<ETX>>","PeriodicalId":244297,"journal":{"name":"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133337609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：