DSPRelated.com
Free Books
   Free Books    Physical Audio Signal Processing  


State Space Formulation

In this section, we will summarize and extend the above discussion by means of a state space analysis [220].

FDTD State Space Model

Let $ \underline{x}_K(n)$ denote the FDTD state for one of the two subgrids at time $ n$, as defined by Eq.$ \,$(E.10). The other subgrid is handled identically and will not be considered explicitly. In fact, the other subgrid can be dropped altogether to obtain a half-rate, staggered grid scheme [55,147]. However, boundary conditions and input signals will couple the subgrids, in general. To land on the same subgrid after a state update, it is necessary to advance time by two samples instead of one. The state-space model for one subgrid of the FDTD model of the ideal string may then be written as

$\displaystyle \underline{x}_K(n+2)$ $\displaystyle =$ $\displaystyle \mathbf{A}_K\, \underline{x}_K(n) + \mathbf{B}_K\, \underline{u}(n+2)$  
$\displaystyle \underline{y}(n)$ $\displaystyle =$ $\displaystyle \mathbf{C}_K\, \underline{x}_K(n). \protect$ (E.24)

To avoid the issue of boundary conditions for now, we will continue working with the infinitely long string. As a result, the state vector $ \underline{x}_K(n)$ denotes a point in a space of countably infinite dimensionality. A proper treatment of this case would be in terms of operator theory [325]. However, matrix notation is also clear and will be used below. Boundary conditions are taken up in §E.4.3.

When there is a general input signal vector $ \underline{u}(n)$, it is necessary to augment the input matrix $ \mathbf{B}_K$ to accomodate contributions over both time steps. This is because inputs to positions $ m\pm1$ at time $ n+1$ affect position $ m$ at time $ n+2$. Henceforth, we assume $ \mathbf{B}_K$ and $ \underline{u}$ have been augmented in this way. Thus, if there are $ q$ input signals $ \underline{\upsilon}(n)\isdeftext [\upsilon _i(n)]$, $ i=1,\ldots,q$, driving the full string state through weights $ \underline{\beta}_m\isdeftext [\beta_{m,i}]$, $ m\in{\bf Z}$, the vector $ \underline{u}(n)=$ is of dimension $ 2q\times 1$:

\begin{displaymath} \underline{u}(n+2) = \left[\! \begin{array}{c} \underline{\upsilon}(n+2)\\ \underline{\upsilon}(n+1) \end{array}\!\right] \end{displaymath}

When there is only one physical input, as is typically assumed for plucked, struck, and bowed strings, then $ q=1$ and $ \underline{u}$ is $ 2\times 1$. The matrix $ \mathbf{B}_K$ weights these inputs before they are added to the state vector for time $ n+2$, and its entries are derived in terms of the $ \beta_{m,i}$ coefficients below.

$ \mathbf{C}_K$ forms the output signal as an arbitrary linear combination of states. To obtain the usual displacement output for the subgrid, $ \mathbf{C}_K$ is the matrix formed from the identity matrix by deleting every other row, thereby retaining all displacement samples at time $ n$ and discarding all displacement samples at time $ n-1$ in the state vector $ \underline{x}_K(n)$:

\begin{displaymath} \underbrace{\left[\! \begin{array}{c} \vdots \\ y_{n,m-2} \... ..._{n,m+4}\\ \vdots \end{array}\!\right]}_{\underline{x}_K(n)} \end{displaymath}

The state transition matrix $ \mathbf{A}_K$ may be obtained by first performing a one-step time update,

$\displaystyle y_{n+2,m} = y_{n+1,m-1}+y_{n+1,m+1}-y_{n,m}+\underline{\beta}_m^T \underline{\upsilon}(n+2), $

and then expanding the two $ n+1$ terms in terms of the state at time $ n$:
$\displaystyle y_{n+1,m-1}$ $\displaystyle =$ $\displaystyle y_{n,m-2}+y_{n,m}-y_{n-1,m-1}+\underline{\beta}_{m-1}^T\underline{\upsilon}(n+1)$  
$\displaystyle y_{n+1,m+1}$ $\displaystyle =$ $\displaystyle y_{n,m}+y_{n,m+2}-y_{n-1,m+1}+\underline{\beta}_{m+1}^T\underline{\upsilon}(n+1)$  
    $\displaystyle \protect$ (E.25)

