Results 1  10
of
10
Linear Matrix Inequality Formulation of Spectral Mask Constraints
, 2000
"... The design of a finite impulse response filter often involves a spectral 'mask' which the mag nitude spectrum must satisfy. This constraint can be awkward because it is semiinfinite, since it yields two inequality constraints for each frequency point. In current practice, spectral masks are oft ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
The design of a finite impulse response filter often involves a spectral 'mask' which the mag nitude spectrum must satisfy. This constraint can be awkward because it is semiinfinite, since it yields two inequality constraints for each frequency point. In current practice, spectral masks are often approximated by discretization, but in this paper we will show that piecewise constant masks can be precisely enforced in a finite and convex manner via linear matrix inequalities.
Constrained Least Square Design Of Fir Filters Without Specified Transition Bands
 IEEE Trans. on Signal Processing
, 1995
"... We consider the design of digital filters and discuss the inclusion of explicitly specified transition bands in the frequency domain design of FIR filters. We put forth the notion that explicitly specified transition bands have been introduced in the filter design literature as an indirect and often ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
We consider the design of digital filters and discuss the inclusion of explicitly specified transition bands in the frequency domain design of FIR filters. We put forth the notion that explicitly specified transition bands have been introduced in the filter design literature as an indirect and often inadequate approach for dealing with discontinuities in the desired frequency response. We also present a rapidly converging, robust, simple algorithm for the design of optimal peak constrained least square lowpass FIR filters that does not require the use of transition bands. This versatile algorithm will design linear and minimum phase FIR filters and gives the best L2 filter and a continuum of Chebyshev filters as special cases. 1. INTRODUCTION We consider the definition of optimality for digital filter design and conclude that a constrained least squared error criterion with no transition band is often the best approximation measure for many physical filtering problems. This comes fro...
Exchange Algorithms for the Design of Linear Phase FIR Filters and Differentiators Having Flat Monotonic Passbands and Equiripple Stopbands
 DEPT. OF ELECTRICAL AND COMPUTER ENGINEERING, RICE UNIVERSITY
, 1996
"... This paper describes a modification of a technique proposed by Vaidyanathan for the design of filters having flat passbands and equiripple stopbands. The modification ensures that the passband is monotonic and does so without the use of concavity constraints. Another modification described in this p ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
This paper describes a modification of a technique proposed by Vaidyanathan for the design of filters having flat passbands and equiripple stopbands. The modification ensures that the passband is monotonic and does so without the use of concavity constraints. Another modification described in this paper adapts the method of Vaidyanathan to the design of lowpass differentiators having a specified degree of tangency at ! = 0.
Exchange Algorithms that Complement the ParksMcClellan Algorithm for LinearPhase FIR Filter Design
 IEEE TRANS. ON CIRCUITS AND SYSTEMS II
, 1996
"... This paper describes an exchange algorithm for the frequency domain design of linearphase FIR equiripple filters where the Chebyshev error in each band is specified. The algorithm is a hybrid of the algorithm of Hofstetter, Oppenheim and Siegel and the ParksMcClellan algorithm. The paper also desc ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
This paper describes an exchange algorithm for the frequency domain design of linearphase FIR equiripple filters where the Chebyshev error in each band is specified. The algorithm is a hybrid of the algorithm of Hofstetter, Oppenheim and Siegel and the ParksMcClellan algorithm. The paper also describes a modification of the ParksMcClellan algorithm where either the passband or the stopband ripple size is specified and the other is minimized.
An iterative filterbank approach for extracting sinusoidal parameters from quasiharmonic sounds
 In Proceedings of the 2003 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics
, 2003
"... We propose an iterative filterbank method for tracking the parameters of exponentially damped sinusoidal components of quasiharmonic sounds. The quasiharmonic criteria specialize our analysis to a wide variety of acoustic instrument recordings while allowing for inharmonicity. The filterbank splits ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We propose an iterative filterbank method for tracking the parameters of exponentially damped sinusoidal components of quasiharmonic sounds. The quasiharmonic criteria specialize our analysis to a wide variety of acoustic instrument recordings while allowing for inharmonicity. The filterbank splits the recorded signal into subbands, one per harmonic, in which timevarying parameters of multiple closelyspaced sinusoids are estimated using a SteiglitzMcBride/Kalman approach. Averaged instantaneous frequency estimates are used to update the center frequencies and bandwidths of the subband filters; by so doing, the filterbank progressively adapts to the inharmonicity structure of a source recording. 1.
Design Problems For Nonrecursive Digital Filters I
, 1997
"... The four main design problems for nonrecursive digital filters in the frequency domain are properly formulated as approximation problems and studied in regard to the existence of solutions and the convergence of the approximation errors. These are the problems of approximating a frequency response a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The four main design problems for nonrecursive digital filters in the frequency domain are properly formulated as approximation problems and studied in regard to the existence of solutions and the convergence of the approximation errors. These are the problems of approximating a frequency response and a magnitude response and the problems of simultaneously approximating a magnitude and phase response and a magnitude and group response delay respectively. The errors are measured by an arbitrary L p  resp. l p norm, 1 p 1; and constraints on the filter coefficients are permitted. The topic of this first part of the paper is the approximation of a prescribed frequency response where linearphase filters are considered separately.
Some Exchange Algorithms Complementing the ParksMcClellan Program for Filter Design
 In International Conference on Digital Signal Processing
