5,681 research outputs found

    Efficient and multiplierless design of FIR filters with very sharp cutoff via maximally flat building blocks

    Get PDF
    A new design technique for linear-phase FIR filters, based on maximally flat buildiing blocks, is presented. The design technique does not involve iterative approximations and is, therefore, fast. It gives rise to filters that have a monotone stopband response, as required in some applications. The technique is partially based on an interpolative scheme. Implementation of the obtained filter designs requires a much smaller number of multiplications than maximally flat (MAXFLAT) FIR filters designed by the conventional approach. A technique based on FIR spectral transformations to design new multiplierless FIR filter structures is then advanced, and multiplierless implementations for sharp cutoff specifications are included

    Efficient and multiplierless design of FIR filters with very sharp cutoff via maximally flat building blocks

    Get PDF
    A new design technique for linear-phase FIR filters, based on maximally flat buildiing blocks, is presented. The design technique does not involve iterative approximations and is, therefore, fast. It gives rise to filters that have a monotone stopband response, as required in some applications. The technique is partially based on an interpolative scheme. Implementation of the obtained filter designs requires a much smaller number of multiplications than maximally flat (MAXFLAT) FIR filters designed by the conventional approach. A technique based on FIR spectral transformations to design new multiplierless FIR filter structures is then advanced, and multiplierless implementations for sharp cutoff specifications are included

    Eigenfilters: A new approach to least-squares FIR filter design and applications including Nyquist filters

    Get PDF
    A new method of designing linear-phase FIR filters is proposed by minimizing a quadratic measure of the error in the passband and stopband. The method is based on the computation of an eigenvector of an appropriate real, symmetric, and positive-definite matrix. The proposed design procedure is general enough to incorporate both time- and frequency-domain constraints. For example, Nyquist filters can be easily designed using this approach. The design time for the new method is comparable to that of Remez exchange techniques. The passband and stopband errors in the frequency domain can be made equiripple by an iterative process, which involves feeding back the approximation error at each iteration. Several numerical design examples and comparisons to existing methods are presented, which demonstrate the usefulness of the present approach

    Oversampling PCM techniques and optimum noise shapers for quantizing a class of nonbandlimited signals

    Get PDF
    We consider the efficient quantization of a class of nonbandlimited signals, namely, the class of discrete-time signals that can be recovered from their decimated version. The signals are modeled as the output of a single FIR interpolation filter (single band model) or, more generally, as the sum of the outputs of L FIR interpolation filters (multiband model). These nonbandlimited signals are oversampled, and it is therefore reasonable to expect that we can reap the same benefits of well-known efficient A/D techniques that apply only to bandlimited signals. We first show that we can obtain a great reduction in the quantization noise variance due to the oversampled nature of the signals. We can achieve a substantial decrease in bit rate by appropriately decimating the signals and then quantizing them. To further increase the effective quantizer resolution, noise shaping is introduced by optimizing prefilters and postfilters around the quantizer. We start with a scalar time-invariant quantizer and study two important cases of linear time invariant (LTI) filters, namely, the case where the postfilter is the inverse of the prefilter and the more general case where the postfilter is independent from the prefilter. Closed form expressions for the optimum filters and average minimum mean square error are derived in each case for both the single band and multiband models. The class of noise shaping filters and quantizers is then enlarged to include linear periodically time varying (LPTV)M filters and periodically time-varying quantizers of period M. We study two special cases in great detail

    Frequency response modeling and control of flexible structures: Computational methods

    Get PDF
    The dynamics of vibrations in flexible structures can be conventiently modeled in terms of frequency response models. For structural control such models capture the distributed parameter dynamics of the elastic structural response as an irrational transfer function. For most flexible structures arising in aerospace applications the irrational transfer functions which arise are of a special class of pseudo-meromorphic functions which have only a finite number of right half place poles. Computational algorithms are demonstrated for design of multiloop control laws for such models based on optimal Wiener-Hopf control of the frequency responses. The algorithms employ a sampled-data representation of irrational transfer functions which is particularly attractive for numerical computation. One key algorithm for the solution of the optimal control problem is the spectral factorization of an irrational transfer function. The basis for the spectral factorization algorithm is highlighted together with associated computational issues arising in optimal regulator design. Options for implementation of wide band vibration control for flexible structures based on the sampled-data frequency response models is also highlighted. A simple flexible structure control example is considered to demonstrate the combined frequency response modeling and control algorithms

    A robust and scalable implementation of the Parks-McClellan algorithm for designing FIR filters

    Get PDF
    Preliminary version accepted for publicationInternational audienceWith a long history dating back to the beginning of the 1970s, the Parks-McClellan algorithm is probably the most well-known approach for designing finite impulse response filters. Despite being a standard routine in many signal processing packages, it is possible to find practical design specifications where existing codes fail to work. Our goal is twofold. We first examine and present solutions for the practical difficulties related to weighted minimax polynomial approximation problems on multi-interval domains (i.e., the general setting under which the Parks-McClellan algorithm operates). Using these ideas, we then describe a robust implementation of this algorithm. It routinely outperforms existing minimax filter design routines

    Estimation-based synthesis of H∞-optimal adaptive FIR filtersfor filtered-LMS problems

    Get PDF
    This paper presents a systematic synthesis procedure for H∞-optimal adaptive FIR filters in the context of an active noise cancellation (ANC) problem. An estimation interpretation of the adaptive control problem is introduced first. Based on this interpretation, an H∞ estimation problem is formulated, and its finite horizon prediction (filtering) solution is discussed. The solution minimizes the maximum energy gain from the disturbances to the predicted (filtered) estimation error and serves as the adaptation criterion for the weight vector in the adaptive FIR filter. We refer to this adaptation scheme as estimation-based adaptive filtering (EBAF). We show that the steady-state gain vector in the EBAF algorithm approaches that of the classical (normalized) filtered-X LMS algorithm. The error terms, however, are shown to be different. Thus, these classical algorithms can be considered to be approximations of our algorithm. We examine the performance of the proposed EBAF algorithm (both experimentally and in simulation) in an active noise cancellation problem of a one-dimensional (1-D) acoustic duct for both narrowband and broadband cases. Comparisons to the results from a conventional filtered-LMS (FxLMS) algorithm show faster convergence without compromising steady-state performance and/or robustness of the algorithm to feedback contamination of the reference signal
    corecore