scispace - formally typeset
Journal ArticleDOI

Digital filters with equiripple or minimax responses

H. Helms
- 01 Mar 1971 - 
- Vol. 19, Iss: 1, pp 87-93
Reads0
Chats0
TLDR
In this paper, various techniques for determining the coefficients of digital filters which have equiripple or minimax errors are reviewed and occasionally extended, such as mapping, nonlinear programming, and integer programming.
Abstract
Techniques for determining the coefficients of digital filters which have equiripple or minimax errors are reviewed and occasionally extended. These techniques include: 1) mapping to provide equiripple errors in recursive filters; 2) windows for making Fourier spectrum measurements with minimax leakage; 3) the simplex method of linear programming to provide minimax errors in a nonrecursive filter's time response to a known pulse or Fourier transform of its coefficients; 4) nonlinear programming to provide minimax errors for nominally any response and filter; and 5) an integer programming technique to provide minimax error despite quantizing the coefficients of a nonrecursive filter. Some sources of computer programs embodying these techniques are indicated.

read more

Citations
More filters
Journal ArticleDOI

On the use of windows for harmonic analysis with the discrete Fourier transform

F.J. Harris
TL;DR: A comprehensive catalog of data windows along with their significant performance parameters from which the different windows can be compared is included, and an example demonstrates the use and value of windows to resolve closely spaced harmonic signals characterized by large differences in amplitude.
Journal ArticleDOI

Chebyshev Approximation for Nonrecursive Digital Filters with Linear Phase

TL;DR: An efficient procedure for the design of finite-length impulse response filters with linear phase is presented, which obtains the optimum Chebyshev approximation on separate intervals corresponding to passbands and/or stopbands.
Journal ArticleDOI

FIR digital filter design techniques using weighted Chebyshev approximation

TL;DR: In this article, various approaches to designing FIR digital filters using the theory of weighted Chebyshev approximation are discussed and compared on the basis of their capabilities and limitations, and the relationships between filter parameters are briefly discussed for the case of low-pass filters.
Journal ArticleDOI

Synthesis of recursive digital filters using the minimum p-error criterion

TL;DR: In this article, the problem of designing a stable recursive digital filter to have an arbitrarily prescribed frequency response may be considered as an approximation problem using the minimum p -error criterion, which is successfully solved using the Fletcher-Powell algorithm.
Journal ArticleDOI

Linear program design of finite impulse response (FIR) digital filters

TL;DR: The use of linear programming techniques for designing digital filters has become widespread in recent years as discussed by the authors, among the techniques that have been used include steepest descent methods, conjugate gradient techniques, penalty function techniques and polynomial interpolation procedures.
References
More filters
Journal ArticleDOI

The use of fast Fourier transform for the estimation of power spectra: A method based on time averaging over short, modified periodograms

TL;DR: In this article, the use of the fast Fourier transform in power spectrum analysis is described, and the method involves sectioning the record and averaging modified periodograms of the sections.
Journal ArticleDOI

A Current Distribution for Broadside Arrays Which Optimizes the Relationship between Beam Width and Side-Lobe Level

C. L. Dolph
TL;DR: In this article, a one-parameter family of current distributions for symmetric broadside arrays of equally spaced point sources energized in phase was derived, and design curves relating the value of the parameter to side-lobe level as well as the relative current values expressed as a function of side lobe level were given for the cases of 8-, 12-, 16-, 20-, and 24-element linear arrays.
Journal ArticleDOI

What is the fast Fourier transform

TL;DR: The discrete Fourier transform of a time series is defined, some of its properties are discussed, the associated fast method for computing this transform is derived, and some of the computational aspects of the method are presented.
Journal ArticleDOI

Spectral transformations for digital filters

TL;DR: In this paper, the authors describe general transformations for digital filters in the frequency domain, which operate on a lowpass-digital-filter prototype to give either another lowpass or a highpass, bandpass or band-elimination characteristic.
Related Papers (5)