S. Nakatake, K. Sakanushi, Y. Kajitani, M. Kawakita
{"title":"The channeled-BSG: a universal floorplan for simultaneous place/route with IC applications","authors":"S. Nakatake, K. Sakanushi, Y. Kajitani, M. Kawakita","doi":"10.1145/288548.289064","DOIUrl":"https://doi.org/10.1145/288548.289064","url":null,"abstract":"The BSG based packing of rectangles has been shown a breakthrough in problem size and generality, if routing is not involved. In order to include the routing, we define the channeled-BSG by associating the BSG-segs with channels. On the channeled-BSG, a new operation, flip, transforms an initial routing to another. Together with a formula that estimates the worst case width of channels for a given global routing, a solution space of simultaneous placement and routing is realized. It is proved that the space contains an optimal solution within the framework of the model. To search the space for a better solution, simulated annealing is implemented. Experiments to industrial data of analog LSIs showed a promising performance.","PeriodicalId":224802,"journal":{"name":"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124659133","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":"Analysis of watermarking techniques for graph coloring problem","authors":"Gang Qu, M. Potkonjak","doi":"10.1145/288548.288607","DOIUrl":"https://doi.org/10.1145/288548.288607","url":null,"abstract":"We lay out a theoretical framework to evaluate watermarking techniques for intellectual property protection (IPP). Based on this framework, we analyze two watermarking techniques for the graph coloring (GC) problem. Since credibility and overhead are the most important criteria for any efficient watermarking technique, we derive formulae that illustrate the trade-off between credibility and overhead. Asymptotically we prove that arbitrarily high credibility can be achieved with at most 1-color-overhead for both proposed watermarking techniques.","PeriodicalId":224802,"journal":{"name":"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126780137","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":"Proposal of a timing model for CMOS logic gates driving a CRC /spl pi/ load","authors":"A. Hirata, H. Onodera, K. Tamaru","doi":"10.1145/288548.289083","DOIUrl":"https://doi.org/10.1145/288548.289083","url":null,"abstract":"We present a gate delay model of CMOS logic gates driving a CRC /spl pi/ load for deep sub-micron technology. Our approach is to replace series-parallel connected MOSFETs to an equivalent MOSFET and calculate the output waveform by an analytically derived formula. We present a MOSFET drain current model improved from the n-th power law MOSFET model to represent the characteristic of the equivalent inverter accurately. The accuracy of our gate delay model is evaluated in several gates under various conditions of input transition time and CRC parameters. The maximum error is less than 10.3% in the experiments. Our approach contributes to fast and accurate estimation of circuit speed under various supply voltage, which will enable us to optimize the circuit speed and power dissipation.","PeriodicalId":224802,"journal":{"name":"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127472347","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}
Pai H. Chou, Ken Hines, K. Partridge, G. Borriello
{"title":"Control generation for embedded systems based on composition of modal processes","authors":"Pai H. Chou, Ken Hines, K. Partridge, G. Borriello","doi":"10.1145/288548.288559","DOIUrl":"https://doi.org/10.1145/288548.288559","url":null,"abstract":"In traditional distributed embedded system designs, control information is often replicated across several processes and kept coherent by application-specific mechanisms. Consequently, processes cannot be reused in a new system without tailoring the code to deal with the new system's control information. The modal process framework provides a high-level way to specify the coherence of replicated control information independently of the behavior of the processes. Thus multiple processes can be composed without internal tailoring and without suffering from errors common in lower-level specification styles. This paper first describes a kernel-language representation for the high-level composition operators; it also presents a synthesis algorithm for the mode manager, the runtime code that maintains control information coherence within and between distributed processors.","PeriodicalId":224802,"journal":{"name":"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114932329","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":"Removal of memory access bottlenecks for scheduling control-flow intensive behavioral descriptions","authors":"S. Ravi, G. Lakshminarayana, N. Jha","doi":"10.1145/288548.289089","DOIUrl":"https://doi.org/10.1145/288548.289089","url":null,"abstract":"Application domains like signal and image processing, multimedia and networking protocols involve processing of huge amounts of data stored in memory modules. The behavioral descriptions of these applications may contain a large number of array references for data accesses. Dependencies between array accesses cause bottlenecks in the derivation of high performance schedules. We introduce a scheduling integrated technique to identify and remove these bottlenecks. We first demonstrate that there is a significant loss in the quality of a scheduler if these bottlenecks are not taken into account by the scheduler. We then propose a technique to overcome these bottlenecks by introducing new operations in the schedule called verification operations. Experimental results on several benchmarks show that a scheduler. powered by our technique demonstrates a two fold improvement in performance (measured in terms of the average number of clock cycles) over a recently introduced scheduler for control flow intensive behavioral descriptions, called Wavesched. Wavesched itself has a two fold performance advantage over traditional methods such as path based scheduling and loop directed scheduling. Also, the best- and worst-case execution times for the enhanced schedules obtained by our method are usually equal to or much less than the corresponding values for the execution times obtained by previous schedulers.","PeriodicalId":224802,"journal":{"name":"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133724435","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":"Symbolic model checking of process networks using interval diagram techniques","authors":"Karsten Strehl, Lothar Thiele","doi":"10.1145/288548.289117","DOIUrl":"https://doi.org/10.1145/288548.289117","url":null,"abstract":"In this paper, an approach to symbolic model checking of process networks is introduced. It is based on interval decision diagrams (IDDs), a representation of multi-valued functions. Compared to other model checking strategies, IDDs show some important properties that enable the verification of process networks more adequately than with conventional approaches. Additionally, applications concerning scheduling are shown. A new form of transition relation representation called interval mapping diagrams (IMDs)-and their less general version predicate action diagrams (PADs)-are explained together with the corresponding methods.","PeriodicalId":224802,"journal":{"name":"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130526342","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":"Synthesis of BIST hardware for performance testing of MCM interconnections","authors":"R. Pendurkar, A. Chatterjee, Y. Zorian","doi":"10.1145/288548.288562","DOIUrl":"https://doi.org/10.1145/288548.288562","url":null,"abstract":"The issue of performance testing of MCM interconnections is becoming very important due to the fact that hitherto \"second order\" effects such as ground bounce, crosstalk and switching noise are playing dominant roles in current design methods due to shrinking dimensions, lower supply voltages, higher clock speeds and higher density packaging. We propose a novel scheme for synthesizing nonlinear feedback shift register structures that can be superimposed on the boundary scan cells of ICs to generate MCM interconnect switching activities that resemble real life interconnect switching profiles. The goal is to perform at speed MCM interconnect test while simultaneously capturing the dynamic switching effects referred to earlier as accurately as possible during interconnect BIST. A library of nonlinear feedback shift register structures called Precharacterized Test Pattern Generators (P-TPG) is constructed. Components of P-TPGs are interconnected together in specific ways to recreate the switching activity profile of the interconnections being tested. An optimization algorithm for matching the P-TPG component activity profiles with those of the interconnections under test has been designed, and implemented experimental results confirm the validity of our approach.","PeriodicalId":224802,"journal":{"name":"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133219315","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 DC root solving algorithm with guaranteed convergence for analog integrated CMOS circuits","authors":"F. Leyn, G. Gielen, W. Sansen","doi":"10.1145/288548.288629","DOIUrl":"https://doi.org/10.1145/288548.288629","url":null,"abstract":"The paper describes a new DC modeling methodology applicable to CMOS integrated circuits. It is named operating point driven DC formulation because the operating point is specified directly, and the device dimensions W and L are determined out of it. With other methods, one specifies the device dimensions W and L and determines the operating point. Our method is important for manual design because it allows the designer to reason in terms of voltages and currents and relieves him from the burden of determining device sizes. The algorithm is guaranteed to converge, and is computationally efficient, which allows interactive design space exploration using optimization based sizing. A design plan used in optimization based sizing consists for the largest part out of solving the DC part. Speeding up the DC part with a computationally efficient algorithm that allows parallelisation, results in a boost of optimization speed.","PeriodicalId":224802,"journal":{"name":"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121058842","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":"Hardware/software co-synthesis with memory hierarchies","authors":"Yanbing Li, W. Wolf","doi":"10.1145/288548.289066","DOIUrl":"https://doi.org/10.1145/288548.289066","url":null,"abstract":"The paper introduces the first hardware/software co-synthesis algorithm of distributed real time systems that optimizes memory hierarchy along with the rest of the architecture. Our algorithm synthesize a set of real time tasks with data dependencies onto a heterogeneous multiprocessor architecture that meets the performance constraints with minimized cost. Our algorithm chooses cache sizes and allocates tasks to caches as part of co-synthesis. Experimental results, including examples from the literature and results on an MPEG-2 encoder, show that our algorithm is efficient and compared with existing algorithms, and it can reduce the overall cost of the synthesized system.","PeriodicalId":224802,"journal":{"name":"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128626691","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":"GPCAD: a tool for CMOS op-amp synthesis","authors":"M. del Mar Hershenson, Stephen P. Boyd, T. Lee","doi":"10.1145/288548.288628","DOIUrl":"https://doi.org/10.1145/288548.288628","url":null,"abstract":"We present a method for optimizing and automating component and transistor sizing for CMOS operational amplifiers. We observe that a wide variety of performance measures can be formulated as posynomial functions of the design variables. As a result, amplifier design problems can be formulated as a geometric program, a special type of convex optimization problem for which very efficient global optimization methods have recently been developed. The synthesis method is therefore fast, and determines the globally optimal design; in particular the final solution is completely independent of the starting point (which can even be infeasible), and infeasible specifications are unambiguously detected. After briefly introducing the method, which is described in more detail by M. Hershenson et al., we show how the method can be applied to six common op-amp architectures, and give several example designs.","PeriodicalId":224802,"journal":{"name":"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116925957","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}