Sign in

username:

password:



Not a member?

Search Online Books



Search tips

Free Online Books

Ads

Chapters

Physical Audio Signal Processing
    Equivalence of Digital Waveguide and Finite Difference Schemes
       Introduction
          FDTD and DW Equivalence

Chapter Contents:

Search Physical Audio Signal Processing

  

Book Index | Global Index

Would you like to be notified by email when Julius Orion Smith III publishes a new entry into his blog?

  

FDTD and DW Equivalence

The FDTD and DW recursions both compute time updates by forming fixed linear combinations of past state. As a result, each can be described in ``state-space form'' [460, Appendix E] by a constant matrix operator, the ``state transition matrix'', which multiplies the state vector at the current time to produce the state vector for the next time step. The FDTD operator propagates K variables while the DW operator propagates W variables. We may show equivalence by (1) defining a one-to-one transformation which will convert K variables to W variables or vice versa, and (2) showing that given any common initial state for both schemes, the state transition matrices compute the same next state in both cases.

The next section shows that the linear transformation from W to K variables,

$\displaystyle y(n,m) = y^{+}(n-m) + y^{-}(n+m), \protect$ (P.7)

for all $ n$ and $ m$, sets up a one-to-one linear transformation between the K and W variables. Assuming this holds, it only remains to be shown that the DW and FDTD schemes preserve mapping Eq.$ \,$(P.7) after a state transition from one time to the next. While this has been shown previously [453], we repeat the derivation here for completeness. We also provide a state-space analysis reaching the same conclusion in §P.4.

From Fig.P.1, it is clear that the DW scheme preserves mapping Eq.$ \,$(P.7) by definition. For the FDTD scheme, we expand the right-hand of Eq.$ \,$(P.3) using Eq.$ \,$(P.7) and verify that the left-hand side also satisfies the map, i.e., that $ y(n+1,m) = y^{+}(n+1-m) + y^{-}(n+1+m)$ holds:

\begin{eqnarray*} y(n+1,m) &=& y(n,m+1) + y(n,m-1) - y(n-1,m) \\ &=& y^{+}(n-m... ...^{+}[(n+1)-m] + y^{-}[(n+1)+m] \\ &\isdef & y(n+1,m) \nonumber \end{eqnarray*}

Since the DW method propagates sampled (bandlimited) solutions to the ideal wave equation without error, it follows that the FDTD method does the same thing, despite the relatively crude approximations made in Eq.$ \,$(P.2). In particular, it is known that the FDA introduces artificial damping when applied to first order partial derivatives arising in lumped, mass-spring systems [458].

The equivalence of the DW and FDTD state transitions extends readily to the DW mesh [