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 II: Analog and Digital Signal Processing, IEEE Transactions on

Issue 10 • Date Oct 1995

Filter Results

Displaying Results 1 - 10 of 10
  • Analog-input digital phase-locked loops for precise frequency and phase demodulation

    Publication Year: 1995 , Page(s): 621 - 630
    Cited by:  Papers (16)  |  Patents (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (816 KB)  

    Most conventional analog-input digital phase-locked loops (ADPLL's) suffer from the effect of in-loop quantization and from nonlinear behavior caused by the approximations inherent in practical digitally controlled oscillators (DCO's). The resulting errors limit the accuracy of ADPLL-based frequency demodulation and usually make ADPLL-based phase demodulation impractical because of severe phase-drift problems. This paper presents a new class of ADPLL's that are insensitive to the deleterious effects of quantization, and do not exhibit nonlinear behavior when implemented with practical DCO's. The ADPLL's are well suited to applications requiring precise frequency demodulation, and can also be used for phase demodulation because their quantization error is well behaved even after discrete-time integration. The paper establishes an analogy between the ADPLL's and delta-sigma modulators, and applies existing delta-sigma modulator results to predict the frequency and phase demodulation accuracy of the ADPLL's. A mechanization of the general architecture consisting of easily implemented components such as analog integrators, digital flip-flops, and digital counters is then presented and analyzed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of optimal digital filter using a parallel genetic algorithm

    Publication Year: 1995 , Page(s): 673 - 675
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (252 KB)  

    This paper describes the use of a parallel genetic algorithm to design a direct form of a finite word length (FWL), finite impulse response (FIR) low pass digital filter. The results of the proposed design technique are compared to two other proposed methods, an integer programming technique and roundoff of the optimal floating point set of coefficients. Using the Chebyshev metric as the comparison criterion, design of the low pass filter by the parallel genetic algorithm technique proved to be superior to the other methodologies View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Short-time Fourier transforms using cascade filter structures

    Publication Year: 1995 , Page(s): 631 - 641
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (720 KB)  

    A wide class of short-time Fourier transforms (STFT's), or spectrograms, can be obtained by applying an infinite-length analysis window, corresponding to an impulse response of an IIR filter, at every data sample and then taking the Fourier transform. The use of the cascade form realization of the analysis window allows simple and recursive generations of a number of distinct STFT's with different tradeoff between temporal and spectral resolutions. The temporal-spectral resolution diversity of all STFT's (spectrograms) associated with the same window is a function of its poles and zeros as well as their order of cascade. Closed-form expressions of such diversity are derived for the case of multiple-pole and all pole analysis windows View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast 2-D stability test procedure based on FFT and its computational complexity

    Publication Year: 1995 , Page(s): 676 - 678
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (196 KB)  

    This note presents a fast stability test algorithm for two-dimensional (2D) systems which requires max {O(m2), O(mn 2 log2 mn), O(mn4)} multiplications to test the stability of 1/(1+Σi=0 i+jnΣ j=0 ≠0m bijz1iz2j) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A high-speed realization of a residue to binary number system converter

    Publication Year: 1995 , Page(s): 661 - 663
    Cited by:  Papers (59)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (272 KB)  

    This paper proposes a new high-speed ROM-less residue-to-binary converter for the three moduli residue number systems (RNS) of the form {2n-1, 2n, 2n+1}. Unlike any other converter, its delay involves the time of only one 1's complement addition of two 2n-bit numbers which is only 2/3 of the binary range of the RNS equal to a=3n. Thus, it is potentially the fastest known residue-to-binary converter for any nontrivial RNS for a given a View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance analysis of pulse stream neural and fuzzy computing systems

    Publication Year: 1995 , Page(s): 642 - 660
    Cited by:  Papers (29)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1592 KB)  

    This paper presents an annotated overview of existing hardware implementations of artificial neural systems based on “pulse stream” modulations. Pulse streams are quasi-periodic binary waveforms which convey analog information on waveform timing. The theoretical bases of pulse stream computation are shown for the major techniques, and basic circuits are described for most neural and fuzzy functions. Pulse stream modulations and multiplexing are then analyzed in terms of accuracy, response time, and both power and energy requirements. The performances of the various techniques are compared both with each other, and with those of other analog and digital computing systems. This paper shows that pulse stream systems are comparable with analog systems in terms of size, and comparable with both analog and digital systems in terms of speed. In addition, they offer an increased flexibility if compared to analog systems, and they have both a lower power dissipation and a lower computation energy figure than digital systems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trainable FIR-order statistic hybrid filters

    Publication Year: 1995 , Page(s): 663 - 666
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (392 KB)  

    In this paper, an optimization algorithm for FIR-order statistic hybrid (FIR-OS) filters is introduced. The algorithm minimizes the total cost function of the filter output by dividing the training set into subsets using soft order statistics criteria and then applying conjugate gradient search for the subfilters. The amplitude extraction of pulses acquired from high energy physics detectors is presented as an application example. The trained FIR-OS filter is shown to give a precise amplitude estimate in the presence of sample timing jitter View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved model for the slewing behavior of opamps

    Publication Year: 1995 , Page(s): 679 - 681
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (232 KB)  

    A new time-domain model for the slewing behavior of two-stage opamps is presented. This model includes the effects of the load capacitance, compensation capacitance, device sizes and the nonlinear behavior of the transistors during the slewing period. This model improves on the commonly used constant current models and allows for more predictable designs. The model shows good agreement with simulations. Circuit design results using the traditional and new improved models are presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum denominator-multiplier pipelined recursive digital filters

    Publication Year: 1995 , Page(s): 666 - 672
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (600 KB)  

    Recursive digital filters implemented in direct form, transpose direct form, or cascade form can be pipelined with a new minimum denominator-multiplier (MDM) algorithmic transformation pipelining technique that permits hybrid pipelined solutions between the clustered look-ahead and scattered look-ahead techniques introduced by Parhi and Messerschmitt (1989). The new MDM technique makes use of asymmetrical scattering, in addition to symmetrical scattering, to achieve stable pipelined recursive digital filters which in most cases have substantially fewer added multipliers but in no case will have more added multipliers than the clustered look-ahead or scattered look-ahead techniques. Furthermore, the MDM technique always results in a minimum number of denominator multipliers resulting in a stable pipelined recursive digital filter which in nearly every case has fewer multipliers than the minimum order augmentation technique recently introduced by Lim and Liu (1992). Most importantly, the MDM technique provides a unified approach to pipelining recursive digital filters that 1) guarantees the minimum number of denominator multipliers for stability, 2) usually provides substantial reduction in the number of required multipliers compared to any other approach, and 3) reduces to any one of the other approaches if that approach results in a minimum denominator-multiplier realization View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new composite gradient algorithm to achieve global convergence

    Publication Year: 1995 , Page(s): 681 - 684
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (356 KB)  

    Insufficient-order system identification can result in a multimodal mean square error surface on which a gradient-type algorithm may converge to a local minimum. In this letter a new composite gradient algorithm (CGA) is presented which is due to achieve global convergence when the output error surface contains local minima. The proposed algorithm combines the useful properties of the output error (OE) and equation error (EE) adaptive filtering methods using a new dynamic error surface. The CGA provides a single convergence point for the gradient-search algorithm independently of the initial conditions. The “global convergence” conjecture is illustrated by simulation examples showing good global convergence properties even in such undermodeled cases when the Steiglitz-McBride algorithm fails View full abstract»

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

Aims & Scope

This title ceased production in 2003. The current updated title is IEEE Transactions on Circuits and Systems II: Express Briefs.

Full Aims & Scope