By Topic

Circuits and Systems, IEEE Transactions on

Issue 1 • Date January 1974

Filter Results

Displaying Results 1 - 25 of 41
  • Message from the President - Our new image

    Publication Year: 1974 , Page(s): 1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (87 KB)  

    First Page of the Article
    View full abstract»

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

    Publication Year: 1974 , Page(s): 2
    Save to Project icon | Request Permissions | PDF file iconPDF (106 KB)  
    Freely Available from IEEE
  • Additional canonic realizations of digital filters using the continued-fraction expansion

    Publication Year: 1974 , Page(s): 135 - 136
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (135 KB)  

    Three new canonic realizations of a digital-filter transfer function using the continued-fraction-expansion techniques are derived. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Driving-point functions with maximally flat magnitude

    Publication Year: 1974 , Page(s): 157 - 159
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (322 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to 'The Measure of a Matrix as a Tool to Analyze Computer Algorithms for Circuit Analysis'

    Publication Year: 1974 , Page(s): 166
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (113 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Active filter with distributed RC line having zero Q-sensitivity

    Publication Year: 1974 , Page(s): 87 - 90
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (352 KB)  

    The concept and properties of an active filter with a fourlayer distributed RC line in a feedback loop are presented. Due to specific properties of the four-layer RC line, it is possible to obtain zero Q -sensitivity of the filter to active-element gain variations. A design procedure for the bandpass filter with prescribed Q and center frequency \omega _{o} -values is given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of immittance functions in symbolic form for lumped distributed active networks

    Publication Year: 1974 , Page(s): 57 - 67
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1128 KB)  

    An efficient method for numerically generating the immittance and sensitivity parameters of linear time-invariant lumped distributed active networks as explicit functions of the frequency variable s is presented. It is based on the fast Fourier transform (FFT) algorithm for numerical interpolation, the sparse-matrix method for efficient computation and low storage, and the adjoint-network approach for sensitivity evaluation. The situation when a few of the network element values are to be left as symbols is considered. The influence of various numerical errors is investigated and ways of reducing them are proposed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topological formulation of symbolic network functions and sensitivity analysis of active networks

    Publication Year: 1974 , Page(s): 39 - 45
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (832 KB)  

    A new and efficient algorithm for topological formulation of network functions in symbolic form for a general linear (passive or active) network is presented. This algorithm, which is based on the concept of graph partitioning developed by Dunn and Chan, has all of the advantages of the existing topological formulas, such as overcoming the problem of sign evaluation and greatly reducing the number of term cancellations and the number of topological terms. In addition, and perhaps the most important, it presents a step-by-step procedure for formulating network functions that can readily be adapted for computer implementation. Finally, it is shown that the theoretical results developed herein are most suited for sensitivity analysis of linear active networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The use of the Newton-Raphson method in time-domain synthesis

    Publication Year: 1974 , Page(s): 67 - 69
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (312 KB)  

    The problem of approximating a specified real time function by a sum of n real and/or complex exponentials is considered. The mean-squared error is the criterion on which optimization is based. The Newton-Raphson method is used to solve the nonlinear equations required for optimization. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Roundoff error in multidimensional generalized discrete transforms

    Publication Year: 1974 , Page(s): 100 - 108
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (856 KB)  

    The analysis of rounding error in the one-dimensional fast Fourier transform (FFT) is extended to a class of generalized orthogonal transforms [1] with a common fast algorithm similar to the FFT algorithm. This class includes the BInary FOurier REpresentation (BIFORE) transform (BT) [2], the complex BT (CBT) [3], and the discrete Fourier transform (DFT). Expressions for the mean square error (MSE) in the two-dimensional BT, CBT, and FFT are derived. In the case of white input data, the mean square error-to-signal ratio is derived for the multidimensional generalized transforms. The error-to-signal ratio for the one-dimensional FFT derived by Kaneko and Liu is modified with improvement. Some comparisons among BIFORE, DFT, and Haar transforms are also included. The theoretical results for the two-dimensional FFT and BIFORE have been verified experimentally. The experimental results are in good agreement with the theoretical results for lower order sequences, but deviate as the order increases due to the actual manner of rounding in the digital computer. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A proof for Talbot's conjecture

    Publication Year: 1974 , Page(s): 154 - 155
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (264 KB)  

    Two theorems concerning polynomials having only negative real axis zeros, or only imaginary axis zeros are given. The first of these answers a conjecture by Talbot. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simultaneous realization of sets of 2-trees

    Publication Year: 1974 , Page(s): 153 - 154
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (232 KB)  

    A procedure for the realization of the graph from the sets of 2-trees W_{i,j} and W_{k,l} is given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal transfer-function synthesis of RC ladders-Lumped and distributed

    Publication Year: 1974 , Page(s): 49 - 56
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (792 KB)  

    The following optimal synthesis problems for lumped and distributed RC ladder networks are solved explicitly: 1) transfer admittance synthesis with minimum total shunt capacitance; 2) transfer impedance synthesis with minimum total series resistance; and 3) opencircuit voltage transfer-function synthesis with minimum total resistance-total capacitance product. In all three cases, an explicit expression is given for the corresponding minimum value of the network attribute being considered, in terms of the specified transfer function. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some properties for the unimodular decomposition of matrix

    Publication Year: 1974 , Page(s): 152 - 153
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (264 KB)  

    Some additional necessary conditions for the existence of a unimodular decomposition of an immittance matrix are presented. It is shown that the sum of all elements of a principal submatrix of such a matrix is positive. Some property of the minors of the matrix, which can be decomposed, is shown. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental versus adjoint models for network sensitivity analysis

    Publication Year: 1974 , Page(s): 46 - 49
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (416 KB)  

    An alternative to the sensitivity analysis of variable parameter networks based on the adjoint model is developed by introduction of the "incremental" model. The latter consists of a network having current and voltage distributions equal to the incrementals of the corresponding distributions of the original network, and may be considered an extension of the familiar case of small-signal analysis of nonlinear networks. Examples of application, as well as extensions to higher order incrementals, are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matrix representations for sorting and the fast Fourier transform

    Publication Year: 1974 , Page(s): 109 - 116
    Cited by:  Papers (12)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (920 KB)  

    The different versions of the fast Fourier transform (FFT) are described here for arbitrary base in terms of the matrix factors of the discrete Fourier transform matrix T_{N} . The Kronecker product notation and the ideal shuffle base r permutation operator form the basis for a unifying theory through which the various versions of the FFT can be viewed. The properties of the ideal shuffle base r permutation operator are used to arrive at FFT versions with such desirable properties as in-place computation or identical geometry from stage to stage. The FFT versions previously described in the literature are derived here. At the same time, algorithms for the sorting of FFT data in digit-reversed order are generated. These are explored and new sorting versions amenable to hardware implementation with sequential memory are presented. As an example of how the unifying theory is used, a number of FFT versions with identical geometry from stage to stage are derived. The hardware necessary for these algorithms is described for the base 4 case with N = 1024 data points. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the inversion of rational matrices

    Publication Year: 1974 , Page(s): 8 - 10
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (288 KB)  

    The method developed herein provides a convenient procedure for the inversion of rational matrices-matrices whose entries are rational functions in s which at s = 0 are nonsingular. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realizability of communication nets: An application of the Zadeh criterion

    Publication Year: 1974 , Page(s): 150 - 151
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (200 KB)  

    The concepts of pseudo-Boolean matrix multiplication and pseudo-Boolean matrix adjoint are reviewed. For a given symmetric matrix T to be realizable as the terminal capacity matrix of an unoriented communication net, it is necessary and sufficient for T to be idempotent with respect to multiplication. Another equivalent condition is for T to be self-adjoint. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characteristics of nonideal operational amplifiers

    Publication Year: 1974 , Page(s): 69 - 75
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (624 KB)  

    The departures of the operational amplifiers (OA's) from the ideal performance and their effect on VCV's in the inverting and noninverting mode are discussed. It is found that for the same ideal gain, the bandwidths for the inverting and noninverting modes are different, the former being less. Complete equivalent circuits describing the frequency dependance of the input and output impedances for both modes are given. In particular, the output impedance is shown to be inductive for the frequencies of interest, and this is also confirmed by experimental results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new theory of continuously equivalent networks

    Publication Year: 1974 , Page(s): 17 - 20
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (456 KB)  

    In 1962, Schoeffler developed, from the original Howitt theory, a "continuous" method of generating equivalent networks by means of node-admittance matrix transformations. An alternative to this method is now proposed which is simpler in concept and more convenient for current applications. The new approach is applied to the problem of minimizing sensitivity of RLC networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Common-mode rejection-ratio analysis using the adjoint network

    Publication Year: 1974 , Page(s): 155 - 156
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (216 KB)  

    The computational effort involved in differential-amplifier common-mode rejection-ratio (CMRR) calculations may be reduced by using the adjoint network to obtain the network sensitivities required for the CMRR determination. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A versatile active RC building block with inherent compensation for the finite bandwidth of the amplifier

    Publication Year: 1974 , Page(s): 75 - 78
    Cited by:  Papers (43)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (424 KB)  

    An earlier paper by the authors describes an easily trimmed universal building block for active RC filters which possesses the valuable characteristic that, with suitable design, the Q -value can be made approximately independent of the gain-bandwidth product of the operational amplifiers. This makes the filter usable for high frequencies, while at the same time the dependence of the Q -value on temperature variations in the operational amplifiers is drastically reduced. Design formulas are presented, as well as comparative measurements which verify the theory. The building block is shown to have excellent characteristics both as a universal second-order building block and as a standard block for active ladder synthesis of bandpass filters. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation of pole zero displacements of a digital filter due to coefficient quantization

    Publication Year: 1974 , Page(s): 116 - 124
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (920 KB)  

    An analytical technique for estimating the displacement of poles and zeros of a digital filter due to multiplier coefficient quantization is presented. The proposed technique allows rapid evaluation of quantization effects in different realizations of a given transfer function. Also advanced here is a simple extension of the method to determine, a priori, coefficient word lengths which insure that the polezero movements will remain within prescribed bounds. Examples illustrating the technique are included. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence failure of the method of false position

    Publication Year: 1974 , Page(s): 162 - 163
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (248 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive digital filters having equiripple group delay

    Publication Year: 1974 , Page(s): 131 - 134
    Cited by:  Papers (20)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (320 KB)  

    In a recent paper Thiran has proposed a method for the approximation of constant group delay in an equiripple manner, based on the method of Ulbricht and Piloty. A different, conceptually simpler solution to the same problem is proposed. The solution is based on an algorithm of the pole-shifting type, related to Remez's second algorithm. The choice of initial conditions is discussed and numerical solutions are given. View full abstract»

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