Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Circuits and Systems, IEEE Transactions on

Issue 8 • Date August 1980

Filter Results

Displaying Results 1 - 14 of 14
  • Correction to 'Improved Circuits for the Realization of Switched-Capacitor Filters'

    Publication Year: 1980 , Page(s): 733
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (42 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.
  • On linear shift-variant digital filters

    Publication Year: 1980 , Page(s): 672 - 679
    Cited by:  Papers (37)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (928 KB)  

    The paper considers filters described by linear shift-variant difference (LSV) equations. We present the notion of a generalized transfer function and discuss the frequency characteristic of a shift-variant digital filter in terms of the generalized transfer function. A method is presented for determining LSV difference equations from a certain class of impulse responses, and vice versa. In addition, some properties of the impulse response and the generalized transfer function of a shift-variant system are investigated in the present work. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory, design, and applications of D-T linear transformation circuits

    Publication Year: 1980 , Page(s): 724 - 729
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (736 KB)  

    A new class of circuits which allows a prescribed driving point characteristic to be obtained by a linear transformation on a transfer characteristic is defined. The usefulness of these circuits and their application to the synthesis of resistive nonlinear networks is discussed. Also experimental data on their performance are given. Finally, a formal treatment is given which allows the definition of a multidimensional linear transformation converters (LTC). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on the 2-D partial fraction expansion

    Publication Year: 1980 , Page(s): 719 - 721
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (312 KB)  

    In this note it is shown that the 2-D composition frac{A(z_1,z_2)A(z_{1}^{-1},z_{2}^{-1})} {B(z_1,z_2)B(z_{1}^{-1},z_{2}^{-1})} = frac{P(z_1,z_2)}{B(z_1,z_2)} + frac{P(z_{1}^{-1},z_{2}^{-1})}{B(z_{1}^{-1},z_{2}^{-1})} contrary to the 1-D case, does not exist in general. Conditions for the existence of such a decomposition are obtained and applied to two examples. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sensitivity minimization of networks with operational amplifiers and parasitics

    Publication Year: 1980 , Page(s): 688 - 697
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1072 KB)  

    A computational method is described which calculates network sensitivity to the influence of parasitics by simulating only the ideal network. For active networks, a similar sensitivity is defined with respect to the deviations from ideal behavior of operational amplifiers. It is shown that this sensitivity is equivalent to the gain-sensitivity product and depends only on the passive elements and the topology. The procedure was applied to known active networks and, in every case considered, minimization resulted in networks with smaller sensitivities. Compensation for nonideal behavior of the operational amplifiers is outlined. A Monte Carlo simulation is performed on the well-known STAR network and it is shown that optimization can lead to considerable improvement, even in the case of well-designed networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A canonical form for a state-space model in two-dimensional systems

    Publication Year: 1980 , Page(s): 710 - 712
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (360 KB)  

    A canonical form is presented for a dass of Roesser's model such that the denominator of the transfer function can be expressed by product of two polynomials with a variable, where the model is assumed to be separately locally controllable or observable. This form will be obtained by extending a well-known canonical form in one-dimensional linear systems to two-dimensional case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block-shift invariance and block implementation of discrete-time filters

    Publication Year: 1980 , Page(s): 667 - 672
    Cited by:  Papers (73)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (624 KB)  

    This paper describes the general class of linear, time-invariant multivariable systems that can be used in block implementations of time-invariant discrete-time filters. Explicit relations between the properties of the block processor and the properties of the implemented filter are derived, including an explicit expression for the matrix transfer function of the block processor in terms of the single-input, single-output filter transfer function. These properties and relations are independent of the form of realization of the block processor. It is shown that all irreducible state-space realizations of the block processor can be derived by a simple procedure from a simple realization of the required filter transfer function. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimization technique for the design of half-plane 2-D recursive digital filters

    Publication Year: 1980 , Page(s): 721 - 724
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (544 KB)  

    An iterative optimization technique, based on a Modified Marquardt algorithm, is proposed for the design of asymmetric 2-D half-plane recursive digital filters with a zero-phase implementation. To illustrate the technique a fan-filter and a circular lowpass filter were designed. The technique can also be used for the design of quarter-plane filters. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • and ö. Hüseyin; Relative primeness of multidimensional polynomial matrices

    Publication Year: 1980 , Page(s): 729 - 732
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (408 KB)  

    A sufficient condition is given for the relative primeness (RP'ness) of two multidimensional polynomial matrices A(s_1, \cdots ,s_p) and B(s_1,\cdots ,s_p) of sizes \sigma \times r and \kappa \times r , such that (i) \kappa + \sigma is greater than r , (ii) there are r rows of A(s_1, \cdots ,s_p) and B(s_1, \cdots ,s_p) which form a nonsingular matrix. The sufficient condition is in the form of a rank test on a constant matrix having block Toeplitz structure and becomes both necessary and sufficient in the scalar case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic network analysis-An algebraic formulation

    Publication Year: 1980 , Page(s): 679 - 687
    Cited by:  Papers (18)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1112 KB)  

    A new and efficient method of symbolic analysis of linear analog active or passive networks is introduced. The method takes advantage of several properties of determinants. By formulating the network equations such that the symbolic parameters appear only once and that too along the principal diagonal of a matrix, a method of weeding out invalid symbol combinations in a network transfer function is given. For the implementation of the method, any efficient numerical method of calculating determinants is all that is necessary. The method is conceptually simple and is computationally advantageous to the existing procedures. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision methods and realization of 2-D digital filters using minimum number of delay elements

    Publication Year: 1980 , Page(s): 657 - 666
    Cited by:  Papers (23)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1288 KB)  

    A combination of techniques taken from graph theory and decision theory is used to solve the problem of realization of 2-D digital filters using minimum number of delay elements called minimal realization. The solution is presented in the form of an algorithm which, when executed, yields one (and hence, infinitely many) minimal realization. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The minimum-order three-connected cubic graphs with specified diameters

    Publication Year: 1980 , Page(s): 698 - 709
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1376 KB)  

    A minimum (d,c, \upsilon ) -graph is one which is regular of degree \upsilon , has diameter d and connectivity c , and is of minimum order, i.e., has the minimum number of points. Such graphs have application in the design of survivable communications networks. The minimum order of a (d, 3,3) -graph is determined, and the construction of all minimum (d, 3,3) -graphs is described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effect of correlation between transactions errors on fixed-point fast Fourier transform analysis

    Publication Year: 1980 , Page(s): 712 - 716
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (560 KB)  

    A revised expression, taking the effect of correlation between truncation errors, is obtained for the output noise-to-signal when the fast Fourier transform (FFT) is computed in fixed-point arithmetic. The results are given for the two common forms of the FFT algorithmn, decimation in-frequency and in-time. The analysis assumes sign-magnitude (or 1's complement) arithmetic and is presented in detail for the decimation-in-frequency (DIF) case. The correlation coefficients are computed analytically. A few assumptions, made in the analysis, are verified by computer simulations. The average variance of the output noise, due to the truncation errors, predicted by the new model is approximately twice the corresponding value predicted by the old model (which assumes that the truncation errors are uncorrelated). The output noise-to-signal ratios predicted by the revised and old expressions are compared with experimental results. It is shown that the revised result predicts much closer to the experimental results than the old. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal stability of N-dimensional linear processors and its applications

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

    The transfer function of an N -dimensional linear processor is the double-ended \over\rightarrow{z} -transform of its impulse response function. Every rational transfer function has a unique, stable expansion if the denominator polynomial is nonzero on the unit circle product subspace of \over\rightarrow{z} , and can be realized by a frame recursive processing scheme. As an extension of the above the present paper stated and proved the conditions for an active infinite network to be stable both spatially and temporally. View full abstract»

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