Checking Scheme for a Digital Filter
Original Publication Date: 1985-Aug-01
Included in the Prior Art Database: 2005-Feb-19
A checking scheme for a digital filter or convolution function is disclosed in which the operations of the network for performing the convolution function on the digitized input signals can be easily checked, at any time, by summing the contents of all the partial results registers with the contents of an additional checking register. The result should always be zero. The number in the checking register is formed simply by multiplying the current input by the sum of a first set of coefficients (zeroes) of the filter function and multiplying the output by the sum of a second set of coefficients (poles) of the filter function. The results of these two multiplications are added and should equal, with opposite sign, the sum of all the partial results.