FPGA Implementation of Polynomial Curve Fitting Approximation for Sine and Cosine Generator

This paper is studying the trigonometric functions, such as sine and cosine, which play an essential role in navigation, communication, and other modern digital signal processing systems. These functions can be hardware-implemented using different approaches and algorithms such as COordinate Rotation DIgital Computer (CORDIC) algorithm and Tylor’s series.. This work aims to reduce resource utilization for implementing sine and cosine functions. Therefore, traditional and modified polynomial curve fitting designs based on FPGA are proposed to represent these functions. The traditional polynomial design achieved a high performance and large area consumption, which consumed (1557) of LUTs, (941) occupied slices, and the performance speed of only one clock cycle. Whereas the modified polynomial design acquired less area minimization, where the number of LUTs is (70), the number of occupied slices is (40), and a high-performance speed with a slight delay of 8-clock cycle of performance speed. The modified polynomial design acquired 95 % and 96 % area minimization in terms of LUTs and occupied slices compared with the traditional method meaning high area minimization and high performance with a slight delay.