, 1995
"... In this paper, several modifications of the ParksMcClellan (PM) program are described that treat the band edges differently than does the PM program. The first exchange algorithm we describe allows (1) the explicit specification of ffi p and ffi s and (2) the specification of the halfmagnitude fre ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper, several modifications of the ParksMcClellan (PM) program are described that treat the band edges differently than does the PM program. The first exchange algorithm we describe allows (1) the explicit specification of ffi p and ffi s and (2) the specification of the halfmagnitude frequency, !o . The set of lowpass filters obtained with this algorithm is the same as the set of lowpass filters produced by the PM algorithm. We also find that if passband monotonicity is desired in the design of filters having very flat passbands it is also desirable to modify the usual way of treating the band edges. The second multiple exchange algorithm we describe produces filters having a specified ffi p and ffi s but also includes a measure of the integral square error. 1 Introduction In this paper, several modifications of the ParksMcClellan (PM) program [11, 13, 17] are described. Recall that in their approach to the design of digital filters, the band edges are specified and the ...
Antialias and antiimage filtering: The benefits of 96kHz sampling rate formats for those who cannot hear above 20kHz.
, 1998
"... Reports that 96kHz sampled digital audio systems have greater transparency than those sampling at 44.1kHz apparently conflict with knowledge of the capability of human hearing. The band limiting filters required are examined for a role in producing these differences. Possible mechanisms are presente ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Reports that 96kHz sampled digital audio systems have greater transparency than those sampling at 44.1kHz apparently conflict with knowledge of the capability of human hearing. The band limiting filters required are examined for a role in producing these differences. Possible mechanisms are presented for these filters to produce audible artefacts and filter designs avoiding these artefacts are illustrated.
Optimal Filter Design to Compute the Mean of Cardiovascular Pressure Signals
"... Abstract—The mean pressure is a term used to describe the baseline trend of physiological pressure signals that excludes fluctuations due to the cardiac cycle and, in some cases, the respiratory cycle. In many clinical applications and bedside monitoring devices, the mean pressure is estimated with ..."
Abstract
 Add to MetaCart
Abstract—The mean pressure is a term used to describe the baseline trend of physiological pressure signals that excludes fluctuations due to the cardiac cycle and, in some cases, the respiratory cycle. In many clinical applications and bedside monitoring devices, the mean pressure is estimated with a 3–8 s moving average. We suggest that the mean pressure is best defined in terms of its frequency domain properties. This definition makes it possible to determine solutions that are both optimal and practical. We demonstrate that established methods of optimal finite impulse response (FIR) filter design produce estimates of the mean pressure that are significantly more accurate than the moving average. These filters have no more computational cost, are less sensitive to artifact, have shorter delays, and greater sensitivity to acute events. Index Terms—Clinical monitoring, filter design, finite impulse response, mean pressure, patient monitors, trend. I.
WAVELET DECOMPOSITION VIA THE STANDARD TABLEAU SIMPLEX METHOD OF LINEAR PROGRAMMING
"... Wavelet decomposition problems have been modeled as linear programs – but only as extremely dense problems. Both revised simplex and interior point methods have difficulty with dense linear programs. The question then is how to get around that issue. In our experiments the standard method outperform ..."
Abstract
 Add to MetaCart
Wavelet decomposition problems have been modeled as linear programs – but only as extremely dense problems. Both revised simplex and interior point methods have difficulty with dense linear programs. The question then is how to get around that issue. In our experiments the standard method outperforms a revised implementation for these problems. Moreover, the standard method can be easily and scalably distributed. Hence the standard simplex method should be useful in solving wavelet decomposition problems.