Solving the Selesnick-Burrus Filter Design Equations Using Computational Algebra and Algebraic Geometry

Details Solving the Selesnick-Burrus Filter Design Equations Using Computational Algebra and Algebraic Geometry Solving the Selesnick-Burrus Filter Design Equations Using Computational Algebra and Algebraic Geometry

2002-09-19

arxiv.org/abs/math/0209248v1

Mathematics

Numerical Analysis

34 pages, 2 .eps figures

Scientific paper

In a recent paper, I. Selesnick and C.S. Burrus developed a design method for maximally flat FIR low-pass digital filters with reduced group delay. Their approach leads to a system of polynomial equations depending on three integer design parameters $K,L,M$. In certain cases (their ``Region I''), Selesnick and Burrus were able to derive solutions using only linear algebra; for the remaining cases ("Region II''), they proposed using Gr\"obner bases. This paper introduces a different method, based on multipolynomial resultants, for analyzing and solving the Selesnick-Burrus design equations. The results of calculations are presented, and some patterns concerning the number of solutions as a function of the design parameters are proved.

Affiliated with

Also associated with

No associations

Rating

Solving the Selesnick-Burrus Filter Design Equations Using Computational Algebra and Algebraic Geometry does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving the Selesnick-Burrus Filter Design Equations Using Computational Algebra and Algebraic Geometry, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving the Selesnick-Burrus Filter Design Equations Using Computational Algebra and Algebraic Geometry will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-538001