AES E-Library

F. Wefers, and M. Vorländer, "Uniformly-Partitioned Convolution with Independent Partitions in Signal and Filter," Paper 9205, (2014 October.). doi: F. Wefers, and M. Vorländer, "Uniformly-Partitioned Convolution with Independent Partitions in Signal and Filter," Paper 9205, (2014 October.). doi:
Abstract: Low-latency real-time FIR filtering is often realized using partitioned convolution algorithms, which split the filter impulse responses into a sequence of sub filters and process these sub filters efficiently using frequency-domain methods (e.g., FFT-based convolution). Methods that split both, the signal and the filter, into uniformly-sized sub filters define a fundamental class of algorithms known as uniformly-partitioned convolution techniques. In these methods both operands, signal and filter, are usually partitioned with the same granularity. This contribution introduces uniformly-partitioned algorithms with independent partitions (block lengths) in both operands and regards viable transform sizes resulting from these. The relations of the algorithmic parameters are derived and the performance of the approach is evaluated.

@article{wefers2014uniformly-partitioned,
author={wefers, frank and vorländer, michael},
journal={journal of the audio engineering society},
title={uniformly-partitioned convolution with independent partitions in signal and filter},
year={2014},
volume={},
number={},
pages={},
doi={},
month={october},} @article{wefers2014uniformly-partitioned,
author={wefers, frank and vorländer, michael},
journal={journal of the audio engineering society},
title={uniformly-partitioned convolution with independent partitions in signal and filter},
year={2014},
volume={},
number={},
pages={},
doi={},
month={october},
abstract={low-latency real-time fir filtering is often realized using partitioned convolution algorithms, which split the filter impulse responses into a sequence of sub filters and process these sub filters efficiently using frequency-domain methods (e.g., fft-based convolution). methods that split both, the signal and the filter, into uniformly-sized sub filters define a fundamental class of algorithms known as uniformly-partitioned convolution techniques. in these methods both operands, signal and filter, are usually partitioned with the same granularity. this contribution introduces uniformly-partitioned algorithms with independent partitions (block lengths) in both operands and regards viable transform sizes resulting from these. the relations of the algorithmic parameters are derived and the performance of the approach is evaluated.},}

TY - paper
TI - Uniformly-Partitioned Convolution with Independent Partitions in Signal and Filter
SP - EP -
AU - Wefers, Frank
AU - Vorländer, Michael
PY - 2014
JO - Journal of the Audio Engineering Society
IS -
VO -
VL -
Y1 - October 2014 TY - paper
TI - Uniformly-Partitioned Convolution with Independent Partitions in Signal and Filter
SP - EP -
AU - Wefers, Frank
AU - Vorländer, Michael
PY - 2014
JO - Journal of the Audio Engineering Society
IS -
VO -
VL -
Y1 - October 2014
AB - Low-latency real-time FIR filtering is often realized using partitioned convolution algorithms, which split the filter impulse responses into a sequence of sub filters and process these sub filters efficiently using frequency-domain methods (e.g., FFT-based convolution). Methods that split both, the signal and the filter, into uniformly-sized sub filters define a fundamental class of algorithms known as uniformly-partitioned convolution techniques. In these methods both operands, signal and filter, are usually partitioned with the same granularity. This contribution introduces uniformly-partitioned algorithms with independent partitions (block lengths) in both operands and regards viable transform sizes resulting from these. The relations of the algorithmic parameters are derived and the performance of the approach is evaluated.