Also Available Domains Xilinx Vivado|Xilinx ISE
The main objective of this paper is to reduce the power in field-programmable gate arrays (FPGAs) to improve the efficiency of arithmetic functions. In this paper, we are designing the 1-bit full adder and 4-bit CLA with the different LUT structures in FPGAs
In this project, we studied on different FLUT architectures which are used in FPGAs. Hardened adder and carry logic is widely used in commercial field-programmable gate arrays (FPGAs) to improve the efficiency of arithmetic functions. There are many design choices and complexities associated with such hardening, including circuit design, FPGA architectural choices, and the Computer Aided Design (CAD) flow. However, these choices have not been studied much and hence we explore a number of possibilities. We show that hard adders and carry chains increase the performance of simple adders by a factor of 4 or more.
Our best non-fracturable lookup table (non-FLUT) architecture with hardened arithmetic yields better area–delay product than architectures without hardened arithmetic.
Keywords: Field Programmable Gate Arrays (FPGAs), logic design, Fracturable Look Up Table
NOTE: Without the concern of our team, please don't submit to the college. This Abstract varies based on student requirements.

Software Requirements:
Hardware Requirements: