{"title":"A Gate Level Model for CMOS Combinational Logic Circuits with Application to Fault Detection","authors":"S. Reddy, V. Agrawal, Sunil K. Jain","doi":"10.1109/DAC.1984.1585845","DOIUrl":"https://doi.org/10.1109/DAC.1984.1585845","url":null,"abstract":"A procedure to derive gate level equivalent circuits for CMOS combinational logic circuits is given. The procedure leads to a model containing AND, OR and NOT gates. Specifically it does not require memory elements as does an earlier model and also uses fewer gates. It is shown that tests for classical stuck-at-0 and stuck-at-1 faults in the equivalent circuit can be used to detect line stuck-at, stuck-open and stuck-on faults in the modeled CMOS circuit.","PeriodicalId":188431,"journal":{"name":"21st Design Automation Conference Proceedings","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123378264","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}
D. Etiemble, V. Adeline, Nguyen H. Duyet, J. Ballegeer
{"title":"Micro-Computer Oriented Algorithms for Delay Evaluation of MOS Gates","authors":"D. Etiemble, V. Adeline, Nguyen H. Duyet, J. Ballegeer","doi":"10.1109/DAC.1984.1585819","DOIUrl":"https://doi.org/10.1109/DAC.1984.1585819","url":null,"abstract":"We present microcomputer-oriented algorithms to calculate very quickly the switching times and propagation delays of basic CMOS and NMOS gates. The results show less than 10% difference with model 1 SPICE 2-G results.","PeriodicalId":188431,"journal":{"name":"21st Design Automation Conference Proceedings","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123650000","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}
{"title":"Workshop The Semi-Custom Revolution: How to Thrive or Survive","authors":"A. Zingale, F. Kohn, F. Lynch, D. Kalbarsh","doi":"10.1109/DAC.1984.1585824","DOIUrl":"https://doi.org/10.1109/DAC.1984.1585824","url":null,"abstract":"","PeriodicalId":188431,"journal":{"name":"21st Design Automation Conference Proceedings","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122967514","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}
{"title":"Test Generation for LSI: A Case Study","authors":"M. Abadir, H. K. Reghbati","doi":"10.1109/DAC.1984.1585793","DOIUrl":"https://doi.org/10.1109/DAC.1984.1585793","url":null,"abstract":"A new automatic test generation approach for LSI circuits has been presented in the companion papers [1] [2]. In this paper we generate tests for a typical LSI circuit using the new approach. The goal of this study is to gain insight into the problems involved in using the test generation procedures. A formal model C for a 1-bit microprocessor slice is defined which has all the main features of commercially available bit slices such as the Am2901. The circuit C is modeled as a network of interconnected functional modules. The functions of the individual modules are described using binary decision diagrams, or equivalently using experiments derived from the diagrams. Using our test generation technique, we derive tests for the circuit C capable of detecting various faults covered by our fault model [1]. It is shown that backtracking is rarely needed while generating tests for C. Also, we show that generating a multiple vector test is not required for any of the faults considered in the study. The length of the circuit's test sequence is significantly reduced using the fault collapsing method. A discussion of how to model some of the features of LSI circuits that are not included in the circuit C is presented. A comparison between the length of the test generated by our method and other manually-generated ones is also presented.","PeriodicalId":188431,"journal":{"name":"21st Design Automation Conference Proceedings","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123140977","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}
T. Shinsha, T. Kubo, M. Hikosaka, K. Akiyama, K. Ishihara
{"title":"POLARIS: Polarity Propagation Algorithm for Combinational Logic Synthesis","authors":"T. Shinsha, T. Kubo, M. Hikosaka, K. Akiyama, K. Ishihara","doi":"10.1109/DAC.1984.1585814","DOIUrl":"https://doi.org/10.1109/DAC.1984.1585814","url":null,"abstract":"A new algorithm for combinational logic synthesis, POLARIS, is described. POLARIS automatically generates optimized gate level logic from functional level specification described by Boolean expressions. It transforms the Boolean expressions into logical operator trees, and produces a network of physical units or units of physical design by introducing polarity and propagating it along the tree. Experimental results show that more than 96% of gate level logic structures are equal to the logic structures designed by experts.","PeriodicalId":188431,"journal":{"name":"21st Design Automation Conference Proceedings","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126019562","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}
{"title":"Studying the Mouse for CAD Systems","authors":"L. A. Price","doi":"10.1109/DAC.1984.1585809","DOIUrl":"https://doi.org/10.1109/DAC.1984.1585809","url":null,"abstract":"Four experiments were conducted to test the suitability of the mouse as a pointing device for CAD systems. The experimental tasks included simultaneously pressing more than one button (chording), repeated clicking of a single button, and moving the mouse while one or more buttons are held down. Although subjects did prefer some styles of interaction over others, quantitative measures (completion time and error counts) indicate that people can successfully perform all requested actions. Use of the nonpreferred methods therefore may be appropriate in systems where it is desirable to provide the user with several alternate inputs. Designers who make this decision should be aware, however, that substantial system overhead is required to test for multiple clicking and chording.","PeriodicalId":188431,"journal":{"name":"21st Design Automation Conference Proceedings","volume":"2017 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127542842","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}
{"title":"Emerald: A Bus Style Designer","authors":"C. Tseng, D. Siewiorek","doi":"10.1109/DAC.1984.1585813","DOIUrl":"https://doi.org/10.1109/DAC.1984.1585813","url":null,"abstract":"This paper describes the development of a design generator. The design generator takes a behavioral description as its input and generates functional level structures as its output. Designs for two behavioral descriptions are compared with commercial designs. On the average, the total number of gates required for the allocated data paths is 15 percent more than the commercial designs. Mechanisms for exploring alternative designs are provided. The design space for one of the examples is extensively investigated. Limitations of automated design are also discussed.","PeriodicalId":188431,"journal":{"name":"21st Design Automation Conference Proceedings","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128845119","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}
{"title":"Module Design Verification System","authors":"L. Wilkins","doi":"10.1109/DAC.1984.1585808","DOIUrl":"https://doi.org/10.1109/DAC.1984.1585808","url":null,"abstract":"Module Design Verification System (MDVS) was developed to handle the extremely large volume and complexity of multilayered ceramic substrate designs, which makes them highly prone to design errors and data management problems. MDVS consists of a substrate design database with its own part number catalog and the ability to absorb Engineering Design System (EDS) wiring to become a full module database. Under MDVS runs a complement of electrical and physical applications being controlled by the substrate designer through graphics menus. This system has proven to be a very valuable design verification, design debug and data management tool. It results in considerable savings in design cycle time and manpower.","PeriodicalId":188431,"journal":{"name":"21st Design Automation Conference Proceedings","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126802638","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}
{"title":"Optimization Techniques for Two-Dimensional Placement","authors":"L. Markov, J. Fox, J. Blank","doi":"10.1109/DAC.1984.1585871","DOIUrl":"https://doi.org/10.1109/DAC.1984.1585871","url":null,"abstract":"Present VLSI synthesis programs typically characterized as silicon compilers employ a predefined floorplan and fixed placement of functional elements. Significant broadening of the areas of application and more effective utilization of silicon space can be obtained by using a general placement of functionally clustered elements rather than a fixed floorplan. In this paper we present a new mathematical optimization technique to achieve a two-dimensional placement. The two-dimensional placement problem is the most important part of the hierarchical placement approach being considered by GTE Laboratories for its SilC Silicon Compiler. This paper describes a method of solving the placement problem in a mathematical form and an algorithm for optimization. The construction of a mathematical model and the use of optimization techniques represent the main distinction from heuristic placement procedures. The optimization technique guarantees a feasible placement at each iteration. It is also possible to determine at each stage how close the solution is to the optimum, and therefore the process may be stopped when the result is sufficiently close to optimum. A small, illustrative example of a two-dimensional placement problem was considered.","PeriodicalId":188431,"journal":{"name":"21st Design Automation Conference Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130544506","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}