z-logo
open-access-imgOpen Access
Filter Design Problems with Convex Optimization
Author(s) -
Sachin Rastogi,
Sanjeev Rajan
Publication year - 2018
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2018916544
Subject(s) - computer science , filter (signal processing) , convex optimization , regular polygon , mathematical optimization , computer vision , mathematics , geometry
In this paper we consider the design of FIR filters that satisfy magnitude specifications. We refer to such design problems as magnitude filter design problems. In this paper it is shown that by a change of variables, a wide variety of magnitude filter design problems can be posed as convex optimization problems, i.e., problems in which the objective and constraint functions are convex.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom