The Worst-Case DFT Filter Bank Design with Sub-channel Variations
In this paper, we consider an optimal design of a DFT filter bank subject to subchannel variation constraints. The design problem is formulated as a minimax optimization problem. By exploiting the properties of this minimax optimization problem, we show that it is equivalent to a semi-infinite optim...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Book Chapter |
| Published: |
Springer
2015
|
| Online Access: | http://link.springer.com/chapter/10.1007/978-3-662-47044-2_10#page-1 http://hdl.handle.net/20.500.11937/36573 |
| Summary: | In this paper, we consider an optimal design of a DFT filter bank subject to subchannel variation constraints. The design problem is formulated as a minimax optimization problem. By exploiting the properties of this minimax optimization problem, we show that it is equivalent to a semi-infinite optimization problem in which the continuous inequality constraints are only with respect to frequency. Then, a computational scheme is developed to solve such a semi-infinite optimization problem. Simulation results show that, for a fixed distortion level, the aliasing level between different subbands is significantly reduced, in some cases up to 28 dB, when compared with that obtained by the bi-iterative optimization method without consideration of the subchannel variations. |
|---|