Issue No. 08 - August (1969 vol. 18)
For very fast function generation with small fixed-point digital computers, the n-bit argument word x is split into an N-bit word representing the breakpoint abscissa Xi for table-lookup by indirect addressing, and an n-N bit word representing the interpolation difference X-Xi. The complete procedure takes only about 50 machine cycles (50 ?s) for equal breakpoint intervals, and about 70 machine cycles for variable breakpoint density. A sine-cosine generator for digital or hybrid-computer simulation is exhibited as an example.
Fixed-point computation, function generator, simulation, sine-cosine generator, table-lookup.
H.M. Aus, G.A. Korn, "Table-Lookup/Interpolation Function Generation for Fixed-Point Digital Computations", IEEE Transactions on Computers, vol. 18, no. , pp. 745-749, August 1969, doi:10.1109/T-C.1969.222758