By Topic

IEEE Transactions on Circuits and Systems

Issue 6 • Date Jun 1989

Filter Results

Displaying Results 1 - 25 of 29
  • Hessenberg-triangular reduction and transfer function matrices of singular systems

    Publication Year: 1989, Page(s):907 - 912
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    The author is concerned with the computation of transfer function matrices of liner multivariable systems described by their generalized state-space equations. An algorithm is outlined that may be considered a generalization of an existing technique for computation of transfer matrices of systems described by standard state-space equation. The propose algorithm can be used for evaluating transfer ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quenching phenomena in synchronized Van de Pol systems

    Publication Year: 1989, Page(s):897 - 901
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    Quenching of sinusoidally driven Van der Pol systems is considered and conditions developed under which harmonic synchronous quenching occurs. For this, a multiple time expansion is used to solve the Van der Pol equation with the sinusoidal forcing term. By controlling the expansion in terms of a small parameter and equating terms of like order in the parameter, the solutions of asynchronous and s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formation of a fractal basin boundary in a forced oscillator

    Publication Year: 1989, Page(s):866 - 872
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    The question of how a fractal basin boundary arises in the sinusoidally forced Duffing's equation is considered. The author describes how the backwards system flow deforms a local stable manifold into the fractal boundary. Parts of the boundary are labeled in a way related to their time of formation. The truncated fractal boundary produced by a burst of sinusoidal forcing is briefly considered. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent architectures for two-dimensional recursive digital filtering

    Publication Year: 1989, Page(s):813 - 829
    Cited by:  Papers (35)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB)

    Efficient architectures are presented for high-speed implementation of two-dimensional recursive digital filters of direct form and local state-space form. Unlike one-dimensional recursive systems, two-dimensional recursive digital filter algorithms have a large amount of inherent concurrency. The authors exploit this concurrency to derive fine-grain pipelined and one-dimensional block architectur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast and area-efficiency BWC array D/A and A/D conversion scheme

    Publication Year: 1989, Page(s):912 - 916
    Cited by:  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    A modification to D/A and A/D converters of the charge redistribution type is suggested. It reduces the silicon area requirement by a factor of two or more (up to 6.5 for 8-bit converters) and increases the speed by a similar factor, while retaining compatibility to presently used MOS fabrication processes. The scheme is sufficiently insensitive to undercuts and parasitics. Under the scheme, some ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Normal matrices and their stability properties: application to 2-D system stabilization

    Publication Year: 1989, Page(s):873 - 875
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    An approach is presented to 2-D system stabilization by constant state feedback that is based on assigning a closed-loop matrix that is two-dimensionally (2-D) similar to a stable normal matrix. First, it is shown that for normal matrices the sufficient Lyapunov stability condition is also necessary and that 1-D and 2-D BIBO stabilities are equivalent. Next, sufficient conditions or 2-D stabilizat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New results in strip Kalman filtering

    Publication Year: 1989, Page(s):893 - 897
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    The strip Kalman filtering previously proposed by B.R. Suresh and B.A. Shenoi (ibid, vol.CAS-28, no.4, p.307-19, 1981) for image restoration is reconsidered. It is pointed out that the procedure given there for parameter estimation of the image model does not take into account the vector nature of the image process and as a result can lead to incorrect identification. It is also shown that for the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The extended Poincare-Bendixson theorem

    Publication Year: 1989, Page(s):933 - 934
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    An extension is presented of the classical Poincare-Bendixson theorem to a higher dimension. It is shown that this extension can be helpful in predicting when chaotic as well as other cycles exist. An example illustrates its use View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Alternating projection neural networks

    Publication Year: 1989, Page(s):846 - 857
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    The authors consider a class of neural networks whose performance can be analyzed and geometrically visualized in a signal space environment. Alternating projection neural networks (APNNs) perform by alternatively projecting between two or more constraint sets. Criteria for desired and unique convergence are easily established. The network can be configured as either a content-addressable memory o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatial-domain design of two-dimensional recursive digital filters

    Publication Year: 1989, Page(s):901 - 905
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    A technique using linear algebraic projection is proposed to design two-dimensional (2-D) recursive digital filters that best approximate a desired input/output relationship in terms of total weighted squared error. A 2-D difference equation representation is used. Examples of first-quadrant and asymmetric half-plane filters are presented and compared with other spatial-domain designs. One of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Restoration of noisy images modeled by Markov random fields with Gibbs distribution

    Publication Year: 1989, Page(s):884 - 890
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    The authors develop techniques for restoration of noisy images using Markov/Gibbs random fields. In the schemes to be presented, the local characteristics of the noise-free image are described by pairwise-interaction Markov random fields, while the noise, assumed to be mainly additive, is modeled as a zero-mean Gaussian process. The estimation of the clean image is based on the MAP criterion. Opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bit-serial realizations of a class of nonlinear filters based on positive Boolean functions

    Publication Year: 1989, Page(s):785 - 794
    Cited by:  Papers (66)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    It is shown that the function of a stack filter can be realized in k-step recursive use of one binary processing circuit. The time-area complexity of the proposed filter is O(k) as compared with O(2k) for stack filters. The proposed digital realizations are simple and modular in structure, and suitable for VLSI implementation. Analog/digital (A/D) hybrid realizations h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new approach to multicriterion optimization problem and its application to the design of 1-D digital filters

    Publication Year: 1989, Page(s):773 - 784
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    A novel method is presented for generating efficient points for the multicriterion optimization (MCO) problem. A novel function, the shifted minimax function, is defined that has the property that any efficient point of the MCO problem can be generated by minimizing the function with appropriately chosen shifts. Using this shifted minimax function for generating efficient points, the optimality co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-input limit cycles due to rounding in digital filters

    Publication Year: 1989, Page(s):931 - 933
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    A necessary condition for the existence of zero-input limit cycles of period T due to rounding in general digital filters is established. Also, geometric sufficient conditions are presented for the existence of limit cycles of period one, of period two and of period T due to rounding. Some illustrative examples are included View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The general recurrence relation for arbitrary rational transformation of polynomials

    Publication Year: 1989, Page(s):917 - 919
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    A recurrence relation is developed that allows the coefficients of a transformed polynomial under common rational function transformations to be readily computed from the original coefficients. The recursive algorithm is quite general and prescribes a simple scheme for machine implementation as well as manual calculation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of 2-D compensators with minimum roundoff noise

    Publication Year: 1989, Page(s):875 - 880
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    A synthesis procedure is developed which yields an optimal 2-D compensator realization that minimizes the output noise power, subject to a scaling condition on the state variables to avoid overflow. The output noise power and the scaling condition are related to two positive definite matrices. Using these matrices, the second-order modes of the compensator are obtained and used to minimize the out... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On upper bounds in tree-diameter sets of graphs

    Publication Year: 1989, Page(s):905 - 907
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    An upper bound in tree-diameter sets of connected graphs is given. Let S {a1, a2, . . ., an} be the tree-diameter set of a connected graph G in increasing order. It is proved that ai+1 a1+(1/2)a1 1⩽in-1 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational structures for fast implementation of L-path and L-block digital filters

    Publication Year: 1989, Page(s):805 - 812
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    One of the major problems in the multi-DSP (digital signal processor) implementation of L-path and L-block digital filters is the hardware complexity-throughput rate tradeoff. The author presents computational structures based on the theory of fast algorithms for short linear convolutions, which are suitable for the implementation of these types of digital filters. He also compar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Switched control of bilinear converters via pseudolinearization

    Publication Year: 1989, Page(s):858 - 865
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    A method is proposed for designing regulating feedback control laws in bilinear networks such as the boost and the buck-boost DC-DC power supplies. A pseudolinearization approach is taken to the average pulsewidth modulated controlled model with physically meaningful local state coordinate transformations. For such transformations, the perturbed average model is independent of the operating point ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Split Levinson algorithm for Toeplitz matrices with singular sub-matrices

    Publication Year: 1989, Page(s):922 - 924
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    The split Levinson algorithm, which is computationally superior to the classical Levinson algorithm, is used for solving linear systems with real symmetric Toeplitz matrices, with no restriction on the ranks of their nested submatrices. The algorithm is based on the observation that the singular predictor polynomials are either the same as or closely related to the predictor polynomials when the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximally linear FIR digital differentiators for high frequencies

    Publication Year: 1989, Page(s):890 - 893
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    The frequency response of conventional FIR digital differentiators (DD), using only integral delays, is poor towards the high frequency end, and becomes identically zero at w=π. To overcome this problem, a half-sample delay, z-1/2, is used in the minimax relative error DDs. However, the order of such DDs grows exponentially when accuracies better than 99.0% are desi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast algorithms for running ordering and max/min calculation

    Publication Year: 1989, Page(s):795 - 804
    Cited by:  Papers (70)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Order statistics are used in a variety of filtering techniques (e.g. median, α-trimmed mean, nonlinear order statistics filtering, morphological filtering). Their computation is relatively fast, because it requires only comparisons. The author presents an algorithm that requires a significantly smaller number of comparisons and is significantly faster than the traditional approach to order s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pole and zero estimation in linear circuits

    Publication Year: 1989, Page(s):838 - 845
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    A unified method for fast, accurate estimation of dominant and nondominant poles and zeros of linear active circuit transfer functions is presented. The basis for both pole and zero estimates is an efficiently computed time-constant matrix. The major computation in the estimation process involves only the solution of linear equations, which are independent of capacitor values. This feature permits... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new multichannel split Levinson algorithm for block Hermitian-Toeplitz matrices

    Publication Year: 1989, Page(s):928 - 931
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    A review is presented of the vector Levinson and multichannel split algorithms for block Hermitian-Toeplitz matrices. The author then introduces a new multichannel split algorithm for block Hermitian-Toeplitz matrices. The algorithm does not save any multiplications, but it does require only one matrix inversion per recursion, whereas the vector Levinson and previous multichannel split algorithm b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A direct code error calibration technique for two-step flash A/D converters

    Publication Year: 1989, Page(s):919 - 922
    Cited by:  Papers (9)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    The authors propose a direct code error calibration technique to improve linearities of flash-type analog-to-digital converters (ADCs). Simulation results of the proposed calibration algorithm based on a capacitor-array multiplying digital-to-analog converter (MDAC) predict that self-calibrating two-step flash ADCs with more than 12 bits of linearity are feasible View full abstract»

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