{"title":"VLSI CMOS implementation of the shuffleout ATM switch interconnection matrix","authors":"F. Masetti, R. Castellan, M. Porta","doi":"10.1109/ASIC.1992.270300","DOIUrl":"https://doi.org/10.1109/ASIC.1992.270300","url":null,"abstract":"The VLSI design and implementation of the shuffleout broadband switch interconnection matrix are described in order to show its feasibility with current CMOS technology. It satisfies simultaneously the requirements for ATM switching and for ASIC industrial manufacturing. The shuffleout routing principles are briefly summarized and the design approach is discussed. The switching element major blocks are described and the performance, complexity, and testability of the resulting chip are illustrated with considerations on the different layout approaches and methodologies. Some conclusions based on the results obtained are summarized.<<ETX>>","PeriodicalId":211702,"journal":{"name":"[1992] Proceedings. Fifth Annual IEEE International ASIC Conference and Exhibit","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127873321","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}
Eui-Young Chung, Byungha Joo, Y. Lee, Kyung-Ho Kim, San-Hoon Lee
{"title":"Advanced delay analysis method for submicron ASIC technology","authors":"Eui-Young Chung, Byungha Joo, Y. Lee, Kyung-Ho Kim, San-Hoon Lee","doi":"10.1109/ASIC.1992.270245","DOIUrl":"https://doi.org/10.1109/ASIC.1992.270245","url":null,"abstract":"A new ASIC delay analysis method is presented, in which a two-dimensional delay table model is used for cells and the tailored circuit simulation is used for wires. Input waveform slope and load capacitance play important roles in the variation of cell delay. In the case of an arbitrary RC tree load, the equivalent load capacitance is calculated by using a node reduction technique and the proposed equation. This model preserves accurate delay estimation, typically within 3% compared to that of HSPICE.<<ETX>>","PeriodicalId":211702,"journal":{"name":"[1992] Proceedings. Fifth Annual IEEE International ASIC Conference and Exhibit","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114368286","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":"Robin Hood: a system timing verifier for multi-phase level-sensitive clock designs","authors":"R. Tsay, I. Lin","doi":"10.1109/ASIC.1992.270209","DOIUrl":"https://doi.org/10.1109/ASIC.1992.270209","url":null,"abstract":"An efficient system timing verification approach that employs latch graph representation is reported. It is a general approach that can handle most blocking schemes. Both early and late mode timing constraints are considered. The tool generates a detailed stack report to help designers identify where and how much the correction should be in case of violations. The algorithm has been implemented and tested on several real designs. An example with 1926 latches and dense interconnections is verified in 0.62 s.<<ETX>>","PeriodicalId":211702,"journal":{"name":"[1992] Proceedings. Fifth Annual IEEE International ASIC Conference and Exhibit","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126687230","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":"An implementation of a clock-tree distribution scheme for high-performance ASICs","authors":"A. Erdal, M. Yue, L. Hiramoto, J. Stahler","doi":"10.1109/ASIC.1992.270314","DOIUrl":"https://doi.org/10.1109/ASIC.1992.270314","url":null,"abstract":"An implementation of a multilevel balanced clock-tree distribution scheme that improves the performance of ASICs considerably is described. Layout process and the CAD tools are briefly described, and the results are tabulated for differing complexities of real customer designs. The focus of this clock-tree distribution scheme is on minimizing the clock skew, on reducing the total clock delay from the clock driver to a clock pin, on improving rise/fall times, and on minimizing the silicon area consumed by the clock circuitry.<<ETX>>","PeriodicalId":211702,"journal":{"name":"[1992] Proceedings. Fifth Annual IEEE International ASIC Conference and Exhibit","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127476257","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":"Teaching ASIC design with FPGAs","authors":"D. M. Perkins, P.C.M. Burton","doi":"10.1109/ASIC.1992.270236","DOIUrl":"https://doi.org/10.1109/ASIC.1992.270236","url":null,"abstract":"The University of Southern Colorado has developed a VLSI design program that has been used in several courses and design projects. ASICs employing field programmable gate array (FPGA) technologies are used for implementation of the resulting designs. Designs of a 4-b computer, a microcode CPU, and a floating point coprocessor are discussed. FPGA reprogrammability and fast turn-around times have proven ideal for the educational environment.<<ETX>>","PeriodicalId":211702,"journal":{"name":"[1992] Proceedings. Fifth Annual IEEE International ASIC Conference and Exhibit","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127498872","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":"Physical synthesis for performance optimization","authors":"R. P. Pokala, R. A. Feretich, R. McGuffin","doi":"10.1109/ASIC.1992.270312","DOIUrl":"https://doi.org/10.1109/ASIC.1992.270312","url":null,"abstract":"Three physical synthesis tools that improve the performance and routability of high-end gate array ASICs are described. The first tool orders scan rings efficiently after placement. The second tool groups single-bit flip-flops into multiple-bit hard-wired flip-flops macros in order to reduce clock delays and skews. The third tool commutes nets to improve performance without affecting functionality.<<ETX>>","PeriodicalId":211702,"journal":{"name":"[1992] Proceedings. Fifth Annual IEEE International ASIC Conference and Exhibit","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125048567","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":"A 0.65 mu m, low-voltage/low-power optimized CMOS gate array","authors":"U. Ko, S. Schenck, F. Svejda, S. La","doi":"10.1109/ASIC.1992.270252","DOIUrl":"https://doi.org/10.1109/ASIC.1992.270252","url":null,"abstract":"A 2.7-V to 3.6-V CMOS gate array with 0.65- mu m effective gate length has been developed with an average power of 0.7 mu W/gate/MHz and an inverter delay of 184 ps under two standard loads. The 3.3-V optimized compact base cell consists of two large and two small p- and n-channel transistors and achieves a density of one memory bit per base cell; typical memory access time is 7.3 ns. Library characteristics indicate 75% of device power can be conserved by decreasing the device supply voltage from 5 V to 3.3 V.<<ETX>>","PeriodicalId":211702,"journal":{"name":"[1992] Proceedings. Fifth Annual IEEE International ASIC Conference and Exhibit","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123294858","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":"A minimal hardware overhead BIST data compaction scheme","authors":"Y. Wu, A. Ivanov","doi":"10.1109/ASIC.1992.270217","DOIUrl":"https://doi.org/10.1109/ASIC.1992.270217","url":null,"abstract":"Existing data compaction schemes for built-in self-test (BIST) usually impose substantial hardware overhead. A minimal hardware overhead data compaction scheme is proposed that can achieve reasonably small aliasing with a hardware requirement as low as a one-stage linear feedback shift register (LFSR). Multiple signatures are checked, and all reference-signatures are made identical resulting in simple circuitry for checking the signatures. The proposed scheme is based on a simple manipulation of the fault-free output sequences from the circuit under test.<<ETX>>","PeriodicalId":211702,"journal":{"name":"[1992] Proceedings. Fifth Annual IEEE International ASIC Conference and Exhibit","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116603397","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":"An efficient MOS VLSI timing simulator on parallel computers","authors":"S.S. Chung, T.-S. Chang","doi":"10.1109/ASIC.1992.270214","DOIUrl":"https://doi.org/10.1109/ASIC.1992.270214","url":null,"abstract":"A new timing simulator for MOS VLSI circuits has been developed. It is capable of performing accurate transient analysis, simulating large circuits, and improving the simulation speed. For simulating tightly coupled circuits, floating capacitors are used, and accuracy can be preserved. an efficient subcircuit model with latency exploitation is employed to reduce the simulation time. Benchmark tests on multiprocessors show that the simulation speed is about an order of speed faster than that of single CPUs for a number of circuits.<<ETX>>","PeriodicalId":211702,"journal":{"name":"[1992] Proceedings. Fifth Annual IEEE International ASIC Conference and Exhibit","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114632201","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":"Minimum skew multiple clock routing in synchronous ASIC systems","authors":"W. Khan, M. Hossain, N. Sherwani","doi":"10.1109/ASIC.1992.270315","DOIUrl":"https://doi.org/10.1109/ASIC.1992.270315","url":null,"abstract":"The problem of routing in the multiple clock environment is more complicated than a single clock environment. An efficient algorithm to obtain minimum skew layout for two clocks in a synchronous system is presented. The algorithm is tested on several industrial benchmarks with promising results. The routing layouts achieve almost zero skew, while using a minimum wire length for multiple clock routing.<<ETX>>","PeriodicalId":211702,"journal":{"name":"[1992] Proceedings. Fifth Annual IEEE International ASIC Conference and Exhibit","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134394225","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}