M. Emerit et al., “Efficient Binaural Filtering in QMF Domain for BRIR,” in Proc. AES Convention 122, May 2007, pp. 7095:1-12. [Online]. Available: https://aes.org/publications/elibrary-page/?id=14080
Emerit M, Faure J, Guerin A, Nicol R, Pallone G, Philippe P, Virette D. Efficient Binaural Filtering in QMF Domain for BRIR. In: AES Convention 122. Audio Engineering Society; 2007.pp. 7095:1-12. Available from: https://aes.org/publications/elibrary-page/?id=14080
@inproceedings{Emerit2007_14080,
author = {Emerit, Marc and Faure, Julien and Guerin, Alexandre and Nicol, Rozenn and Pallone, Gregory and Philippe, Pierrick and Virette, David},
title = {{Efficient Binaural Filtering in QMF Domain for BRIR}},
booktitle = {AES Convention 122},
pages = {7095:1-12},
url = {https://aes.org/publications/elibrary-page/?id=14080},
year = {2007},
month = may,
publisher = {Audio Engineering Society},
address = {Vienna Austria}
}
TY - CPAPER
TI - Efficient Binaural Filtering in QMF Domain for BRIR
AU - Emerit, Marc
AU - Faure, Julien
AU - Guerin, Alexandre
AU - Nicol, Rozenn
AU - Pallone, Gregory
AU - Philippe, Pierrick
AU - Virette, David
T2 - AES Convention 122
SP - 1
EP - 12
M1 - Paper 7095
PY - 2007
DA - 2007/05/06
UR - https://aes.org/publications/elibrary-page/?id=14080
PB - Audio Engineering Society
CY - Vienna Austria
LA - en
AB - The MPEG Surround standard includes two "native" binauralization modules for reproducing 3D audio content over headphones. In this paper, we present a novel and efficient Binaural Room Impulse Response (BRIR) modelling algorithm that extends their possibilities. This model is based on a parametric decomposition of the BRIR and is integrated within the subband domain implementation of the MPEG Surround binaural decoding stage. First we show that for impulse responses with room effects, our approach offers a significant reduction in terms of computational requirements compared to the native methods. Second, we report results from listening tests comparing different tradeoffs between complexity and quality. We show that using our method, the quality gracefully increases when the complexity increases.
ER -