Optimal design of nonuniform FIR transmultiplexer using semi-infinite programming

Ho, C. Y.-F., Ling, Wing-Kuen, Liu, Yan-Qun , Tam, P. K. S. and Teo, Kok-Lay (2005) Optimal design of nonuniform FIR transmultiplexer using semi-infinite programming. IEEE Transactions on Signal Processing, 53 (7). pp. 2598-2603. ISSN 1053-587x

Full content URL: http://dx.doi.org/10.1109/TSP.2005.849209

Documents
letter_optim_transmultiplexer.pdf
[img]
[Download]
[img]
Preview
PDF
letter_optim_transmultiplexer.pdf - Whole Document

246kB
Item Type:Article
Item Status:Live Archive

Abstract

This paper considers an optimum nonuniform FIR transmultiplexer design problem subject to specifications in the frequency domain. Our objective is to minimize the sum of the ripple energy for all the individual filters, subject to the specifications on amplitude and aliasing distortions, and to the passband and stopband specifications for the individual filters. This optimum nonuniform transmultiplexer design problem can be formulated as a quadratic semi-infinite programming problem. The dual parametrization algorithm is extended to this nonuniform transmultiplexer design problem. If the lengths of the filters are sufficiently long and the set of decimation integers is compatible, then a solution exists. Since the problem is formulated as a convex problem, if a solution exists, then the solution obtained is unique and the local solution is a global minimum.

Additional Information:This paper considers an optimum nonuniform FIR transmultiplexer design problem subject to specifications in the frequency domain. Our objective is to minimize the sum of the ripple energy for all the individual filters, subject to the specifications on amplitude and aliasing distortions, and to the passband and stopband specifications for the individual filters. This optimum nonuniform transmultiplexer design problem can be formulated as a quadratic semi-infinite programming problem. The dual parametrization algorithm is extended to this nonuniform transmultiplexer design problem. If the lengths of the filters are sufficiently long and the set of decimation integers is compatible, then a solution exists. Since the problem is formulated as a convex problem, if a solution exists, then the solution obtained is unique and the local solution is a global minimum.
Keywords:Nonuniform transmultiplexer, semi-infinite programming, dual parameterization.
Subjects:H Engineering > H610 Electronic Engineering
Divisions:College of Science > School of Engineering
ID Code:3070
Deposited On:28 Jul 2010 14:29

Repository Staff Only: item control page