{"title":"VLSI design parsing","authors":"A. Tyagi","doi":"10.1109/ICCAD.1992.279402","DOIUrl":"https://doi.org/10.1109/ICCAD.1992.279402","url":null,"abstract":"The feasibility and efficiency of design parsing are discussed. Design parsing refers to the process of parsing a flat netlist or logic description into a behaviorally equivalent flow graph where the nodes correspond to higher-level primitives such as arithmetic functions and a prespecified set of functions. It is useful in verification, resynthesis and computer-aided design documentation. A spatial-entropy-based dynamic signature that helps determine the boundaries and types of function blocks is presented.<<ETX>>","PeriodicalId":229577,"journal":{"name":"1992 IEEE/ACM International Conference on Computer-Aided Design","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115205769","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":"Aesthetic routing for transistor schematics","authors":"Tsung D. Lee, L. McNamee","doi":"10.1109/ICCAD.1992.279400","DOIUrl":"https://doi.org/10.1109/ICCAD.1992.279400","url":null,"abstract":"A heuristic routing approach for generating transistor schematic diagrams is presented. The method consists of two steps: global routing and channel routing. The global routing step partitions and routes the interconnections, into three levels of abstraction with domain knowledge. It forms desirable intra-block routing styles and local connection patterns, and achieves a reduction of net bends and lengths. Channel routing minimizes net crossovers by applying decycling and ordering techniques achieving nonoverlapping routing with a small number of net crossovers.<<ETX>>","PeriodicalId":229577,"journal":{"name":"1992 IEEE/ACM International Conference on Computer-Aided Design","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116706877","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}
So-Zen Yao, Nan-Chi Chou, Chung-Kuan Cheng, T. C. Hu
{"title":"An optimal probe testing algorithm for the connectivity verification of MCM substrates","authors":"So-Zen Yao, Nan-Chi Chou, Chung-Kuan Cheng, T. C. Hu","doi":"10.1109/ICCAD.1992.279363","DOIUrl":"https://doi.org/10.1109/ICCAD.1992.279363","url":null,"abstract":"The k-probe testing methodology is an effective approach to detect open and short faults in MCM substrates. An algorithm which generates the minimum number of tests for complete open fault coverage is proposed. For k equals two, the algorithm is able to reduce the test size by up to 50% compared with that generated by an ordinary approach. A multidimensional traveling salesman problem formulation is developed to optimize probe routes. The approach has been tested on substrate testers and has achieved excellent results.<<ETX>>","PeriodicalId":229577,"journal":{"name":"1992 IEEE/ACM International Conference on Computer-Aided Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117050087","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}
A. V. D. Werf, M. Peek, E. Aarts, J. V. Meerbergen, P. Lippens, W. Verhaegh
{"title":"Area optimization of multi-functional processing units","authors":"A. V. D. Werf, M. Peek, E. Aarts, J. V. Meerbergen, P. Lippens, W. Verhaegh","doi":"10.1109/ICCAD.1992.279358","DOIUrl":"https://doi.org/10.1109/ICCAD.1992.279358","url":null,"abstract":"Functions executed by a multifunctional processing unit (PU) correspond to clusters of operations in the specification, which are represented as signal flow graphs (SFGs). Because of high-throughput demands, the operations of each SFG are executed in parallel. Since operations for only one of the SFGs are executed at a given time, operations belonging to different SFGs can be executed on the same operator. Here, the most important part of the mapping of several SFGs onto one PU, which is the assignment of the SFGs operations to the PU's operators, given a number of allocated operators, is considered. The problem is to find an operator assignment that minimizes the silicon area that is occupied by the PU's interconnection consisting of multiplexers and wires. An approach based on local search algorithms such as iterative improvement and simulated annealing is presented. Although these algorithms are known to be generally applicable, it is shown that detailed knowledge of the operator assignment problem is required to obtain good results within acceptable CPU time limits for large problem instances.<<ETX>>","PeriodicalId":229577,"journal":{"name":"1992 IEEE/ACM International Conference on Computer-Aided Design","volume":"119 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120939295","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":"On the verification of state-coding in STGs","authors":"Kuan-Jen Lin, Chen-Shang Lin","doi":"10.1109/ICCAD.1992.279388","DOIUrl":"https://doi.org/10.1109/ICCAD.1992.279388","url":null,"abstract":"Theoretical foundations and a verification procedure based on the transitive lock relation are developed to solve the state coding problem wholly on the signal transition graph (STG) domain for STGs containing multicycle signals and conditional behaviors. The problem considered is realizable state coding, which is a more relaxed requirement than unique state coding. For STGs with multicycle signals, single-cycle transformation is proposed to transform the problem into one with single-cycle signals. For STGs with conditional behaviors, two operations, branch reversing and self-loop unfolding, are proposed to significantly simplify the verification process. The proposed algorithmic approaches have been shown to be successful on over 30 examples from academia and industry.<<ETX>>","PeriodicalId":229577,"journal":{"name":"1992 IEEE/ACM International Conference on Computer-Aided Design","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125011124","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}
Ronn B. Brashear, D. Holberg, M. R. Mercer, L. Pileggi
{"title":"ETA: electrical-level timing analysis","authors":"Ronn B. Brashear, D. Holberg, M. R. Mercer, L. Pileggi","doi":"10.1109/ICCAD.1992.279364","DOIUrl":"https://doi.org/10.1109/ICCAD.1992.279364","url":null,"abstract":"A timing analyzer which performs timing analysis considering electrical-level details such as input signal slope, gate input distinction, charge sharing, and interconnect, while also taking into account such high-level concerns as path sensitization, is described. To achieve the greatest efficiency, ETA operates in two phases: (1) logic and delay precharacterization, and (2) longest path analysis. During the precharacterization phase, each gate is analyzed to get its Boolean function and its load at the transistor level. During the longest path analysis phase, paths from each primary input are enumerated and examined separately. Each potentially longest path is tested for sensitizability at the gate level until a sensitizable longest path is found. The circuit examples given demonstrate the importance of an accurate delay calculation in correctly finding the longest statistically sensitizable path.<<ETX>>","PeriodicalId":229577,"journal":{"name":"1992 IEEE/ACM International Conference on Computer-Aided Design","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123310577","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":"Accurate net models for placement improvement by network flow methods","authors":"Konrad Doll, F. Johannes, G. Sigl","doi":"10.1109/ICCAD.1992.279307","DOIUrl":"https://doi.org/10.1109/ICCAD.1992.279307","url":null,"abstract":"An efficient iterative improvement procedure for row based cell placement is described. Special emphasis is placed on the objective function used to model net lengths. It is shown that minimizing the net length estimated with the net model also minimizes the half perimeter of a rectangle enclosing all pins of a net. Contrary to the half perimeter the new objective function permits computation of costs for assigning cells to locations independently for all cells to be placed simultaneously. This provides the algorithm an important advantage compared to other iterative improvement techniques: many cells can be placed simultaneously by formulating placement as a network flow problem. The algorithm is superior to Timber-WolfSC 5.4, which minimizes the half perimeter.<<ETX>>","PeriodicalId":229577,"journal":{"name":"1992 IEEE/ACM International Conference on Computer-Aided Design","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123578315","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":"Lazy-expansion symbolic expression approximation in SYNAP","authors":"S. Seda, M. Degrauwe, W. Fichtner","doi":"10.1109/ICCAD.1992.279355","DOIUrl":"https://doi.org/10.1109/ICCAD.1992.279355","url":null,"abstract":"A lazy-expansion technique for generating small approximate symbolic analog circuit analysis expressions is described. Statistics for this technique as implemented in the symbolic analysis program SYNAP are presented and show a two order-of-magnitude speed improvement (on larger circuits) as compared with traditional full-expansion techniques. This technique also allows larger circuits to be analyzed. Methods used in SYNAP for eliminating pole and zero movement at the design point and for handling variables representing device mismatches are also presented.<<ETX>>","PeriodicalId":229577,"journal":{"name":"1992 IEEE/ACM International Conference on Computer-Aided Design","volume":"330 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116528476","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":"Automatic synthesis of 3D asynchronous state machines","authors":"K. Yun, D. Dill","doi":"10.1109/ICCAD.1992.279310","DOIUrl":"https://doi.org/10.1109/ICCAD.1992.279310","url":null,"abstract":"An automatic synthesis tool (3D) for designing asynchronous controllers from burst-mode specifications, a class of specifications allowing multiple input change fundamental mode operation, is described. An algorithm for constructing a three-dimensional next-state table, a heuristic for encoding states, and a procedure for generating necessary constraints for exact logic minimization are presented. The effectiveness of the 3D implementation and the synthesis procedure on numerous designs including a large realistic example (asynchronous data transfer protocol of the SCSI bus controller) is demonstrated. The latency (input to output delay) and the cycle time (time required for the circuit to stabilize after the excitation) for all benchmark designs using a 0.8- mu m CMOS standard cell library are estimated.<<ETX>>","PeriodicalId":229577,"journal":{"name":"1992 IEEE/ACM International Conference on Computer-Aided Design","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121909996","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":"Equivalent design representations and transformations for interactive scheduling","authors":"R. Ang, N. Dutt","doi":"10.1109/ICCAD.1992.279351","DOIUrl":"https://doi.org/10.1109/ICCAD.1992.279351","url":null,"abstract":"It is pointed out that high-level synthesis (HLS) requires more designer interaction to better meet the needs of experienced designers. However, attempts to create a highly interactive synthesis process are hampered by incompatibility of various representations used during synthesis. To overcome this problem, equivalent representations are needed, as well as equivalence-preserving synthesis transformations. The structured finite state machine (SFSM) design model for scheduled behavior is presented, its equivalence to the control data flow graph (CDFG) model is shown, and primitive behavior-preserving transformations for scheduling are defined. This model and these transformations have been integrated into the BIF interactive environment to permit manual rescheduling of a design.<<ETX>>","PeriodicalId":229577,"journal":{"name":"1992 IEEE/ACM International Conference on Computer-Aided Design","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129215159","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}