Title :
Approximating the sine function with combinational logic
Author :
Schwarz, E.M. ; Flynn, M.J.
Author_Institution :
Comput. Sci. Lab., Stanford Univ., CA, USA
Abstract :
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
Keywords :
combinatorial circuits; digital arithmetic; integrated logic circuits; combinational logic; fixed-point operand; latency; sine function; trigonometric functions; Approximation algorithms; Chebyshev approximation; Contracts; Counting circuits; Delay; Equations; Laboratories; Logic; Polynomials; Taylor series;
Conference_Titel :
Signals, Systems and Computers, 1992. 1992 Conference Record of The Twenty-Sixth Asilomar Conference on
Conference_Location :
Pacific Grove, CA
Print_ISBN :
0-8186-3160-0
DOI :
10.1109/ACSSC.1992.269244
