Table-Lookup/Interpolation Function Generation for Fixed-Point Digital Computations

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 procedur...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. C-18; no. 8; pp. 745 - 749
Main Authors Aus, H.M., Korn, G.A.
Format Journal Article
LanguageEnglish
Published IEEE 01.08.1969
Subjects
Fixed-point computation
function generator
simulation
sine-cosine generator
table-lookup
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0018-9340
1557-9956
DOI:10.1109/T-C.1969.222758