Microprocessor applications of integer arithmetic
J. Raamot · Proceedings of the IEEE · 1978
The integer arithmetic technique is introduced via an example taken from digital signal processing. There the technique is implemented on a bit slice microprocessor to calculate scaled values of a quantized input signal Successive solution points are generated within 200 ns of the input signal increments, and there is no accumulation of errors. The technique is extended to the calculation of incremental solutions to polynomials and ordinary differential equations. The extended applications are based on the properties of F space solutions and contour following algorithms. Both are reviewed prior to the discussion of an extended microprocessor application.