Optimal design of nonuniform FIR transmultiplexer using semi-infinite programming

Authors:
C.Y.-F. Ho;Bingo Ling;Yan-Qun Liu;P.K.-S. Tam;Kok-Lay Teo
Affiliations:
Dept. of Electron. & Inf. Eng., Hong Kong Polytech. Univ., China;-;-;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
2005

Citing 0
Cited 5

Design of nonuniform filter bank transceivers for frequency selective channels

EURASIP Journal on Applied Signal Processing
Design of multiplier-less nonuniform filter bank transmultiplexer using genetic algorithm

Signal Processing
Dynamic Frequency-Band Reallocation and Allocation: from Satellite-Based Communication Systems to Cognitive Radios

Journal of Signal Processing Systems
Artificial bee colony algorithm for the design of multiplier-less nonuniform filter bank transmultiplexer

Information Sciences: an International Journal
Empirical formula for designing a class of linear phase FIR single band PCLS filters

Digital Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

This correspondence considers an optimum nonuniform finite impulse response (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.