Programmer Guide/SPU Reference/AVR: Difference between revisions
From STX Wiki
Jump to navigationJump to search
No edit summary |
No edit summary |
||
| Line 17: | Line 17: | ||
;Description: | ;Description: | ||
The averaging algorithm is defined by the inputs <var>TYP</var> and <var>T</var>. The atom averages the elements <var>X</var>[i,j]<sub>t</sub> over evaluation cycles t (i=row index, j=column index, t=cycle counter) and stores the averaged value in the element <var>Y</var>[i,j]<sub>t</sub>. | The averaging algorithm is defined by the inputs <var>TYP</var> and <var>T</var>. The atom averages the elements <var>X</var>[''i'',''j'']<sub>''t''</sub> over evaluation cycles t (''i''=row index, ''j''=column index, ''t''=cycle counter) and stores the averaged value in the element <var>Y</var>[''i'',''j'']<sub>''t''</sub>. | ||
The cycle counter | |||
:;invinite average: | :;invinite average: | ||
Revision as of 10:23, 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.
The cycle counter
- 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>
