| 摘要 |
The problems of cost, of speed and of truncature noise reduction in a time-based recursive filter are resolved by multiplying (20) the result (Xn - Yn - 1) of the difference between the input signal of the filter and the output signal of the filter by powers n of two and by adding (17) the product of this multiplication to the output signal of the filter. It is shown that the use of powers of two makes it possible, on the one hand, greatly to simplify the multiplication by replacing it by binary shift registers and, on the other hand, makes it possible to reduce noise. <IMAGE>
|