The intra-grid state update for even $ m$ is then given by
$\displaystyle {y_{n+2,m}}$
  $\displaystyle =$ $\displaystyle y_{n,m-2} - y_{n-1,m-1} + y_{n,m} - y_{n-1,m+1} + y_{n,m+2}$  
    $\displaystyle \quad +\; \underline{\beta}_m^T \underline{\upsilon}(n+2) + (\underline{\beta}_{m-1}+\underline{\beta}_{m+1})^T\underline{\upsilon}(n+1)$  
  $\displaystyle =$ \begin{displaymath}\begin{array}{c} \left[1, -1, 1, -1, 1\right]\\ \vspace{0.5i... ...y_{n-1,m+1}\\ y_{n,m+2}\\ y_{n-1,m+3}\\ \end{array}\!\right]\end{displaymath}  
    \begin{displaymath}+ \left[\underline{\beta}_m^T \quad (\underline{\beta}_{m-1}+... ...+2)\\ \underline{\upsilon}(n+1) \end{array}\!\right]. \protect\end{displaymath} (E.26)

For odd $ m$, the update in Eq.$ \,$(E.25) is used. Thus, every other row of $ \mathbf{A}_K$, for time $ n+2$, consists of the vector $ [1,-1,1,-1,1]$ preceded and followed by zeros. Successive rows for time $ n+2$ are shifted right two places. The rows for time $ n+1$ consist of the vector $ [1,-1,1]$ aligned similarly:

\begin{displaymath} \underbrace{\left[\! \begin{array}{l} \qquad\vdots\\ y_{n+1... ...+3}\\ \qquad\vdots \end{array}\!\right]}_{\underline{x}_K(n)} \end{displaymath}

From Eq.$ \,$(E.26) we also see that the input matrix $ \mathbf{B}_K$ is given as defined in the following expression:

\begin{displaymath} \underbrace{\left[\! \begin{array}{l} \qquad\vdots\\ y_{n+1... ...ine{\upsilon}(n+1) \end{array}\!\right]}_{\underline{u}(n+2)}. \end{displaymath}

DW State Space Model

As discussed in §E.2, the traveling-wave decomposition Eq.$ \,$(E.4) defines a linear transformation Eq.$ \,$(E.10) from the DW state to the FDTD state:

$\displaystyle \underline{x}_K= \mathbf{T}\, \underline{x}_W \protect$ (E.27)

Since $ \mathbf{T}$ is invertible, it qualifies as a linear transformation for performing a change of coordinates for the state space. Substituting Eq.$ \,$(E.27) into the FDTD state space model Eq.$ \,$(E.24) gives
$\displaystyle \mathbf{T}\,\underline{x}_W(n+2)$ $\displaystyle =$ $\displaystyle \mathbf{A}_K\, \mathbf{T}\,\underline{x}_W(n) + \mathbf{B}_K\, \underline{u}(n+2)\protect$ (E.28)
$\displaystyle \underline{y}(n)$ $\displaystyle =$ $\displaystyle \mathbf{C}_K\, \mathbf{T}\,\underline{x}_W(n). \protect$ (E.29)

Multiplying through Eq.$ \,$(E.28) by $ \mathbf{T}^{-1}$ gives a new state-space representation of the same dynamic system which we will show is in fact the DW model of Fig.E.2:
$\displaystyle \underline{x}_W(n+2)$ $\displaystyle =$ $\displaystyle \mathbf{A}_W\, \underline{x}_W(n) + {\mathbf{B}_W}\, \underline{u}(n+2)$  
$\displaystyle \underline{y}(n)$ $\displaystyle =$ $\displaystyle \mathbf{C}_W\, \underline{x}_W(n)$ (E.30)

where
$\displaystyle \mathbf{A}_W$ $\displaystyle \isdef$ $\displaystyle \mathbf{T}^{-1}\mathbf{A}_K\,\mathbf{T}$  
$\displaystyle {\mathbf{B}_W}$ $\displaystyle \isdef$ $\displaystyle \mathbf{T}^{-1}\mathbf{B}_K$  
$\displaystyle \mathbf{C}_W$ $\displaystyle \isdef$ $\displaystyle \mathbf{C}_K\,\mathbf{T} \protect$ (E.31)

To verify that the DW model derived in this manner is the computation diagrammed in Fig.E.2, we may write down the state transition matrix for one subgrid from the figure to obtain the permutation matrix $ \mathbf{A}_W$,

$\displaystyle \underbrace{\left[\! \begin{array}{l} \qquad\vdots \\ y^{+}_{n+2,... ...{-}_{n,m+4} \\ \quad\vdots \end{array} \!\right]}_{\underline{x}_W(n)} \protect$ (E.32)

and displacement output matrix $ \mathbf{C}_W$:

\begin{displaymath} \underbrace{\left[\! \begin{array}{c} \vdots \\ y_{n,m-2} \... ...+4} \\ \quad\vdots \end{array}\!\right]}_{\underline{x}_W(n)} \end{displaymath}

DW Displacement Inputs

We define general DW inputs as follows:

$\displaystyle y^{+}_{n,m}$ $\displaystyle =$ $\displaystyle y^{+}_{n-1,m-1} + (\underline{\gamma}^{+}_m)^T \underline{\upsilon}(n)$ (E.33)
$\displaystyle y^{-}_{n,m}$ $\displaystyle =$ $\displaystyle y^{-}_{n-1,m+1} + (\underline{\gamma}^{-}_m)^T \underline{\upsilon}(n)$ (E.34)

The $ m$th $ 2q\times2$ block of the input matrix $ {\mathbf{B}_W}$ driving state components $ [y^{+}_{n+2,m},y^{-}_{n+2,m}]^T$ and multiplying $ [\underline{\upsilon}(n+2)^T,\underline{\upsilon}(n+1)^T]^T$ is then given by

$\displaystyle \left({\mathbf{B}_W}\right)_m = \left[\! \begin{array}{cc} (\unde... ...ma}^{-}_m)^T & (\underline{\gamma}^{-}_{m+1})^T \end{array} \!\right]. \protect$ (E.35)

Typically, input signals are injected equally to the left and right along the string, in which case

$\displaystyle \underline{\gamma}^{+}_m = \underline{\gamma}^{-}_m \isdef \underline{\gamma}_m. $

Physically, this corresponds to applied forces at a single, non-moving, string position over time. The state update with this simplification appears as

\begin{displaymath} \underbrace{\left[\! \begin{array}{c} \vdots\\ y^{+}_{n+2,m... ...ine{\upsilon}(n+1) \end{array}\!\right]}_{\underline{u}(n+2)}. \end{displaymath}

Note that if there are no inputs driving the adjacent subgrid ( $ \underline{\gamma}_{m-1}=\underline{\gamma}_{m+1}=0$), such as in a half-rate staggered grid scheme, the input reduces to

\begin{displaymath} \underline{x}_W(n+2) = \mathbf{A}_W\underline{x}_W(n) + \un... ...d{array}\!\right]}_{{\mathbf{B}_W}} \underline{\upsilon}(n+2). \end{displaymath}

To show that the directly obtained FDTD and DW state-space models correspond to the same dynamic system, it remains to verify that $ \mathbf{A}_W=\mathbf{T}^{-1}\mathbf{A}_K\,\mathbf{T}$. It is somewhat easier to show that

\begin{eqnarray*} \mathbf{T}\,\mathbf{A}_W&=& \mathbf{A}_K\,\mathbf{T}\\ &=& \l... ...dots & \vdots & \vdots & \vdots & \vdots \end{array}\!\right]. \end{eqnarray*}

A straightforward calculation verifies that the above identity holds, as expected. One can similarly verify $ \mathbf{C}_W=\mathbf{C}_K\,\mathbf{T}$, as expected. The relation $ {\mathbf{B}_W}=\mathbf{T}^{-1}\,\mathbf{B}_K$ provides a recipe for translating any choice of input signals for the FDTD model to equivalent inputs for the DW model, or vice versa. For example, in the scalar input case ($ q=1$), the DW input-weights $ {\mathbf{B}_W}$ become FDTD input-weights $ \mathbf{B}_K$ according to

\begin{displaymath} \left[\! \begin{array}{l} \qquad\vdots\\ y_{n+1,m-1}\\ y_{... ...psilon}(n+2)\\ \underline{\upsilon}(n+1) \end{array}\!\right] \end{displaymath}

The left- and right-going input-weight superscripts indicate the origin of each coefficient. Setting $ \gamma^{+}_m=\gamma^{-}_m$ results in

