{"title":"An alternative algorithm for high speed multiplication and addition using growing technique","authors":"R. Hashemian","doi":"10.1109/GLSV.1992.218355","DOIUrl":"https://doi.org/10.1109/GLSV.1992.218355","url":null,"abstract":"An alternative algorithm is presented for multiplication/addition of variable bit-size operands. The algorithm is shown to be fast, and the computational time is variable and dependent on the accuracy requested. The growing nature of the product term, during the course of operation, gives the method some unique computational properties. The algorithm is implemented for the design of 32*32-bit multiplier.<<ETX>>","PeriodicalId":179494,"journal":{"name":"[1992] Proceedings of the Second Great Lakes Symposium on VLSI","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130475909","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":"High performance data-path synthesis via communication metrics","authors":"A. Seawright, F. Brewer","doi":"10.1109/GLSV.1992.218364","DOIUrl":"https://doi.org/10.1109/GLSV.1992.218364","url":null,"abstract":"The authors present a novel decomposition of the high-level data-path synthesis problem taking as input scheduled procedural behavior and outputting geometrically placed and optimized linear data-paths. The technique uses communication based analysis to allow simultaneous synthesis of the placement, bindings, and RTL topology for high performance linear data-paths. In effect, the procedure creates an architecture and a layout with specified performance and cost constraints.<<ETX>>","PeriodicalId":179494,"journal":{"name":"[1992] Proceedings of the Second Great Lakes Symposium on VLSI","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117167766","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":"Axiomatic semantics of a hardware specification language","authors":"Xin Hua, Hantao Zhang","doi":"10.1109/GLSV.1992.218347","DOIUrl":"https://doi.org/10.1109/GLSV.1992.218347","url":null,"abstract":"Formal hardware design verification is to examine whether a structural specification of a circuit meets its behavioral specification. Despite the progress in formal verification, there is a big gap between hardware designers and verifiers, partially because there are no common specification languages for them to use. The authors show that formal semantics could bridge such a gap. By providing an axiomatic semantics to an existing hardware design language called the Iowa logic specification language (ILSL), the authors show that a circuit description in ILSL can be automatically converted into a set of first-order formulas which is the semantic description of the circuit and is acceptable by an existing theorem prover called the rewrite rule laboratory (RRL). In particular, they show how iterative statements of ILSL are converted into recursive functions of RLL. Their work thus results in a uniform specification language in which both hardware design and automatic verification can be done.<<ETX>>","PeriodicalId":179494,"journal":{"name":"[1992] Proceedings of the Second Great Lakes Symposium on VLSI","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127711088","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 detection and elimination of superfluous level-sensitive latches","authors":"G. Jennings","doi":"10.1109/GLSV.1992.218348","DOIUrl":"https://doi.org/10.1109/GLSV.1992.218348","url":null,"abstract":"The author describes an automated technique for defining, identifying, and removing superfluous level-sensitive latches in large circuits which may contain any number of clocks. The technique presented is based on a delay and function independent design methodology for level-sensitive latched circuits having completely general clocking schemes (n clocks, m phases). More precisely, the technique identifies superfluous clock transitions at each latch, so that superfluous clock waveforms may be simplified. If after transformation the clock waveform becomes identically enabled, then the latch itself may be removed and replaced by a dead short. Analysis complexity and experience with an implementation are discussed.<<ETX>>","PeriodicalId":179494,"journal":{"name":"[1992] Proceedings of the Second Great Lakes Symposium on VLSI","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121451247","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 heuristic for data path synthesis using multiport memories","authors":"I. Ahmad, C. Y. Chen","doi":"10.1109/GLSV.1992.218366","DOIUrl":"https://doi.org/10.1109/GLSV.1992.218366","url":null,"abstract":"Recently there has been a trend for the designer to group registers into register files for efficiently implementing large VLSI chips. Multiport memories provide an effective way for such an implementation. Interconnection minimization (such as multiplexers and tristate buffers) has become more difficult with the use of multiport memories. A heuristic is presented which performs functional units and connection allocation tasks simultaneously to get better results for application specific designs assuming that registers have already been grouped to multiport memories. Experiments on benchmarks show very promising results.<<ETX>>","PeriodicalId":179494,"journal":{"name":"[1992] Proceedings of the Second Great Lakes Symposium on VLSI","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122847560","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 asynchronous multiplier","authors":"Brenda Luderman, A. Albicki","doi":"10.1109/GLSV.1992.218358","DOIUrl":"https://doi.org/10.1109/GLSV.1992.218358","url":null,"abstract":"This paper discusses the design and performance of an 8-bit asynchronous multiplier. Self-timed adders with carry completion signals were implemented to create the asynchronous function of the multiplier. The technique of using bi-directional adders is incorporated in the design. One objective of this design was to estimate the longest multiplication time for a 2 mu m CMOS implementation of this 8-bit multiplier.<<ETX>>","PeriodicalId":179494,"journal":{"name":"[1992] Proceedings of the Second Great Lakes Symposium on VLSI","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128093834","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":"Quadtree interconnection network layout","authors":"S. Bhattacharya, Shekhar H. Kirani, W. Tsai","doi":"10.1109/GLSV.1992.218362","DOIUrl":"https://doi.org/10.1109/GLSV.1992.218362","url":null,"abstract":"Quadtree data structure has been used in a number of applications. However, VLSI embedding of quadtree based parallel architecture using grid model has not been studied. This paper studies VLSI embedding of quadtree using grid model. H-tree layout for binary tree is extended for trivial quadtree layout, followed by two layout strategies for rectangular grids. Two generic layout styles (standard layout and X-layout) are proposed for higher order grids (e.g., hexagonal and octagonal grids). Base tile layout patterns are proposed for area compaction with recursive X-layout. In each case, layout dimensions and I/O bandwidth are computed. The authors demonstrate how the two generic layouts can be mixed to obtain higher I/O bandwidth and estimate the area sacrifice. An improved recursive layout mixing strategy is proposed.<<ETX>>","PeriodicalId":179494,"journal":{"name":"[1992] Proceedings of the Second Great Lakes Symposium on VLSI","volume":"35 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123466142","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":"The Steiner tree problem with minimum number of vertices in graphs","authors":"K. Makki, N. Pissinou","doi":"10.1109/GLSV.1992.218344","DOIUrl":"https://doi.org/10.1109/GLSV.1992.218344","url":null,"abstract":"The Steiner tree problem is to find a tree in a connected undirected distance graph G=(V, E, d) which spans a given set S contained in V. The minimum Steiner tree for G and S is a tree which spans S with a minimum total distance on its edges. The authors consider a special case of the Steiner tree problem in graphs. For this problem they assume that the underlying graph G does not have any direct edge between the vertices in S contained in V. The problem is to find a tree in G which spans the vertices in S and uses minimum number of vertices in V-S.<<ETX>>","PeriodicalId":179494,"journal":{"name":"[1992] Proceedings of the Second Great Lakes Symposium on VLSI","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132707361","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 new algorithm for signal flow determination in CMOS VLSI","authors":"A. R. Baba-Ali","doi":"10.1109/GLSV.1992.218353","DOIUrl":"https://doi.org/10.1109/GLSV.1992.218353","url":null,"abstract":"This paper presents a new algorithm that automatically classifies transistors as bidirectionals or unidirectionals in any CMOS circuits. This algorithm uses simple rules based on node strength as well as local transistor direction and path informations. Because circuit transistors are processed in linear running time, this approach enables the algorithm to be fast.<<ETX>>","PeriodicalId":179494,"journal":{"name":"[1992] Proceedings of the Second Great Lakes Symposium on VLSI","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129907733","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":"Two-layer via-free routing in channels and switchboxes","authors":"Kuo-Feng Liao","doi":"10.1109/GLSV.1992.218360","DOIUrl":"https://doi.org/10.1109/GLSV.1992.218360","url":null,"abstract":"The author introduces the two-layer via-free routing problem (2LVFRP) and proposes an optimal algorithm to solve it. Given a set of nets (with terminals on the boundary) and two layers for routing them, the algorithm determines the layer assignment and detailed routing for each net such that no via is needed, if such solution exists.<<ETX>>","PeriodicalId":179494,"journal":{"name":"[1992] Proceedings of the Second Great Lakes Symposium on VLSI","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126687236","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}