Computational Complexity of a Nonuniform Orthogonal Lapped Filterbank Based on MDCT and Time Domain Aliasing Reduction
×
Cite This
Citation & Abstract
N. Werner, and B. Edler, "Computational Complexity of a Nonuniform Orthogonal Lapped Filterbank Based on MDCT and Time Domain Aliasing Reduction," Engineering Brief 511, (2019 March.). doi:
N. Werner, and B. Edler, "Computational Complexity of a Nonuniform Orthogonal Lapped Filterbank Based on MDCT and Time Domain Aliasing Reduction," Engineering Brief 511, (2019 March.). doi:
Abstract: In this brief we investigate the computational complexity of a non-uniform lapped orthogonal filterbank with time domain aliasing reduction. The computational complexity of such filterbank is crucial for its usability in real-time systems, as well as in embedded and mobile devices. Due to the signal-adaptive nature of the filterbank, the actual real-world complexity will be situated between two theoretical bounds and has to be estimated experimentally by processing real-world signals using a coder-decoder pipeline. Both the bounds and the real-world complexity were analyzed in this brief, and a median 14-22% increase in complexity over an adaptive uniform MDCT filterbank was found.
@article{werner2019computational,
author={werner, nils and edler, bernd},
journal={journal of the audio engineering society},
title={computational complexity of a nonuniform orthogonal lapped filterbank based on mdct and time domain aliasing reduction},
year={2019},
volume={},
number={},
pages={},
doi={},
month={march},}
@article{werner2019computational,
author={werner, nils and edler, bernd},
journal={journal of the audio engineering society},
title={computational complexity of a nonuniform orthogonal lapped filterbank based on mdct and time domain aliasing reduction},
year={2019},
volume={},
number={},
pages={},
doi={},
month={march},
abstract={in this brief we investigate the computational complexity of a non-uniform lapped orthogonal filterbank with time domain aliasing reduction. the computational complexity of such filterbank is crucial for its usability in real-time systems, as well as in embedded and mobile devices. due to the signal-adaptive nature of the filterbank, the actual real-world complexity will be situated between two theoretical bounds and has to be estimated experimentally by processing real-world signals using a coder-decoder pipeline. both the bounds and the real-world complexity were analyzed in this brief, and a median 14-22% increase in complexity over an adaptive uniform mdct filterbank was found.},}
TY - paper
TI - Computational Complexity of a Nonuniform Orthogonal Lapped Filterbank Based on MDCT and Time Domain Aliasing Reduction
SP -
EP -
AU - Werner, Nils
AU - Edler, Bernd
PY - 2019
JO - Journal of the Audio Engineering Society
IS -
VO -
VL -
Y1 - March 2019
TY - paper
TI - Computational Complexity of a Nonuniform Orthogonal Lapped Filterbank Based on MDCT and Time Domain Aliasing Reduction
SP -
EP -
AU - Werner, Nils
AU - Edler, Bernd
PY - 2019
JO - Journal of the Audio Engineering Society
IS -
VO -
VL -
Y1 - March 2019
AB - In this brief we investigate the computational complexity of a non-uniform lapped orthogonal filterbank with time domain aliasing reduction. The computational complexity of such filterbank is crucial for its usability in real-time systems, as well as in embedded and mobile devices. Due to the signal-adaptive nature of the filterbank, the actual real-world complexity will be situated between two theoretical bounds and has to be estimated experimentally by processing real-world signals using a coder-decoder pipeline. Both the bounds and the real-world complexity were analyzed in this brief, and a median 14-22% increase in complexity over an adaptive uniform MDCT filterbank was found.
In this brief we investigate the computational complexity of a non-uniform lapped orthogonal filterbank with time domain aliasing reduction. The computational complexity of such filterbank is crucial for its usability in real-time systems, as well as in embedded and mobile devices. Due to the signal-adaptive nature of the filterbank, the actual real-world complexity will be situated between two theoretical bounds and has to be estimated experimentally by processing real-world signals using a coder-decoder pipeline. Both the bounds and the real-world complexity were analyzed in this brief, and a median 14-22% increase in complexity over an adaptive uniform MDCT filterbank was found.
The Engineering Briefs at this Convention were
selected on the basis of a submitted synopsis,
ensuring that they are of interest to AES members,
and are not overly commercial. These briefs have
been reproduced from the authors' advance
manuscripts, without editing, corrections, or
consideration by the Review Board. The AES takes no
responsibility for their contents. Paper copies are
not available, but any member can freely access
these briefs. Members are encouraged to provide
comments that enhance their usefulness.
