Allpass Feedback Delay Networks
In the 1960s, Schroeder and Logan introduced delay line-based allpass filters, which are still popular due to their computational efficiency and versatile applicability in artificial reverberation, decorrelation, and dispersive system design. In this work, we extend the theory of allpass systems to any arbitrary connection of delay lines, namely feedback delay networks (FDNs). We present a characterization of uniallpass FDNs, i.e., FDNs, which are allpass for an arbitrary choice of delays. Further, we develop a solution to the completion problem, i.e., given an FDN feedback matrix to determine the remaining gain parameters such that the FDN is allpass. Particularly useful for the completion problem are feedback matrices, which yield a homogeneous decay of all system modes. Finally, we apply the uniallpass characterization to previous FDN designs, namely, Schroeder's series allpass and Gardner's nested allpass for single-input, single-output systems, and, Poletti's unitary reverberator for multi-input, multi-output systems and demonstrate the significant extension of the design space.
Code (0)
등록된 구현이 없습니다.
Tasks
Computational EfficiencyMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Merit-based Fair Combinatorial Semi-Bandit with Unrestricted Feedback Delays
We study the stochastic combinatorial semi-bandit problem with unrestricted feedback delays under merit-based fairness constraints. This is motivated by applications such as crowdsourcing, and online advertising, where i…
FairnessStochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
This paper investigates the problem of combinatorial multiarmed bandits with stochastic submodular (in expectation) rewards and full-bandit delayed feedback, where the delayed feedback is assumed to be composite and anon…
Prescribed-Time Newton Extremum Seeking using Delays and Time-Periodic Gains
We study prescribed-time extremum seeking (ES) for scalar maps in the presence of time delay. The problem has been solved by Yilmaz and Krstic using chirpy probing and time-varying singular gains. To alleviate the gain s…
Capacity-Constrained Online Convex Optimization with Delayed Feedback
Online learning with delayed feedback typically assumes that the learner can track all pending rounds until their feedback arrives. In practice, tracking resources are finite, and feedback from untracked rounds is perman…
Budgeted Recommendation with Delayed Feedback
In a conventional contextual multi-armed bandit problem, the feedback (or reward) is immediately observable after an action. Nevertheless, delayed feedback arises in numerous real-life situations and is particularly cruc…
Decision MakingMulti-Armed Bandits