Cart (Loading....) | Create Account
Close category search window

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-18 ,  Issue: 8 )

Date of Publication:

Aug. 1969

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.