$\displaystyle \mathbf{B}_K= \left[\! \begin{array}{cc} \vdots & \vdots\\ \gamma... ...ma _{m+1}+\gamma _{m+3} \\ [5pt] \vdots & \vdots \end{array} \!\right] \protect$ (E.36)

Finally, when $ \gamma _m=1$ and $ \gamma _{\mu}=0$ for all $ \mu\neq m$, we obtain the result familiar from Eq.$ \,$(E.23):

\begin{displaymath} \mathbf{B}_K= \left[\! \begin{array}{cc} \vdots & \vdots\\ ... ...0 \\ 2 & 0 \\ 1 & 0 \\ \vdots & \vdots \end{array}\!\right] \end{displaymath}

Similarly, setting $ \gamma^{\pm}_{\mu}=0$ for all $ \mu\neq m+1$, the weighting pattern $ (1,2,1)$ appears in the second column, shifted down one row. Thus, $ \mathbf{B}_K$ in general (for physically stationary displacement inputs) can be seen as the superposition of weight patterns $ (1,2,1)$ in the left column for even $ m$, and the right column for odd $ m$ (the other subgrid), where the $ 2$ is aligned with the driven sample. This is the general collection of displacement inputs.


DW Non-Displacement Inputs

Since a displacement input at position $ m$ corresponds to symmetrically exciting the right- and left-going traveling-wave components $ y^{+}_m$ and $ y^{-}_m$, it is of interest to understand what it means to excite these components antisymmetrically. As discussed in §E.3.3, an antisymmetric excitation of traveling-wave components can be interpreted as a velocity excitation. It was noted that localized velocity excitations in the FDTD generally correspond to non-localized velocity excitations in the DW, and that velocity in the DW is proportional to the spatial derivative of the difference between the left-going and right-going traveling displacement-wave components (see Eq.$ \,$(E.13)). More generally, the antisymmetric component of displacement-wave excitation can be expressed in terms of any wave variable which is linearly independent relative to displacement, such as acceleration, slope, force, momentum, and so on. Since the state space of a vibrating string (and other mechanical systems) is traditionally taken to be position and velocity, it is perhaps most natural to relate the antisymmetric excitation component to velocity.

In practice, the simplest way to handle a velocity input $ v_m(n)$ in a DW simulation is to first pass it through a first-order integrator of the form

$\displaystyle H(z) = \frac{1}{1-z^{-1}} = 1 + z^{-1}+ z^{-2} + \cdots \protect$ (E.37)

to convert it to a displacement input. By the equivalence of the DW and FDTD models, this works equally well for the FDTD model. However, in view of §E.3.3, this approach does not take full advantage of the ability of the FDTD scheme to provide localized velocity inputs for applications such as simulating a piano hammer strike. The FDTD provides such velocity inputs for ``free'' while the DW requires the external integrator Eq.$ \,$(E.37).

Note, by the way, that these ``integrals'' (both that done internally by the FDTD and that done by Eq.$ \,$(E.37)) are merely sums over discrete time--not true integrals. As a result, they are exact only at dc (and also trivially at $ f_s/2$, where the output amplitude is zero). Discrete sums can also be considered exact integrators for impulse-train inputs--a point of view sometimes useful when interpreting simulation results. For normal bandlimited signals, discrete sums most accurately approximate integrals in a neighborhood of dc. The KW-converter filter $ H(z)=1-z^{-2}$ has analogous properties.

Input Locality

The DW state-space model is given in terms of the FDTD state-space model by Eq.$ \,$(E.31). The similarity transformation matrix $ \mathbf{T}$ is bidiagonal, so that $ \mathbf{C}_K$ and $ \mathbf{C}_W=\mathbf{C}_K\,\mathbf{T}$ are both approximately diagonal when the output is string displacement for all $ m$. However, since $ \mathbf{T}^{-1}$ given in Eq.$ \,$(E.11) is upper triangular, the input matrix $ {\mathbf{B}_W}=\mathbf{T}^{-1}\mathbf{B}_K$ can replace sparse input matrices $ \mathbf{B}_K$ with only half-sparse $ {\mathbf{B}_W}$, unless successive columns of $ \mathbf{T}^{-1}$ are equally weighted, as discussed in §E.3. We can say that local K-variable excitations may correspond to non-local W-variable excitations. From Eq.$ \,$(E.35) and Eq.$ \,$(E.36), we see that displacement inputs are always local in both systems. Therefore, local FDTD and non-local DW excitations can only occur when a variable dual to displacement is being excited, such as velocity. If the external integrator Eq.$ \,$(E.37) is used, all inputs are ultimately displacement inputs, and the distinction disappears.


