AES E-Library

F. Wefers, and M. Vorländer, "Optimal Filter Partitions for Non-Uniformly Partitioned Convolution," Paper 6-4, (2012 March.). doi: F. Wefers, and M. Vorländer, "Optimal Filter Partitions for Non-Uniformly Partitioned Convolution," Paper 6-4, (2012 March.). doi:
Abstract: 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.

@article{wefers2012optimal,
author={wefers, frank and vorländer, michael},
journal={journal of the audio engineering society},
title={optimal filter partitions for non-uniformly partitioned convolution},
year={2012},
volume={},
number={},
pages={},
doi={},
month={march},} @article{wefers2012optimal,
author={wefers, frank and vorländer, michael},
journal={journal of the audio engineering society},
title={optimal filter partitions for non-uniformly partitioned convolution},
year={2012},
volume={},
number={},
pages={},
doi={},
month={march},
abstract={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.},}

TY - paper
TI - Optimal Filter Partitions for Non-Uniformly Partitioned Convolution
SP - EP -
AU - Wefers, Frank
AU - Vorländer, Michael
PY - 2012
JO - Journal of the Audio Engineering Society
IS -
VO -
VL -
Y1 - March 2012 TY - paper
TI - Optimal Filter Partitions for Non-Uniformly Partitioned Convolution
SP - EP -
AU - Wefers, Frank
AU - Vorländer, Michael
PY - 2012
JO - Journal of the Audio Engineering Society
IS -
VO -
VL -
Y1 - March 2012
AB - 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.