Cart (Loading....) | Create Account
Close category search window
 

Optimal design using min - max criteria for two-dimensional recursive digital filters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

This paper concerns design techniques for two-dimensional recursive digital filters in the frequency domain. The filters are designed so as to approximate simultaneously prescribed specifications of magnitude and group delay by treating the coefficients of the transfer function as decision variables. These approximation problems are formulated as minimizing the maximum errors between the filter's response and the desired one with respect to the magnitude and group delay characteristics. The following two types of optimization techniques are proposed: (1) the Min-Max Type Optimization Satisfaction Method and (2) the Min-Max Type Multi-Objective Optimization Method. The former is a method that optimizes (approximates) the magnitude characteristic in a min-max sense under the satisfaction condition requiring that the maximum error of group delay should be kept below the tolerance level. The latter is a method that optimizes the vector-valued objective function of the maximum errors of magnitude and group delay. The optimal solution for this multiobjective problem is obtained by combining the "satisfaction approach" and the "maximum component minimization technique" for vector optimization. Since these problems include maximum-valued functions in the performance indices, as a nondifferentiable optimization technique, we apply Mifflin's algorithm using generalized gradients. Several numerical examples are presented.

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:33 ,  Issue: 5 )

Date of Publication:

May 1986

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.