Boundary Conditions

The relations of the previous section do not hold exactly when the string length is finite. A finite-length string forces consideration of boundary conditions. In this section, we will introduce boundary conditions as perturbations of the state transition matrix. In addition, we will use the DW-FDTD equivalence to obtain physically well behaved boundary conditions for the FDTD method.

Consider an ideal vibrating string with $ M=8$ spatial samples. This is a sufficiently large number to make clear most of the repeating patterns in the general case. Introducing boundary conditions is most straightforward in the DW paradigm. We therefore begin with the order 8 DW model, for which the state vector (for the 0th subgrid) will be

\begin{displaymath} \underline{x}_W(n) = \left[\! \begin{array}{l} y^{+}_{n,0}\... ...}_{n,4}\\ y^{+}_{n,6}\\ y^{-}_{n,6}\\ \end{array}\!\right]. \end{displaymath}

The displacement output matrix is given by

\begin{displaymath} \mathbf{C}_W= \left[\! \begin{array}{ccccccccccc} 1 & 1 & ... ...0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 \end{array}\!\right] \end{displaymath}

and the input matrix $ {\mathbf{B}_W}$ is an arbitrary $ M\times 2q$ matrix. We will choose a scalar input signal $ u(n)$ driving the displacement of the second spatial sample with unit gain:

\begin{displaymath} {\mathbf{B}_W} = \left[\! \begin{array}{cc} 0 & 0 \\ 0 & ... ... 0 & 0 \\ 0 & 0 \\ 0 & 0 \\ 0 & 0 \end{array}\!\right] \end{displaymath}

The state transition matrix $ \mathbf{A}_W$ is obtained by reducing Eq.$ \,$(E.32) to finite order in some way, thereby introducing boundary conditions.

Resistive Terminations

Let's begin with simple ``resistive'' terminations at the string endpoints, resulting in the reflection coefficient $ g$ at each end of the string, where $ \vert g\vert\leq 1$ corresponds to nonnegative (passive) termination resistances [447]. Inspection of Fig.E.2 makes it clear that terminating the left endpoint may be accomplished by setting

$\displaystyle y^{+}_{n,0} = g_ly^{-}_{n,0}, $

and the right termination corresponds to

$\displaystyle y^{-}_{n,6} = g_ry^{+}_{n,6}. $

By allowing an additional two samples of round-trip delay in each endpoint reflectance (one sample in the chosen subgrid), we can implement these reflections within the state-transition matrix:

$\displaystyle \tilde{\mathbf{A}}_W= \left[\! \begin{array}{ccccccccccc} 0 & g_l... ... 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & g_r & 0 \end{array} \!\right]$ (E.38)

The simplest choice of state transformation matrix $ \mathbf{T}$ is obtained by cropping it to size $ M\times M$:

\begin{displaymath} \mathbf{T}\isdef \left[\! \begin{array}{ccccccccccc} 1 & 1... ... 1 & 1 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \end{array}\!\right] \end{displaymath}

An advantage of this choice is that its inverse $ \mathbf{T}^{-1}$ is similarly a simple cropping of the $ M=\infty$ case. However, the corresponding FDTD system is not so elegant:

\begin{eqnarray*} \tilde{\mathbf{A}}_K&\isdef & \mathbf{T}\tilde{\mathbf{A}}_W\m... ...r \\ 0 & 0 & 0 & 0 & 0 & 0 & g_r & -g_r \end{array}\!\right], \end{eqnarray*}

where $ h_l\isdef 1+g_l$ and $ h_r\isdef 1+g_r$. We see that the left FDTD termination is non-local for $ g\neq -1$, while the right termination is local (to two adjacent spatial samples) for all $ g$. This can be viewed as a consequence of having ordered the FDTD state variables as $ [y_{n,m},y_{n-1,m+1},\ldots]$ instead of $ [y_{n-1,m},y_{n,m+1},\ldots]$. Choosing the other ordering interchanges the endpoint behavior. Call these orderings Type I and Type II, respectively. Then $ \mathbf{T}_{II}=\mathbf{T}_I^T$; that is, the similarity transformation matrix $ \mathbf{T}$ is transposed when converting from Type I to Type II or vice versa. By anechoically coupling a Type I FDTD simulation on the right with a Type II simulation on the left, general resistive terminations may be obtained on both ends which are localized to two spatial samples.

