Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Issue 12 • Dec. 1991

Filter Results

Displaying Results 1 - 13 of 13
  • Comments on "O(n/sup 2/) algorithms for graph planarization

    Publication Year: 1991, Page(s):1582 - 1583
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (143 KB)

    For the original article see ibid., vol.8, no.3, p.257-67 (1989). The commenters point out that their parallel algorithm provides the maximum planar subgraph, and they compare it to the maximal planar subgraph provided by R. Jayakumar et al. in the above-mentioned paper. The space-time product complexity is also compared.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized Scharfetter-Gummel method to eliminate crosswind effects [semiconduction device modeling]

    Publication Year: 1991, Page(s):1579 - 1582
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    A generalized Scharfetter-Gummel discretization method is proposed for semiconductor device modeling. Motivated by the classical Scharfetter-Gummel approach and the SUPG (streamline upwind/Petrov-Galerkin) method, an optimal nonlinear artificial diffusion term is added to the standard Galerkin finite element formula within a weighted residual form to construct the generalized Scharfetter-Gummel me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision problems for interacting finite state machines

    Publication Year: 1991, Page(s):1576 - 1579
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    Given a system of n interacting finite state machines (FSMs) and a state configuration, the reachability problem is to examine whether this configuration is reachable within the system. An investigation is made of the complexity of this decision problem and three of its derivatives, namely, (1) verifying system determination, (2) testing for the existence of unspecified inputs to any FSM ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A state assignment procedure for single-block implementation of state charts

    Publication Year: 1991, Page(s):1569 - 1576
    Cited by:  Papers (10)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    The authors presents a simple, single-block implementation scheme for state charts which uses a single conventional combinational-logic block and a state register. The most attractive feature of the proposed scheme is the absence of communication. It eliminates the need for communicating FSMs (finite state machines) owing to an older realization method, and does so without having to account for al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Small-signal analysis of MESFET including the energy conservation equation

    Publication Year: 1991, Page(s):1530 - 1533
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    The sinusoidal steady-state analysis (SSSA) method is applied to the energy transport model which solves the Poisson equation, the continuity equation, and the energy conservation equation. The SSSA method is used to obtain the AC solution of the GaAs MESFET in two dimensions. Comparison of the y-parameters for a GaAs MESFET calculated using the SSSA energy transport model and a two-dimen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing interacting finite state machines using sequential don't cares

    Publication Year: 1991, Page(s):1473 - 1484
    Cited by:  Papers (31)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1048 KB)

    Approaches are presented to multilevel sequential logic synthesis-algorithms and techniques for the area and performance optimizations of interconnected finite state machine descriptions. Techniques are presented for the exploitation of sequential don't cares in arbitrary, interconnected sequential machine structures. Exploiting these don't care sequences can results in significant improvements in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Single-fault fault-collapsing analysis in sequential logic circuits

    Publication Year: 1991, Page(s):1559 - 1568
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    A study is made of single-fault fault collapsing in sequential logic circuits. Two major phenomena, self-hiding (SH) and delayed reconvergence (DR), which arise from the existence of feedback paths and storage elements in sequential circuits, are analyzed and found to cause the dominance relationship which is valid in combinational circuits but no longer valid in sequential circuits. A fault-colla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved two-way partitioning algorithm with stable performance [VLSI]

    Publication Year: 1991, Page(s):1502 - 1511
    Cited by:  Papers (73)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    A two-way partitioning algorithm is presented that significantly improves on the highly unstable results typically obtained from the traditional Kernighan-Lin-based algorithms. The algorithm groups highly connected components into clusters and rearranges the clusters into two final subsets with specified sizes. It is known that the grouping operations reduce the complexity, and thus improve the re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mixed particle Monte Carlo method for deep submicron semiconductor device simulator

    Publication Year: 1991, Page(s):1534 - 1541
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    A particle simulation method is introduced in which two kinds of particle models are used in one device. A conventional Monte Carlo particle model is used in the region where nonstatic effects are evident, and a particle model based on Langevin's equation is used in the region where the drift-diffusion approximation is valid. In this way it is possible to obtain efficiency and the required physica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Channel/switchbox definition for VLSI building-block layout

    Publication Year: 1991, Page(s):1485 - 1493
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    A study is made of the problem of routing region definition and ordering in VLSI building-block layout design. An algorithm to decompose the routing area into straight channels and rectangular switchboxes corresponding to line segments in the routing structure of the placement such that the number of switchboxes is minimized, is presented. The algorithm is based on a graph-theory approach that mak... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MISNAN-a physically based continuous MOSFET model for CAD applications

    Publication Year: 1991, Page(s):1512 - 1529
    Cited by:  Papers (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1320 KB)

    A circuit-level MOSFET model is presented which is based on the representation of current transport in a sheet channel in terms of the surface potential conditions at the source and drain boundaries. It is established that the surface potential solutions can be obtained by iterative means with negligible computing time penalty. The model is scalable and results in continuous device characteristics... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance trade-offs in a parallel test generation/fault simulation environment

    Publication Year: 1991, Page(s):1542 - 1558
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1440 KB)

    Heuristics are proposed to partition faults for parallel test generation with minimization of both the overall run time and test length as an objective. For efficient utilization of available processors, the work load has to be balanced at all times. Since it is very difficult to predict how difficult it will be to generate a test for a particular fault, the authors propose a load balancing method... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new method for floor planning using topological constraint reduction

    Publication Year: 1991, Page(s):1494 - 1501
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    An approach to the constraint-based floor planning of flexible, fixed, and preplaced blocks that is based on the removal of redundant constraints and the reshaping of flexible blocks is discussed. A floor plan is said to respect a given constraint set if is satisfies either a vertical or a horizontal constraint in the set for each pair of blocks. The approach presented is to construct a floor plan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

The purpose of this Transactions is to publish papers of interest to individuals in the area of computer-aided design of integrated circuits and systems composed of analog, digital, mixed-signal, optical, or microwave components.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief

VIJAYKRISHNAN NARAYANAN
Pennsylvania State University
Dept. of Computer Science. and Engineering
354D IST Building
University Park, PA 16802, USA
vijay@cse.psu.edu