Modal Decomposition of Feedback Delay Networks
Sebastian J. Schlecht, Emanuël A. P. Habets
TL;DR
This work tackles the challenging problem of obtaining a full modal decomposition for large feedback delay networks (FDNs) used in artificial reverberation. It introduces a polynomial matrix formulation of the generalized characteristic polynomial and solves for all poles simultaneously using the Ehrlich-Aberth Iteration, augmented with an efficient approximate deflation scheme and residue computation via adjugates. The approach delivers dramatic speedups over traditional matrix-eigenvalue or scalar-root methods, enabling reliable modal synthesis and extensive statistical analyses of pole-residue distributions under various attenuation schemes. The results reveal that, in lossless random FDNs, mode frequencies are nearly equidistributed while a small subset of high-energy modes dominates late reverberation, offering practical guidance for FDN design and optimization.
Abstract
Feedback delay networks (FDNs) belong to a general class of recursive filters which are widely used in sound synthesis and physical modeling applications. We present a numerical technique to compute the modal decomposition of the FDN transfer function. The proposed pole finding algorithm is based on the Ehrlich-Aberth iteration for matrix polynomials and has improved computational performance of up to three orders of magnitude compared to a scalar polynomial root finder. We demonstrate how explicit knowledge of the FDN's modal behavior facilitates analysis and improvements for artificial reverberation. The statistical distribution of mode frequency and residue magnitudes demonstrate that relatively few modes contribute a large portion of impulse response energy.
