By Topic

Circuits and Systems, IEEE Transactions on

Issue 3 • Date Mar 1991

Filter Results

Displaying Results 1 - 16 of 16
  • On the largest modulus of polynomial zeros

    Publication Year: 1991 , Page(s): 333 - 337
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (376 KB)  

    A result by Cauchy (1829) is extended in two directions, providing two bounds for the moduli of the zeros of a polynomial. One of these pertains to real polynomials, and the other pertains to polynomials with complex coefficients View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient VLSI designs for data transformation of tree-based codes

    Publication Year: 1991 , Page(s): 306 - 314
    Cited by:  Papers (46)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (760 KB)  

    A class of VLSI architectures for data transformation of tree-based codes is proposed, concentrating on transformation functions used for data compression and decompression. Two algorithms are presented: a sequential algorithm that generates the code bits serially one bit per machine cycle, and a parallel algorithm that generates the entire code bits of a symbol in one machine cycle. The algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-speed data transmission using low-frequency clocks

    Publication Year: 1991 , Page(s): 273 - 280
    Cited by:  Papers (5)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (632 KB)  

    An architecture for parallel-to-serial conversion that avoids high-frequency clocking is introduced. Instead of using fast clocks, it requires precise relative timing throughout the circuit. Such an approach is natural for an integrated circuit, where clock distribution is difficult, but devices in close proximity are very well matched. Roughly speaking, the architecture requires that the data be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 1-D map for the double scroll family

    Publication Year: 1991 , Page(s): 233 - 243
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (740 KB)  

    The 1-D map π* (an approximation of the 2-D Poincare map) is used to study the periodic windows of the double scroll family. First, an algorithm based on the kneading theory is used to determine the structure and the order of appearance of periodic orbits in the 1-D map π*. This information is used to find the structure and the period of the corresponding orbits of the 3-D system. The result... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesizing switched-current filters by transposing the SFG of switched-capacitor filter circuits

    Publication Year: 1991 , Page(s): 337 - 340
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (288 KB)  

    A general synthesis method for switched-current (SI) filter circuits is presented. The SI filter circuit is obtained from the transpose of the signal-flow-graph (SFG) representation of a switched-capacitor (SC) filter realization. The resulting SI circuits realized the same transfer function as the SC filter circuit and, in addition, possess identical component sensitivities. Since the operation o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FIR modeling using log-bispectra: weighted least-squares algorithms and performance analysis

    Publication Year: 1991 , Page(s): 281 - 296
    Cited by:  Papers (20)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1080 KB)  

    Identification of non-minimum-phase systems with finite impulse response (FIR) is addressed in the bispectrum domain. A bispectrum-based phase retrieval algorithm is modified to handle the phase wrapping problem and is extended to log-magnitude reconstruction. Both linear-equation-based estimators (the phase and the log-magnitude) are then combined to form an integrated, nonparametric system ident... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient residue-to-binary conversion technique with rounding error compensation

    Publication Year: 1991 , Page(s): 315 - 317
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (284 KB)  

    An improved scaled-decoding technique (defined as residue-to-binary conversion of which outputs are scaled by a constant) for hardware implementations in the residue number system (RNS) is presented. The technique is based on the Chinese remainder theorem and is equipped with a rounding error compensation circuit that can reduce the maximum scaling error below 0.5 least-significant-bit (LSB) for g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Least squares order statistic filter for signal restoration

    Publication Year: 1991 , Page(s): 244 - 257
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1304 KB)  

    The fundamental theory for restoring discrete waveforms immersed in independent noise using order-statistic (OS) filters, with the least-squares criterion as a fidelity measure, is developed. Nondynamical least-squares OS filter design methods are extended to the case of arbitrary discrete waveforms immersed in independent noise. A method for incorporating local structural constraints into the opt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Artificial neural networks for four-coloring map problems and K -colorability problems

    Publication Year: 1991 , Page(s): 326 - 333
    Cited by:  Papers (58)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (624 KB)  

    The computational energy required for solving a four-coloring map problem is determined. A parallel algorithm for solving the problem based on the McCulloch-Pits binary neuron model and the Hopfield neural network, is presented. It is shown that the computational energy is always guaranteed to monotonically decrease with the Newton equation. A 4×n neural array is used to color a map... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The analytical form of the length distribution function for computer interconnection

    Publication Year: 1991 , Page(s): 317 - 320
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (300 KB)  

    An analysis of a hierarchical computer interconnection model that yields the analytical form of the interconnection distribution function is presented. It is shown that this function is consistent with the previously derived equation for the average interconnection length and that the distribution function accurately describes the distribution of interconnections within previously constructed comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast algorithm and implementation of 2-D discrete cosine transform

    Publication Year: 1991 , Page(s): 297 - 305
    Cited by:  Papers (87)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (716 KB)  

    An algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N×N DCT, where N=2m, can be computed using only N 1-D DCTs and additions, instead of using 2N 1-D DCTs as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An interleaved/retimed architecture for the lattice wave digital filter

    Publication Year: 1991 , Page(s): 344 - 347
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (264 KB)  

    An architecture for the lattice wave digital filter (LWDF) that reduces the hardware of the traditional structure by 30%-45% without sacrificing speed is presented. For fixed coefficient filters using canonic signed digit multipliers, the integrated circuit chip area of an LWDF is dominated by the adders. Application of the concept of pipeline interleaving and retiming to the traditional LWDF stru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • n-dimensional minimal state-space realization

    Publication Year: 1991 , Page(s): 340 - 343
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (216 KB)  

    An algorithm is presented for the minimal state-space realization of an n-dimensional (n-D) system whose transfer function can be expanded to a continued fraction. The state-space representation is directly derived from a circuit block diagram realization of the n-D system, and it is given in closed form. The method is based on the design of the primitive signal flow gra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A low-power high-speed 10-bit CMOS-compatible D/A converter

    Publication Year: 1991 , Page(s): 322 - 326
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (568 KB)  

    A 10-b multiple-current-source digital-to-analog converter has been implemented in a 3-μm p-well CMOS process using CMOS-compatible split-collector lateral bipolar transistors as unit current sources. This converter requires an active area of 1.3 mm2 and is capable of operating at full-scale (FS) currents ranging from 50 nA to 1 mA. High switching speed is obtained at low current lev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some prominent aspects of the inverse Chebyshev functions

    Publication Year: 1991 , Page(s): 320 - 322
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (248 KB)  

    It is shown that, given the magnitude specifications in the passband and stopband, the inverse Chebyshev functions require the identical order n as the Chebyshev counterparts. The phase and time-delay characteristics of the inverse Chebyshev functions as compared to Chebyshev functions are investigated. Unlike the Chebyshev or elliptic filters, the inverse Chebyshev functions possess the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear and nonlinear image restoration under the presence of mixed noise

    Publication Year: 1991 , Page(s): 258 - 272
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1752 KB)  

    The restoration of images in the presence of mixed noise is considered. An approach that exploits space-varying objective functions, which results in locally varying filtering schemes for the restoration problem, is introduced. The analysis is performed for both linear and nonlinear image-formation systems. It is found that the approach results in a degradation of the detailed structure existing i... View full abstract»

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