Authors:
Ricardo A Vargas,
Charles Sidney Burrus,
Page (NA) Paper number 2396
Abstract:
This paper presents an efficient adaptive algorithm for designing FIR
digital filters that are efficient according to an L_p error criteria.
The algorithm is an extension of Burrus' iterative reweighted least-squares
(IRLS) method for approximating L_p filters. Such algorithm will converge
for most significant cases in a few iterations. In some cases however,
the transition bandwidth is such that the number of iterations increases
significantly. The proposed algorithm controls such problem and drastically
reduces the number of iterations required.
Authors:
Johnny Holmberg,
Lennart Harnefors,
Svante Signell,
Page (NA) Paper number 2346
Abstract:
Quantization noise levels of two low-sensitive allpass filter structures,
namely wave digital circulator filters (WDCF) and lossless digital
integrator filters (LDIF), are compared. Allpass filters are of interest
for design of lowpass and bandpass lattice filters. The results show,
primarily, that second-order LDIFs have lower total quantization noise
gains than corresponding WCDFs for any pole configuration within the
right half-circle of the z plane. The benefit of using ladder LDIFs
rather than cascaded first and second order sections is also demonstrated.
Authors:
Chris W Schwarz,
Soura Dasgupta,
Page (NA) Paper number 2183
Abstract:
This paper proposes a new lattice filter structure that has the following
properties. When the filter is Linear Time Invariant (LTI), it is equivalent
to the celebrated Gray Markel Lattice. When the lattice parameters
vary with time it sustains arbitrary rate of time variations without
sacrificing a prescribed degree of stability, provided that the lattice
coefficients are magnitude bounded in a region where all LTI lattices
have the same degree of stability. We also show that the resulting
LTV lattice obeys an energy contraction condition. This structure thus
generalizes the normalized Gray-Markel lattice which has similar properties
but only with respect to stability as opposed to relative stability.
Authors:
Karl E Nelson,
Michael A Soderstrand,
Page (NA) Paper number 2170
Abstract:
A new digital heterodyne filter is proposed that allow a prototype
IIR or FIR filter to be shifted through the entire range of digital
frequencies from DC to the Nyquist frequency. The unique properties
of this new tunable filter are the range of tunability and the fact
that all images created by the heterodyne process are cancelled. The
proposed heterodyne filter is suitable both as a tunable filter and
for use with standard adaptive algorithms to design adaptive digital
filters --- especially adaptive notch filters.
Authors:
Niranjan Damera-Venkata,
Brian L Evans,
Page (NA) Paper number 2141
Abstract:
We present a generalized optimal minimum phase digital FIR filter design
algorithm that supports (1) arbitrary magnitude response specifications,
(2) high coefficient accuracy, and (3) real and complex filters. The
algorithm uses the Discrete Hilbert Transform relationship between
the magnitude spectrum of a causal real sequence and its minimum phase
delay phase spectrum given by Cizek. We extend the transform pair to
the complex case. We show that the algorithm gives arbitrary coefficient
accuracy. We present design examples that exceed the coefficient accuracy
of the optimal real minimum phase filters reported by Chen and Parks
and reduce the length of the optimal complex linear phase filters designed
by Karam and McClellan.
Authors:
Mathias C. Lang,
Page (NA) Paper number 1234
Abstract:
We present a fast multiple exchange algorithm that designs FIR filters
with magnitude and phase specifications subject to constraints on the
error function. We use a constrained least squares criterion which
minimizes error energy and imposes bounds on the magnitude of the error.
We can trade error energy versus peak error, and complex least squares
and complex Chebyshev filters result as special cases. We provide a
Matlab program implementing the proposed algorithm. This program has
proved to be efficient and reliable.
Authors:
C.H. Tseng, Australian Telecommunications Research Institute (Australia)
Z. Zang, Australian Telecommunications Research Institute (Australia)
K.L Teo, Australian Telecommunications Research Institute (Australia)
Antoni Cantoni, Australian Telecommunications Research Institute (Australia)
Page (NA) Paper number 1180
Abstract:
The envelope-constrained filtering problem is concerned with the design
of a filter such that the noise enhancement is minimized while the
noiseless filter response stays within an envelope. Naturally, the
optimum filter response to the prescribed input signal tends to touch
the output boundaries at some points. Consequently, any disturbance
to the prescribed input signal could result in the output constraints
being violated. In this paper, we formulate a semi-infinite constrained
optimization problem in which the margin of the constraint robustness
of the filter is maximized. Using a smoothing technique, it is shown
that the solution of the optimization problem can be obtained by solving
a sequence of strictly convex optimization problems with integral cost.
Authors:
Anthony G. Constantinides, Signal Processing Section, Imperial College, UK (U.K.)
Tania Stathaki, Signal Processing Section, Imperial College, UK (U.K.)
Page (NA) Paper number 1064
Abstract:
The objective of this paper is to produce a general formulation of
an order reduction procedure for testing the stability of discrete
time linear systems. The order reduction procedure involves a series
of iterations and, at each step of the iteration process, the the aim
is to derive a new polynomial of order lower than the given one. The
new polynomial serves as the input to the following iteration. A specific
form of the formulation is considered in which first order auxiliary
polynomials are employed in the order reduction process. There follows
from this a new testing procedure. The current methods appear as special
cases of the new test. An extension is further proposed which employs
second order auxiliary polynomials within the order reduction formulation.
This second order form is however for all practical cases the limit
to which such a procedure can be put.
|