Table-Lookup/Interpolation Function Generation for Fixed-Point Digital Computations
- 1 August 1969
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-18 (8) , 745-749
- https://doi.org/10.1109/t-c.1969.222758
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Remarks on the application of dynamic programming to function generationSIMULATION, 1968
- R68-35 Optimal Generation of Arbitrary FunctionsIEEE Transactions on Computers, 1968
- Optimal generation of arbitrary functionsMathematics and Computers in Simulation, 1967
- Hybrid techniques for generation of arbitrary functionsSIMULATION, 1966