Improvements of a complex FIR filter design algorithm

Schulist, M.

doi:10.1016/0165-1684(90)90078-d

Cited by 39 publications

(15 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, three additional design examples are given in which the first two examples have also been considered in [6]- [8]. Again, the algorithm was programmed in MatLab and run on an HP 400 Workstation.…”

Section: Additional Simulation Resultsmentioning

confidence: 99%

An efficient implementation of Lawson's algorithm with application to complex Chebyshev FIR filter design

Tseng

1995

IEEE Trans. Circuits Syst. II

View full text Add to dashboard Cite

This paper presents an efficient implementation of Lawson's algorithm and illustrates its application in complex Chebyshev FIR filter design. It is shown that the update terms in Lawson's algorithm can be efficiently achieved by computing a proper subspace projection, provided that the number of points involved in Lawson's algorithm is sufficiently small (not much greater than n where n is the number of variables). An application of this particular implementation form for Lawson's algorithm is then demonstrated by using it to solve the subproblems involved in a multiple exchange algorithm. In particular, this exchange algorithm is based on generalizing Remez second exchange algorithm to the complex case which requires solving a sequence of subproblems where each subproblem is itself a complex Chebyshev approximation problem defined over a finite number of points; the subproblems are systematically defined using a simple exchange procedure. The effectiveness of this multiple exchange algorithm for designing complex FIR filters is illustrated through various design examples, including a long filter with length n =125.

show abstract

Section: Additional Simulation Resultsmentioning

confidence: 99%

An efficient implementation of Lawson's algorithm with application to complex Chebyshev FIR filter design

Tseng

1995

IEEE Trans. Circuits Syst. II

View full text Add to dashboard Cite

show abstract

“…(7). Our approach is an extension of [6], where a procedure for the design of FIR filters with a complex-valued desired frequency response is proposed.…”

Section: :[mentioning

confidence: 99%

“…With degree N I = 219, the stopband attenuation is 80 dB (quantized coefficients). It is designed using complex Chebychev approximation [7], and it performs the equalization of the following sections, the second stage H i , ( z ) ( fig. 5a), and the analog low pass Hc(s), a BW filter of degree 3 and cut-off frequency 30 kHz.…”

Section: :[mentioning

confidence: 99%

Design and implementation of sigma-delta D/A converters with optimized loop filters

Horbach

Lang

1991

1991 IEEE International Symposium on Circuits and Systems (ISCAS)

View full text Add to dashboard Cite

In this contribution we present two new procedures for the design of optimum loop filters for oversampling D/A converters. FIR as well as IIR systems are proposed for this purpose. Whereas the nonrecursive filters can be implemented more easily in combination with the interpolator, the recursive ones show better results in terms of the desired noise suppression for a given oversampling ratio. Stable modulators of arbitrary order can be designed with any desired number of quantization levels at the output. Examples of practical implementations are given in the final section of the paper.

show abstract

“…In Preuss' algorithm, there appears to be no theoretical proof that the algorithm is convergent or, when it does, that the obtained approximation is optimal in some sense. Schulist [10], suggested a modified Preuss algorithm that improved the convergence of the algorithm.…”

Section: Introductionmentioning

confidence: 99%

Design of FIR Hilbert transformers and differentiators in the complex domain

Komodromos

Russell²,

Tang³

1998

IEEE Trans. Circuits Syst. I

View full text Add to dashboard Cite

This paper presents a method for the design of FIR Hilbert transformers and differentiators in the complex domain. The method can be used to obtain conjugate-symmetric designs with smaller group delay compared to linear-phase designs. Non-conjugate symmetric Hilbert transformers are also designed. This paper is an extension of our previous work [1], which presented the algorithm for the design of standard frequency selective filters. The minimax criterion is used and the Chebychev approximation is posed as a linear optimization problem. The primal problem is converted to its dual and is solved using an efficient quadratically convergent algorithm developed by Tang [2]. When a constant group delay is specified, the filter designs have almost linear phase in the passbands. When the specified group delay is half the filter length, the algorithm results in exactly linear-phase designs.

show abstract

Improvements of a complex FIR filter design algorithm

Cited by 39 publications

References 8 publications

An efficient implementation of Lawson's algorithm with application to complex Chebyshev FIR filter design

An efficient implementation of Lawson's algorithm with application to complex Chebyshev FIR filter design

Design and implementation of sigma-delta D/A converters with optimized loop filters

Design of FIR Hilbert transformers and differentiators in the complex domain

Contact Info

Product

Resources

About