Efficient sine and cosine computation using a weighted sum of bit-products

An angle rotation based approach to simultaneously compute sin(x) and cos(x) is presented. The approach yields a weighted sum of bit-products of the binary bits that represent the angle x. We discuss the required number of terms in the polynomial as well as the required coefficient wordlength as function of accuracy. The approach yields a combinatorial realization with a low complexity. We also propose a corresponding fast and simple architecture. The combinatorial circuit has low latency and can easily be pipelined for a high throughput.