where and are polynomials. The parameter Gain specifies G, and the floating-point arrays Numerator and Denominator specify and , respectively. Both arrays start with the constant terms of the polynomial and decrease in powers of (increase in powers of ). Note that the constant term of D is not omitted, as is common in other programs that assume it is always normalized to unity.
This primitive implements an all pole filter with the denominator coefficients of the transfer function externally supplied. For each set of coefficients, a block of input samples is processed, all in one firing. The transfer function is
where the coefficients of are externally supplied.
This primitive implements an FIR filter with coefficients that are periodically updated from the outside. For each set of coefficients, a block of input samples is processed, all in one firing.
A block forward lattice filter. It is identical to the LatticeForward primitive, except that the reflection coefficients are updated each time the primitive fires by reading the Coefs input. The NumberOfCoefficients parameter indicates how many coefficient should be read. The BlockSize parameter specifies how many data samples should be processed for each set of coefficients.
A block recursive (IIR) lattice filter. It is identical to the LatticeRecursive primitive, except that the reflection coefficients are updated each time the primitive fires by reading the Coefs input. The NumberOfCoefficients and BlockSize parameters have the same interpretation as in the LatticeForwardVar primitive.