Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on

Issue 5 • Date May 1992

Filter Results

Displaying Results 1 - 9 of 9
  • Authors' reply to comments on 'Pole and zero estimation in linear circuits' by P.E. Gray and J.K. Matchett

    Publication Year: 1992
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (75 KB)  

    A comment by P.E. Gray and J.K. Matchett (see ibid., vol.38, p.1404, Nov. 1991) on the above-titled paper (see ibid., vol.36, pp.838-845, June 1989) appeared with an errata for the paper, which was mistitled as a reply to their comment. A response to the comment is given here, supporting the accuracy of the pole-zero estimation method that occasioned the comment.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory and design of maximally flat low-pass high-pass reactance-ladder diplexers

    Publication Year: 1992 , Page(s): 337 - 350
    Cited by:  Papers (21)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (820 KB)  

    The problem of designing a maximally flat low-pass high-pass reactance-ladder diplexer with adjustable crossover attenuation and variable bandwidth is addressed. A reasonably complete theoretical and practical solution based on a new and simple algebraic formulation is presented. All the proofs are given, and some of the pertinent recent literature is discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transient analysis of nonuniform transmission lines

    Publication Year: 1992 , Page(s): 378 - 385
    Cited by:  Papers (25)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (592 KB)  

    The transient propagation through nonuniform transmission line structures is analyzed. Nonuniform structures include tapered microstrips and uniform lines with periodic and nonperiodic loadings or discontinuities. The analysis employs a scattering parameter formulation in the time domain to derive closed-form algorithms for the voltage and current variables in the line. The solutions that can be used in the case in which both discontinuities and terminations are nonlinear avoid the use of transforms or convolutions and thus are computationally efficient. Simulation algorithms are tested and, when compared with experimental simulations, indicate good agreement View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Folded torus in the forced Rayleigh oscillator with a diode pair

    Publication Year: 1992 , Page(s): 402 - 411
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (680 KB)  

    It is known that the periodically forced Rayleigh equation is the first differential equation for which an aperiodic solution was ever discovered. However, it has not yet been clarified whether or not observable chaos exists in this equation. Chaotic oscillations observed in the forced Rayleigh oscillator are investigated in detail by using the piecewise-linear and degeneration technique. The model is a negative resistance LC oscillator with a pair of diodes driven by a sinusoidal source. The piecewise-linear constrained equation is derived from this circuit by idealizing the diode pair as a switch. The Poincare map of this equation is derived strictly as a one-dimensional return mapping on a circle (so-called circle map). This mapping becomes noninvertible when the amplitude of the forcing term is tuned larger. The folded torus observed in this oscillator is well explained by this mapping View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties and performance bounds for timed marked graphs

    Publication Year: 1992 , Page(s): 386 - 401
    Cited by:  Papers (22)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1524 KB)  

    A class of synchronized queueing networks with deterministic routing is identified to be equivalent to a subclass of timed Petri nets called marked graphs. Some structural and behavioral properties of marked graphs are used to show interesting properties of this class of performance models. In particular, ergodicity is derived from the boundedness and liveness of the underlying Petri net representation. In the case of unbounded (i.e., nonstrongly connected) marked graphs, ergodicity is computed as a function of the average transition firing delays. For steady-state performance, linear programming problems defined on the incidence matrix of the underlying Petri nets are used to compute tight (i.e., attainable) bounds for the throughput of transitions for marked graphs with deterministic or stochastic time associated with transitions. These bounds depend on the initial marking and the mean values of the delays but not on the probability distortion functions. The benefits of interleaving qualitative and quantitative analysis of marked graph models are shown View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Range-chart-guided iterative data-flow graph scheduling

    Publication Year: 1992 , Page(s): 351 - 364
    Cited by:  Papers (47)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1288 KB)  

    An alternative method for the scheduling of iterative data-flow graphs is described. The method is based on the scheduling-range chart, which contains the information on the range within which each operation in the graph can be scheduled. The scheduling range is determined by considering the intraiteration and interiteration precedence relations. The goal is to find an optimal position within the scheduling range of each operation in such a way that some quality criteria (number of hardware resources, iteration period, latency, register lifetime) are optimized. A formal proof of the NP-completeness of the problem is given and two polynomial-time heuristics are introduced: fixed-rate (rate-optimal as a special case) scheduling where the number of hardware resources is optimized at the same time that a specific iteration period is guaranteed, and maximum-throughput scheduling with limited resources where the iteration period is optimized for a fixed number of processors. The algorithms are able to find optimal solutions for well-known benchmark examples View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for minimum-bend single row routing problem

    Publication Year: 1992 , Page(s): 412 - 415
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (364 KB)  

    The objective function of this problem is to minimize the number of doglegs (or bends) per net. The problem is of critical interest in the design of high-performance multilayer printed circuit boards; it also finds application in over-the-cell routing and design of microwave ICs. The approach is based on a graph theoretic representation in which an instance of the single row routing problem is represented by three graphs-an overlay graph, a containment graph, and an interval graph. Using this graph representation, three algorithms for the minimum-bend single row routing problem are developed. It is shown that the algorithms have very tight performance bounds. In particular, it is proved that the maximum number of doglegs per net is bounded by O (k), where k is the size of the maximum clique in a certain graph representing the problem View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal FWL design of state-space digital systems with weighted sensitivity minimization and sparseness consideration

    Publication Year: 1992 , Page(s): 365 - 377
    Cited by:  Papers (54)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1040 KB)  

    The optimal finite word length (FWL) state-space digital system problem is investigated. Instead of the unusual sensitivity measure, it is argued that it may be desirable to minimize a frequency weighted sensitivity measure over all similarity transformations. The set of optimal realizations minimizing this weighted sensitivity is completely characterized, and an algorithm is proposed to find the optimal solution set. It is shown that a subset of the optimal realization set consists of sparse Schur realizations, whose actual sensitivity (taking into account the zero elements) is even smaller than the theoretical minimal sensitivity. Some properties of the Schur realizations are discussed. A numerical example that confirms the theoretical results is given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the generation of d-ordered sets: a proof based on determinant theory

    Publication Year: 1992 , Page(s): 415 - 418
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (320 KB)  

    A simple proof of the theorem of determinants that yields d -ordered sets is given. Nothing more complicated than the Laplacian expansion of a determinant is used in the proof, which consists essentially of two parts. First a bordered determinant is used to yield the necessary determinantal equation. Then, transpositions of columns bring the minors in the equation into the required form so that they satisfy the conditions for a d-ordered set View full abstract»

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