AES E-Library

J. Hurchalla, "Low Latency Convolution in One Dimension Via Two Dimensional Convolutions: An Intuitive Approach," Paper 7634, (2008 October.). doi: J. Hurchalla, "Low Latency Convolution in One Dimension Via Two Dimensional Convolutions: An Intuitive Approach," Paper 7634, (2008 October.). doi:
Abstract: This paper presents a class of algorithms which can be used to efficiently perform the running convolution of a digital signal with a finite impulse response. The impulse is uniformly partitioned and transformed into the frequency domain, changing the one dimensional convolution into a two dimensional convolution which can be efficiently solved with nested short length acyclic convolution algorithms applied in the frequency domain. The latency of the running convolution is the time needed to acquire a block of data equal in size to the uniform partition length.

@article{hurchalla2008low,
author={hurchalla, jeffrey},
journal={journal of the audio engineering society},
title={low latency convolution in one dimension via two dimensional convolutions: an intuitive approach},
year={2008},
volume={},
number={},
pages={},
doi={},
month={october},} @article{hurchalla2008low,
author={hurchalla, jeffrey},
journal={journal of the audio engineering society},
title={low latency convolution in one dimension via two dimensional convolutions: an intuitive approach},
year={2008},
volume={},
number={},
pages={},
doi={},
month={october},
abstract={this paper presents a class of algorithms which can be used to efficiently perform the running convolution of a digital signal with a finite impulse response. the impulse is uniformly partitioned and transformed into the frequency domain, changing the one dimensional convolution into a two dimensional convolution which can be efficiently solved with nested short length acyclic convolution algorithms applied in the frequency domain. the latency of the running convolution is the time needed to acquire a block of data equal in size to the uniform partition length.},}

TY - paper
TI - Low Latency Convolution in One Dimension Via Two Dimensional Convolutions: An Intuitive Approach
SP - EP -
AU - Hurchalla, Jeffrey
PY - 2008
JO - Journal of the Audio Engineering Society
IS -
VO -
VL -
Y1 - October 2008 TY - paper
TI - Low Latency Convolution in One Dimension Via Two Dimensional Convolutions: An Intuitive Approach
SP - EP -
AU - Hurchalla, Jeffrey
PY - 2008
JO - Journal of the Audio Engineering Society
IS -
VO -
VL -
Y1 - October 2008
AB - This paper presents a class of algorithms which can be used to efficiently perform the running convolution of a digital signal with a finite impulse response. The impulse is uniformly partitioned and transformed into the frequency domain, changing the one dimensional convolution into a two dimensional convolution which can be efficiently solved with nested short length acyclic convolution algorithms applied in the frequency domain. The latency of the running convolution is the time needed to acquire a block of data equal in size to the uniform partition length.