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

Efficient Computation of Frame Bounds Using LMI-Based Optimization

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

4 Author(s)
Li Chai ; Sch. of Inf. Sci. & Eng., Wuhan Univ. of Sci. & Technol., Wuhan ; Jingxin Zhang ; Cishen Zhang ; Mosca, E.

This correspondence presents a simple and effective method for computing the optimal frame bounds of oversampled perfect reconstruction (PR) filter banks (FBs). It first shows that computation of the optimal frame bounds for complex-valued oversampled PR FBs can be formulated as a convex optimization subject to complex-valued linear matrix inequality (LMI) constraints and solved by effective interior-point algorithms. It then deals with discrete-time Weyl-Heisenberg (WH) frames to compute bounds on the WH frames by real-valued LMI optimization. The WH frames are closely related to modulated FBs and have complex coefficients. Four examples are given to illustrate the generality and effectiveness of the proposed method.

Published in:

Signal Processing, IEEE Transactions on  (Volume:56 ,  Issue: 7 )

Date of Publication:

July 2008

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.