In nearly all musical sound synthesis applications, at least one of the string endpoints is modeled as rigidly clamped at the ``nut''. Therefore, since the FDTD, as defined here, most naturally provides a clamped endpoint on the left, with more general localized terminations possible on the right, we will proceed with this case for simplicity in what follows. Thus, we set $ g_l=-1$ and obtain

\begin{eqnarray*} \mbox{$\stackrel{{\scriptscriptstyle \vdash}}{\mathbf{A}}$}_K&... ..._r \\ 0 & 0 & 0 & 0 & 0 & 0 & g_r & -g_r \end{array}\!\right] \end{eqnarray*}

Boundary Conditions as Perturbations

To study the effect of boundary conditions on the state transition matrices $ \mathbf{A}_W$ and $ \mathbf{A}_K$, it is convenient to write the terminated transition matrix as the sum of of the ``left-clamped'' case $ \mbox{$\stackrel{{\scriptscriptstyle \vdash}}{\mathbf{A}}$}$$ _W$ (for which $ g_l=-1$) plus a series of one or more rank-one perturbations. For example, introducing a right termination with reflectance $ g_r$ can be written

$\displaystyle \mbox{$\stackrel{{\scriptscriptstyle \vdash\!\!\dashv}}{\mathbf{A}}$}$$\displaystyle _W=$   $\displaystyle \mbox{$\stackrel{{\scriptscriptstyle \vdash}}{\mathbf{A}}$}$$\displaystyle _W+ g_r{\bm \delta}_{8,7} = \mathbf{A}_W- {\bm \delta}_{1,2} + g_r{\bm \delta}_{8,7}, \protect$ (E.39)

where $ {\bm \delta}_{ij}$ is the $ M\times M$ matrix containing a 1 in its $ (i,j)$th entry, and zero elsewhere. (Following established convention, rows and columns in matrices are numbered from 1.)

In general, when $ i+j$ is odd, adding $ {\bm \delta}_{ij}$ to $ \mbox{$\stackrel{{\scriptscriptstyle \vdash}}{\mathbf{A}}$}$$ _W$ corresponds to a connection from left-going waves to right-going waves, or vice versa (see Fig.E.2). When $ i$ is odd and $ j$ is even, the connection flows from the right-going to the left-going signal path, thus providing a termination (or partial termination) on the right. Left terminations flow from the bottom to the top rail in Fig.E.2, and in such connections $ i$ is even and $ j$ is odd. The spatial sample numbers involved in the connection are $ 2\lfloor (i-1)/2\rfloor$ and $ 2\lfloor (j-1)/2\rfloor$, where $ \lfloor x\rfloor$ denotes the greatest integer less than or equal to $ x$.

The rank-one perturbation of the DW transition matrix Eq.$ \,$(E.39) corresponds to the following rank-one perturbation of the FDTD transition matrix $ \mbox{$\stackrel{{\scriptscriptstyle \vdash}}{\mathbf{A}}$}$$ _K$:

   $\displaystyle \mbox{$\stackrel{{\scriptscriptstyle \vdash\!\!\dashv}}{\mathbf{A}}$}$$\displaystyle _K\;\isdef \;$   $\displaystyle \mbox{$\stackrel{{\scriptscriptstyle \vdash}}{\mathbf{A}}$}$$\displaystyle _K+ g{\bm \Delta}_{8,7} $

where
$\displaystyle {\bm \Delta}_{8,7}$ $\displaystyle \isdef$ \begin{displaymath}\mathbf{T}{\bm \delta}_{8,7}\mathbf{T}^{-1} = \left[\! \begin... ... 0 & 0 & 0 & 0 & 0 & 0 & 1 & -1 \end{array}\!\right]. \protect\end{displaymath} (E.40)

In general, we have

$\displaystyle {\bm \Delta}_{ij} = \sum_{\kappa=j}^M (-1)^{\kappa-j} \left({\bm \delta}_{i\kappa}+{\bm \delta}_{i-1,\kappa}\right). \protect$ (E.41)

