📞 +91-7667918914 | ✉️ iarjset@gmail.com
International Advanced Research Journal in Science, Engineering and Technology
International Advanced Research Journal in Science, Engineering and Technology A Monthly Peer-Reviewed Multidisciplinary Journal
ISSN Online 2393-8021ISSN Print 2394-1588Since 2014
IARJSET aligns to the suggestive parameters by the latest University Grants Commission (UGC) for peer-reviewed journals, committed to promoting research excellence, ethical publishing practices, and a global scholarly impact.
← Back to VOLUME 1, ISSUE 4, DECEMBER 2014

OPTIMIZED AREA-DELAY AND POWER EFFICIENT CARRY SELECT ADDER

MR. MOOSAIRSHAD KP, MRS. M. MEENAKUMARI, MS. S. SHARMILA

👁 11 views📥 6 downloads
Share: 𝕏 f in
Abstract: In the design of Digital Integrated Circuits area occupancy, delay and power play an important role because of the increasing necessity of portable and fast systems. Adders are one of the most widely used digital components in various Digital Circuits. Carry Select Adder (CSLA) is one of the fastest adders used in many processors, multipliers, and different applications. Carry select method is having a good compromise between cost and performance in carry propagation method. In this paper a modified area and low power carry select adder along with lower delay is proposed. The proposed system has low area and power consumption with lower delay suitable for FPGA design than the existing carry select adders. Due to the optimized area, power and delay, the proposed CSLA design is a good substitution for all the existing CSLA. The proposed architecture is designed using VHDL and is then synthesized using XILINX 13.2i and is simulated in ISim for Spartan 3E FPGA.

Keywords: carry select adder, area efficient, delay efficient, low power adder

How to Cite:

[1] MR. MOOSAIRSHAD KP, MRS. M. MEENAKUMARI, MS. S. SHARMILA, “OPTIMIZED AREA-DELAY AND POWER EFFICIENT CARRY SELECT ADDER,” International Advanced Research Journal in Science, Engineering and Technology (IARJSET)

Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License.