Pages that link to "Item:Q2252696"
From MaRDI portal
The following pages link to A convex optimization method to solve a filter design problem (Q2252696):
Displaying 8 items.
- On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials (Q317123) (← links)
- Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry (Q1415389) (← links)
- A convex optimization approach to the mode acceleration problem (Q1879603) (← links)
- An efficient linear programming solver for optimal filter synthesis (Q3392865) (← links)
- FIR Filter Design by Convex Optimization Using Directed Iterative Rank Refinement Algorithm (Q4618310) (← links)
- Projective view at optimization problem for multiband filter (Q4990355) (← links)
- A convex optimization model for finding non-negative polynomials (Q5965344) (← links)
- An optimisation framework for the development of explicit discrete forward and inverse filters (Q6158541) (← links)