Thus, the general rule is that $ {\bm \delta}_{ij}$ transforms to a matrix $ {\bm \Delta}_{ij}$ which is zero in all but two rows (or all but one row when $ i=1$). The nonzero rows are numbered $ i$ and $ i-1$ (or just $ i$ when $ i=1$), and they are identical, being zero in columns $ 1:j-1$, and containing $ [1,-1,1,-1,\ldots]$ starting in column $ j$.

Reactive Terminations

In typical string models for virtual musical instruments, the ``nut end'' of the string is rigidly clamped while the ``bridge end'' is terminated in a passive reflectance $ S(z)$. The condition for passivity of the reflectance is simply that its gain be bounded by 1 at all frequencies [447]:

$\displaystyle \left\vert S(e^{j\omega T})\right\vert\leq 1, \quad \forall\, \omega T\in[-\pi,\pi). \protect$ (E.42)

A very simple case, used, for example, in the Karplus-Strong plucked-string algorithm, is the two-point-average filter:

$\displaystyle S(z) = -\frac{1+z^{-1}}{2} $

To impose this lowpass-filtered reflectance on the right in the chosen subgrid, we may form

   $\displaystyle \mbox{$\stackrel{{\scriptscriptstyle \vdash\!\!\dashv}}{\mathbf{A}}$}$$\displaystyle _W=$   $\displaystyle \mbox{$\stackrel{{\scriptscriptstyle \vdash}}{\mathbf{A}}$}$$\displaystyle _W- \frac{1}{2}{\bm \Delta}_{8,5} - \frac{1}{2}{\bm \Delta}_{8,7} $

which results in the FDTD transition matrix

\begin{eqnarray*} \mbox{$\stackrel{{\scriptscriptstyle \vdash\!\!\dashv}}{\mathb... ... \\ 0 & 0 & 0 & 0 & -1/2 & 1/2 & -1 & -1 \end{array}\!\right]. \end{eqnarray*}

This gives the desired filter in a half-rate, staggered grid case. In the full-rate case, the termination filter is really

$\displaystyle S(z) = -\frac{1+z^{-2}}{2} $

which is still passive, since it obeys Eq.$ \,$(E.42), but it does not have the desired amplitude response: Instead, it has a notch (gain of 0) at one-fourth the sampling rate, and the gain comes back up to 1 at half the sampling rate. In a full-rate scheme, the two-point-average filter must straddle both subgrids.

Another often-used string termination filter in digital waveguide models is specified by [447]

\begin{eqnarray*} s(n) &=& -g\left[\frac{h}{4}, \frac{1}{2}, \frac{h}{4}\right]\... ...{j\omega T})&=& -e^{-j\omega T}g\frac{1 + h \cos(\omega T)}{2}, \end{eqnarray*}

where $ g\in(0,1)$ is an overall gain factor that affects the decay rate of all frequencies equally, while $ h\in(0,1)$ controls the relative decay rate of low-frequencies and high frequencies. An advantage of this termination filter is that the delay is always one sample, for all frequencies and for all parameter settings; as a result, the tuning of the string is invariant with respect to termination filtering. In this case, the perturbation is

   $\displaystyle \mbox{$\stackrel{{\scriptscriptstyle \vdash\!\!\dashv}}{\mathbf{A}}$}$$\displaystyle _W=$   $\displaystyle \mbox{$\stackrel{{\scriptscriptstyle \vdash}}{\mathbf{A}}$}$$\displaystyle _W- \frac{gh}{4}\delta(M-5,M) - \frac{g}{2}\delta(M-3,M) - \frac{gh}{4}\delta(M-1,M) $

and, using Eq.$ \,$(E.41), the order $ M=8$ FDTD state transition matrix is given by

