Computational Complexity of a Nonuniform Orthogonal Lapped Filterbank Based on MDCT and Time Domain Aliasing Reduction

Werner N, Edler B. Computational Complexity of a Nonuniform Orthogonal Lapped Filterbank Based on MDCT and Time Domain Aliasing Reduction. In: AES Convention 146. Audio Engineering Society; 2019. Paper 511. Available from: https://aes.org/publications/elibrary-page/?id=20369

@inproceedings{Werner2019_20369,
  author = {Werner, Nils and Edler, Bernd},
  title = {{Computational Complexity of a Nonuniform Orthogonal Lapped Filterbank Based on MDCT and Time Domain Aliasing Reduction}},
  booktitle = {AES Convention 146},
  note = {Paper 511},
  year = {2019},
  month = mar,
  publisher = {Audio Engineering Society},
  url = {https://aes.org/publications/elibrary-page/?id=20369}
}

TY  - CPAPER
TI  - Computational Complexity of a Nonuniform Orthogonal Lapped Filterbank Based on MDCT and Time Domain Aliasing Reduction
AU  - Werner, Nils
AU  - Edler, Bernd
T2  - AES Convention 146
M1  - Paper 511
PY  - 2019
DA  - 2019/03/06
UR  - https://aes.org/publications/elibrary-page/?id=20369
PB  - Audio Engineering Society
LA  - en
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.
ER  -