This paper presents a high-speed method for computing elementary functions
using parallel table lookups and multi-operand addition. Increasing the num
ber of tables and inputs to the multi-operand adder significantly reduces t
he amount of memory required. Symmetry and leading zeros in the table coeff
icients are used to reduce the amount of memory even further. This method h
as a closed-form solution for the table entries and can be applied to any d
ifferentiable function. For 24-bit operands, it requires two to three order
s of magnitude less memory than conventional table lookups.