Approximating the sine function with combinational logic
Eric M. Schwarz, Michael J. Flynn · 2003
An algorithm which creates an implementation of trigonometric functions in combinational logic is presented. The algorithm provides an approximation of a trigonometric function with a latency less than a 16-b by 16-b multiplication. Specifically, the derivation of the sine function for a fixed-point operand is shown. Traditionally, the sine function has been approximated by lookup tables, CORDIC methods, Taylor series, and Chebyshev polynomials. The algorithm presented is shown to have faster implementations than Taylor series and Chebyshev polynomials for a similar precision and does not require any lookup tables.>