By Topic

Circuit Theory, IEEE Transactions on

Issue 3 • Date May 1973

Filter Results

Displaying Results 1 - 25 of 34
  • Editorial [Intro to the Special Issue on Large-scale Networks]

    Page(s): 185
    Save to Project icon | Request Permissions | PDF file iconPDF (124 KB)  
    Freely Available from IEEE
  • Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some properties of the integrals of even and odd parts of Hurwitz polynomials

    Page(s): 312 - 314
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (384 KB)  

    Given the zeros of the even or the odd parts of Hurwitz polynomials (HP), conditions have been established such that their integrals are suitable as the odd or the even parts of other HP's. Testing procedures, including simple inspection tests, have been enunciated for both cases. The criteria developed can be used to generate positive real functions (prf) of higher order. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrete optimization and the planning of electric power networks

    Page(s): 230 - 238
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (952 KB)  

    Power system transmission planning is expressed as a large finite Markovian sequential process over time involving 1) a known planning horizon divided into finite number of stages; 2) a large number of alternative additions (type, size, and place of new facilities) at each stage; 3) analysis and criteria for evaluating network acceptance (performance, reliability, security, cost, etc.) for each alternative at each stage; 4) a searching method to find the optimum plan. Forward dynamic programming is used to maximize the utility of the transmission network over the period of the planning horizon ensuing adequate service, and the results show the effects of economy of scale as the planning horizon is increased. However, dynamic programming is limited by the number of alternatives considered at each stage. Thus a new method, discrete dynamic optimizing (DDO), is also introduced. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal source location to feed a lossy distribution tree

    Page(s): 246 - 250
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (584 KB)  

    Given a large but finite tree network designed to distribute a commodity to some or all of its nodes, the lossy model takes into account the attenuation of the flow through the branches of the network. The capacity of the source needed to feed the network depends on the node to which it is attached. In a finite network, there must be at least one node where the required source capacity is not higher than that at any other node. This short paper proves that there can be only one such node or, at most, two adjacent nodes with the same value for the required source capacity. Regarding the required source capacity as a function over the set of nodes, it is shown that this function can have only one local minimum (a node where the value is not higher than at any adjacent node), and no local maximum. Based on these properties, search algorithms are outlined to locate the node with the optimal source capacity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Existence of state equation representation of linear large-scale dynamical systems

    Page(s): 239 - 246
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (808 KB)  

    Linear time-invariant large-scale dynamical systems (LSDS's) are considered. A component-connection model is first proposed. Conditions under which an LSDS has a state equation representation are determined. A characterization of a class of dynamical systems, called unimodules, is established. A unimodule has the property that any given dynamical system can be realized by an interconnection of such unimodules. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tunable RC-active filters using periodically switched conductances

    Page(s): 294 - 301
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (880 KB)  

    The realization of electronically tunable RC-active filters is achieved by the use of periodically switched conductances within the filter. A method of analysis of RC networks containing periodically switched conductances is given, which is based on the impulse response of the network at a capacitance. The use of periodically switched conductances to tune RC-active filters has several practical advantages, such as eliminating the need to carefully match independently adjustable network elements and being able to control a transfer function with one timing waveform. This method of electronically tuning RC-active filters is illustrated by several designs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a multinet wiring problem

    Page(s): 250 - 252
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (464 KB)  

    A multinet wiring problem is proposed. This problem has application in the routing of interconnection wires on integrated circuit chips and printed circuit boards. Optimal and suboptimal algorithms, based on the branch-and-bound method, are described for its solution. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Boolean algebra method for computing the terminal reliability in a communication network

    Page(s): 203 - 211
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (896 KB)  

    Given the set of all simple paths between two nodes in a network, the terminal reliability can be symbolically computed by transforming a Boolean sum of products into an equivalent form in which all terms are disjoint. This new approach seems to be promising in respect to existing 4[ 6 methods both for the exact and for the approximate computation of the terminal reliability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realization of all-pass transfer function using a differential amplifier

    Page(s): 326 - 327
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (248 KB)  

    A class of active RC networks is presented with which an all-pass transfer function of arbitrary order, having simple negative real poles, has been realized by combining the output of a threeterminal RC network with a portion of its input in a differential amplifier. A synthesis procedure for such an all-pass function is also indicated. This class of networks has the advantage that the gain constant of the all-pass function may be varied by varying the gain of the differential amplifier. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rapid design procedures for the Brune and Bott-Duffin circuits

    Page(s): 279 - 284
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (568 KB)  

    Assuming that a driving-point impedanceF(s)=N(s)/D(s)is known by the coefficients of the rational function, both polynomials of the same degree and normalized, theA-type (resistance series) and/or theB-type (resistance parallel) Brune circuit can rapidly and with high accuracy be designed using the results of evaluatingN(jomega)andD(jomega)only. In a few steps the circuit can be transformed into the Bott-Duffin circuit. The suggested procedure becomes especially advantageous whenF(s)is a function of high rank. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computerized determination of electrical network noise due to correlated and uncorrelated noise sources

    Page(s): 321 - 322
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (272 KB)  

    A new computation method is given connected with the analysis of equivalent circuits including uncorrelated as well as correlated noise sources, thus saving computer time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Converse Problems of Network Solution Matrices

    Page(s): 316 - 319
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (488 KB)  

    The converse problems of the network solution matrices are considered. The solutions found bear a remarkable similarity to the original solution matrices. The stepwise solution and its converse used alternately provide a useful procedure for conversational-mode analysis of circuits. Use is also made of the results to give a direct method in deriving the partial derivatives of the solution matrices of all orders needed in the sensitivity studies with respect to the appropriate branch elements. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digital filter synthesis--A low-sensitivity system matrix

    Page(s): 322 - 324
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (368 KB)  

    A new system matrix that can realize any second-order digital filter is presented. This matrix exhibits minimum eigenvalue sensitivity when compared to other second-order matrices over certain regions of root locations within the unit circle. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The maximum power transfer theorem for n-ports

    Page(s): 328 - 330
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (416 KB)  

    The maximum power transfer theorem is proved by an elementary and simple method. The class of all impedance matrices which achieve maximum power transfer is completely described. Cases whereZ_{0}+Z_{0^ast}is not positive definite are completely discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On equivalence of realizability conditions of a degree sequence

    Page(s): 260 - 262
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (440 KB)  

    It is shown that the realizability conditions of Erdös and Gallai for a sequence of nonnegative integers to be the degrees of a graph having no parallel edges and self-loops can be deduced from those for a directed graph. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of long-distance telecommunication networks -The Telpak problem

    Page(s): 186 - 192
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (936 KB)  

    The government procures long-distance circuits from communication carriers under a bulk-rate tariff referred to as Telpaks. While physical implementation of circuits is performed by the carriers, the arrangement of circuits into Telpaks for billing purposes is the government's responsibility. Since Telpaks were established in 1961, the government has arranged its circuits into Telpaks on a manual basis. As a result, it has never been able to achieve a minimum cost grouping for over 60 000 circuits among more than 3000 service points. Further, the problem of minimizing the cost of Telpaks has defied classical mathematical approaches because of the large number of service points and circuits. By applying heuristic design techniques, the systematic procedure which is described in this paper has been developed for automating the design of the government Telpak network. Its use has resulted in substantial cost savings over the manually obtained configuration. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An equivalence between fast periodic-switched systems and time-invariant systems

    Page(s): 324 - 325
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (232 KB)  

    It is shown that a certain class of linear systems with constant parameters and periodically operated switches can be approximated by a linear time-invariant system provided that the switching frequency is much greater than the magnitude of the largest natural frequency of the linear time-invariant system. Furthermore, a special type of switching allows the linear time-invariant system to be frequency scaled by simply varying the average value of the switching function. This feature allows one to design electronically tunable filters. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of n-terminal RC networks

    Page(s): 272 - 279
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (704 KB)  

    A new synthesis technique has been evolved and a definite realization procedure has been given for a general class of transformerlessn-terminal RC networks. For the applicability of this technique, necessary and sufficient conditions have been stated and the relevant theorems proved. The technique utilizes the method of parallel decomposition and application of successive generalized star-mesh transformation. With this technique it is possible to realize a general class of nth-order indefinite admittance matrices by networks of series-parallel class in the form of grounded structures. To illustrate the synthesis procedure, a few examples of network realization have been given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graph optimization-synthesis formulation for cable-communications systems

    Page(s): 252 - 255
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (536 KB)  

    The cable-communications systems,m-center, and minimum spanning-tree problems are contained within a general graph optimization-synthesis problem. In the minimum spanningtree problem, a decomposition technique is used in constructing minimal-length trees. This problem is related to them-center problem where the total number of vertices is estimated from the length of the spanning tree. Both results, vertex estimate and decomposition, are utilized in the cable-communications systems problem. A procedure and example are provided for estimating the dollar cost of a cable-communications system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The operation and control of large interconnected power systems

    Page(s): 212 - 222
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1136 KB)  

    The theory of tearing, also known as diakoptics, is applied to the problem of economy-security control of generation in power pools and in superpools. Power pools consist of individual utilities that join together to produce an optimal allocation of generation subject to the security constraints on the system. There are at present a number of power pools in the United States. Superpools consist of a multiplicity of power pools. Multiarea and multipool procedures are presented for the real-time control of generation in pools and in superpools using the hierarchy of computers present in the operations of individual utility companies. Other applications of diakoptics to power systems are summarized. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of active filters with zero passive Q-sensitivity

    Page(s): 289 - 294
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (552 KB)  

    A new biquadratic active filter configuration is described which requires only two resistors, two capacitors, and two finite gain summing amplifiers. The circuit is shown to have zeroQ-sensitivity to the resistors and capacitors and extremely lowQ- sensitivity to the amplifiers.Other sensitivities of interest are also shown to be low. Practical realizations using one operational amplifier and additional resistors for each summing amplifier are given for bandpass, low-pass, high-pass, and notch filtering. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on computer-aided synthesis of resistive n-ports

    Page(s): 319 - 321
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (392 KB)  

    A technique of synthesizing a resistiven-port is described. The port structure is first determined using some necessary conditions. Branch conductances are obtained by solving a system of equations on a computer. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network sensitivity and noise analysis simplified

    Page(s): 285 - 288
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (464 KB)  

    Formulas are easily derived for computing the sensitivity of all the response variables of a network with respect to variation of a single parameter, and the computations can be carried out very efficiently. The converse problem of computing the sensitivity of a single response variable with respect to variations of several parameters, though apparently more difficult, has recently been solved with equal efficiency by appealing to the concept of an "adjoint network." This concept, however, is shown here to be superfluous, since equivalent (and slightly simpler) formulas can be derived using well-known matrix manipulations alone. The problem of computing the signal/noise ratio of a single network response variable has also been solved by using the adjoint network, concept. But, here again, standard matrix manipulations suffice to yield the same results with less conceptual encumbrance. Thus the adjoint network approach, though still valid, proves to be unnecessary for solving these two problems. View full abstract»

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