Abstract | ||
---|---|---|
Feedback delay networks (FDNs) belong to a general class of recursive filters which are widely used in artificial reverberation and decorrelation applications. One central challenge in the design of FDNs is the generation of sufficient echo density in the impulse response without compromising the computational efficiency. In a previous contribution, we have demonstrated that the echo density of an FDN grows polynomially over time, and that the growth depends on the number and lengths of the delays. In this work, we introduce so-called delay feedback matrices (DFMs) where each matrix entry is a scalar gain and a delay. While the computational complexity of DFMs is similar to a scalar-only feedback matrix, we show that the echo density grows significantly faster over time, however, at the cost of non-uniform modal decays. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1109/WASPAA.2019.8937284 | 2019 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics (WASPAA) |
Keywords | Field | DocType |
Feedback Delay Network,Artificial Reverberation,Echo Density | Impulse response,Decorrelation,Reverberation,Matrix (mathematics),Computer science,Scalar (physics),Algorithm,Electronic engineering,Recursion,Modal,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
1931-1168 | 978-1-7281-1124-7 | 0 |
PageRank | References | Authors |
0.34 | 6 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sebastian J. Schlecht | 1 | 51 | 6.36 |
Emanuel A. P. Habets | 2 | 604 | 66.23 |