Fast convolution algorithms allow realizing efficient FIR filtering but they are often not well-suited for real-time processing. For this, advanced concepts are needed, which combine computational efficiency with the demand for low latencies. Partitioned convolution methods are the state of the art. They split filter impulse responses into several subfilters, which are then implemented using fast convolution techniques. For these algorithms the filter partitioning is a key parameter. It can be optimized for maximum computational efficiency but this does not take other side-effects into account, such as the sheer practical realizability. This paper reconsiders optimal non-uniform filter partitions not only with respect to their computational efficiency but as well to their implications for practical implementations, the load distribution and the restrictions on filter adaptions. It is shown that an optimization focusing purely on minimal computational load leads to impractical results. Techniques are presented allowing to control the optimization in order to obtain practical results. The resulting filter partitions are analyzed and their computational complexity is examined.
Click to purchase paper as a non-member or you can login as an AES member to see more options.
No AES members have commented on this paper yet.
To be notified of new comments on this paper you can
subscribe to this RSS feed.
Forum users should login to see additional options.
If you are not yet an AES member and have something important to say about this paper then we urge you to join the AES today and make your voice heard. You can join online today by clicking here.
