Lines Matching full:frac
42 where x is a int.frac number representing number of octaves.
43 Actually, we approximate only the 2^(frac) using the power series
45 2^x == 2^(int.frac) == 2^(int) * 2^(fract)
108 output = (1-frac) * sample[n] + (frac) * sample[n+1]
110 where conceptually 0 <= frac < 1
112 For a fixed point implementation, frac is actually an integer value
213 /* we coudl re-use the phase frac macros, but if we do,
299 /* drive coef is given as int.frac */
335 * nResult - int.frac result (where frac has NUM_DENTS_FRAC_BITS)
