FPGA Implementation of Resource-Efficient Cube Calculation Architecture Using Yavadunam Sutra
摘要
In the present era, achieving low area and low power in VLSI implementations of digital signal processing tasks relies heavily on efficient arithmetic operations. Among these operations, the multiplier plays a pivotal role, particularly in evaluating cube operands. This paper introduces a new low-resource cube calculation architecture that utilizes a proposed cube calculation algorithm based on the Yavadunam sutra. The suggested algorithm eliminates the need for the commonly used n \(\times \) n bit multiplier in state-of-the-art cube calculation architectures based on the Yavadunam sutra. The FPGA Implementation of our proposed cube architecture on the Virtex4vlx15sf363-12 board demonstrates a significant reduction in 4-input LUTs and slice usage. Compared to the state-of-the-art approach, it achieves a reduction in the utilization of 4-input LUTs by 31.51% for an 8-bit input, 37.84% for a 16-bit input, 24.99% for a 32-bit input, and 26.73% for a 64-bit input. Additionally, a reduction in slice consumption has been observed by 31.22% for an 8-bit input, 37.88% for a 16-bit input, 25% for a 32-bit input, and 26.73% for a 64-bit input. Furthermore, this paper presents the ASIC design of the proposed architecture using the UMC 90 nm-CMOS process and industry-standard EDA tools. The ASIC synthesis results demonstrate that the proposed 8-bit input cube calculation architecture occupies a core area of 0.004 \(\text {mm}^2\) and achieves a maximum clock frequency of 234 MHz.