An Alternative Complexity Reduction Method for Partitioned-Block Frequency-Domain Adaptive Filters

Partitioned-block frequency-domain adaptive filters provide lower algorithmic complexity than their time-domain counterparts. However, for certain applications, it is desirable to reduce complexity even further. This can be achieved by reducing the complexity of the constraint, or linearization, of the circular correlations. Existing methods are either suboptimal or are not sufficiently flexible in terms of the design parameters. Therefore, an alternative complexity reduction method is proposed, which achieves near-optimal performance and which, in addition, is flexible in terms of the design parameters, as these can be arbitrarily chosen.