Programmer Guide/SPU Reference/AVR: Difference between revisions
From STX Wiki
Jump to navigationJump to search
No edit summary |
No edit summary |
||
| Line 35: | Line 35: | ||
\begin{cases} | \begin{cases} | ||
\frac{1}{t+1}\sum_{z=0}^t X[i,j]_z & \mbox{if }0\leqslant t < T \\ | \frac{1}{t+1}\sum_{z=0}^t X[i,j]_z & \mbox{if }0\leqslant t < T \\ | ||
\frac{1}{T} | \frac{1}{T}\sum_{z=0}^{T-1}X[i,j]_{t-z} & \mbox{if }t\geqslant T | ||
\end{cases} | \end{cases} | ||
</math> | </math> | ||
Revision as of 10:22, 6 May 2011
Average input X over evaluation cycles.
[SPU SUM X TYP T RS OUT Y]
| In: | X | a number, vector or matrix containing the data to be averaged |
|---|---|---|
| TYP | a number or string; defines the averaging method | |
| T | averaging parameter (number); depends on method | |
| RS | reset flag (number) | |
| Out: | Y | averaged input X; same type as X |
- Description
The averaging algorithm is defined by the inputs TYP and T. The atom averages the elements X[i,j]t over evaluation cycles t (i=row index, j=column index, t=cycle counter) and stores the averaged value in the element Y[i,j]t.
- invinite average
- TYP=
0orlinear - T=
0 - Y[i,j]t={X[i,j]tif t=01t+1(t.Y[i,j]t−1+X[i,j]t)if t>0
- running average
- TYP=
0orlinear - T>
0; T is the (integer) number of averaging cycles - Y[i,j]t={1t+1∑z=0tX[i,j]zif 0⩽t<T1T∑z=0T−1X[i,j]t−zif t⩾T
- See also
<SP-atoms>
