Minimal Three-Variable NOR and NAND Logic Circuits

Cantor, Estrin and Turn have described a special-purpose structure to implement sequential table look-up (STL) algorithms for the evaluation of ln x and exp x.1 Tables of precomputed constants are used to transform the argument into a range where the function may be approximated by a simple polynomial. The transformation for ln x, originally proposed by Bemer,2 is where the set of constants ai are precomputed. A power series expansion for ln x is