\begin{eqnarray*} \mbox{$\stackrel{{\scriptscriptstyle \vdash\!\!\dashv}}{\mathb... ...d g_2 & \quad -g_2 & \quad g_3 & \quad -g_3 \end{array}\!\right] \end{eqnarray*}

where

\begin{eqnarray*} g_1 &\isdef & -\frac{gh}{4}\\ g_2 &\isdef & -\frac{g}{2}+g_1\\ g_3 &\isdef & -\frac{gh}{4}+g_2.\\ \end{eqnarray*}

The filtered termination examples of this section generalize immediately to arbitrary finite-impulse response (FIR) termination filters $ S(z)$. Denote the impulse response of the termination filter by

$\displaystyle s(n)=[s_0,s_1,s_2,\ldots,s_N], $

where the length $ N$ of the filter does not exceed $ M/2$. Due to the DW-FDTD equivalence, the general stability condition is stated very simply as

$\displaystyle \left\vert S(e^{j\omega T})\right\vert = \left\vert\sum_{n=0}^{N-1} s_n e^{-j\omega T}\right\vert \leq 1, \quad \forall\, \omega T\in[-\pi,\pi). $

Interior Scattering Junctions

A so-called Kelly-Lochbaum scattering junction [297,447] can be introduced into the string at the fourth sample by the following perturbation

   $\displaystyle \mbox{$\stackrel{{\scriptscriptstyle \rightleftharpoons}}{\mathbf{A}}$}$$\displaystyle _K=$   $\displaystyle \mbox{$\stackrel{{\scriptscriptstyle \vdash}}{\mathbf{A}}$}$$\displaystyle _K+ (1-k_l){\bm \Delta}_{5,3} + k_r {\bm \Delta}_{5,8} + k_l {\bm \Delta}_{6,3} + (1-k_r){\bm \Delta}_{6,8}. $

Here, $ k_l$ denotes the reflection coefficient ``seen'' from left to right, and $ k_r$ is the reflectance of the junction from the right. When the scattering junction is caused by a change in string density or tension, we have $ k_r=-k_l$. When it is caused by an externally imposed termination (such as a plectrum or piano-hammer touching the string), we have $ k_r=k_l$, and the reflectances may become filters instead of real values in $ [-1,1]$. Energy conservation demands that the transmission coefficients be amplitude complementary with respect to the reflection coefficients [447].

A single time-varying scattering junction provides a reasonable model for plucking, striking, or bowing a string at a point. Several adjacent scattering junctions can model a distributed interaction, such as a piano hammer, finger, or finite-width bow spanning several string samples.

Note that scattering junctions separated by one spatial sample (as typical in ``digital waveguide filters'' [447]) will couple the formerly independent subgrids. If scattering junctions are confined to one subgrid, they are separated by two samples of delay instead of one, resulting in round-trip transfer functions of the form $ H(z^2)$ (as occurs in the digital waveguide mesh). In the context of a half-rate staggered-grid scheme, they can provide general IIR filtering in the form of a ladder digital filter [297,447].

Lossy Vibration

The DW and FDTD state-space models are equivalent with respect to lossy traveling-wave simulation. Figure E.4 shows the flow diagram for the case of simple attenuation by $ g$ per sample of wave propagation, where $ g\in(0,1]$ for a passive string.

Figure E.4: DW flow diagram in the lossy case.
\includegraphics{eps/wglossyCopy}

The DW state update can be written in this case as

$\displaystyle \underline{x}_W(n+2) = g^2\mathbf{A}_W\underline{x}_W(n) + {\mathbf{B}_W}\underline{u}(n+2). $

where the loss associated with two time steps has been incorporated into the chosen subgrid for physical accuracy. (The neglected subgrid may now be considered lossless.) In changing coordinates to the FDTD scheme, the gain factor $ g^2$ can remain factored out, yielding

$\displaystyle \underline{x}_K(n+2) = g^2\mathbf{A}_K\underline{x}_K(n) + \mathbf{B}_K\underline{u}(n+2). $

When the input is zero after a particular time, such as in a plucked or struck string simulation, the losses can be implemented at the final output, and only when an output is required, e.g.,

$\displaystyle y(n) = g^n y_0(n) $

where $ y_0(n)$ denotes the corresponding lossless simulation. When there is a general input signal, the state vector needs to be properly attenuated by losses. In the DW case, the losses can be lumped at two points per spatial input and output [447].

State Space Summary

We have seen that the DW and FDTD schemes correspond to state-space models which are related to each other by a simple change of coordinates (similarity transformation). It is well known that such systems exhibit the same transfer functions, have the same modes, and so on. In short, they are the same linear dynamic system. Differences may exist with respect to spatial locality of input signals, initial conditions, and boundary conditions.

State-space analysis was used to translate initial conditions and boundary conditions from one case to the other. Passive terminations in the DW paradigm were translated to passive terminations for the FDTD scheme, and FDTD excitations were translated to the DW case in order to interpret them physically.

Next Section:
Computational Complexity
Previous Section:
Excitation Examples