1,751 research outputs found

    On the Equivalence of the Digital Waveguide and Finite Difference Time Domain Schemes

    Full text link
    It is known that the digital waveguide (DW) method for solving the wave equation numerically on a grid can be manipulated into the form of the standard finite-difference time-domain (FDTD) method (also known as the ``leapfrog'' recursion). This paper derives a simple rule for going in the other direction, that is, converting the state variables of the FDTD recursion to corresponding wave variables in a DW simulation. Since boundary conditions and initial values are more intuitively transparent in the DW formulation, the simple means of converting back and forth can be useful in initializing and constructing boundaries for FDTD simulations.Comment: v1: 6 pages; v2: 7 pages, generally more polished, more examples, expanded discussion; v3: 15 pages, added state space formulation, analysis of inputs and boundary conditions, translation of passive boundary conditions; v4: various typos fixe

    Plan for an individualized method of teaching typing I

    Get PDF

    Efficient Synthesis of Room Acoustics via Scattering Delay Networks

    Get PDF
    An acoustic reverberator consisting of a network of delay lines connected via scattering junctions is proposed. All parameters of the reverberator are derived from physical properties of the enclosure it simulates. It allows for simulation of unequal and frequency-dependent wall absorption, as well as directional sources and microphones. The reverberator renders the first-order reflections exactly, while making progressively coarser approximations of higher-order reflections. The rate of energy decay is close to that obtained with the image method (IM) and consistent with the predictions of Sabine and Eyring equations. The time evolution of the normalized echo density, which was previously shown to be correlated with the perceived texture of reverberation, is also close to that of IM. However, its computational complexity is one to two orders of magnitude lower, comparable to the computational complexity of a feedback delay network (FDN), and its memory requirements are negligible

    The poor parson

    Get PDF
    • 

    corecore