Efficient design of high-complexity interleaved DFT modulated filter bank

•Several new properties of the interleaved DFT modulated filter bank are presented.•A bi-iterative unconstrained quadratic program (BI-UQP) algorithm is proposed to design the filter bank.•The algorithm can lead to filter bank with better overall performance than the existing method.•The algorithm can design the filter bank with a large number of subbands and PF of very long length.

This paper presents several novel properties of the interleaved DFT modulated filter bank and efficient algorithm for designing the filter bank with a very large number of channels and very long filters (also known as high-complexity). For interleaved DFT modulated filter bank, we find a new property of the transfer function and aliasing transfer functions, by which the complexity of the calculation of these functions can be dramatically reduced over that by the traditional way. Also, a time-domain condition is derived for the filter bank to have no transfer function distortion. Based on new properties, a bi-iterative unconstrained quadratic program (BI-UQP) algorithm is proposed to design the filter bank. Numerical examples and comparisons with other method are included to demonstrate the effectiveness of the proposed method.