CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
Reseach Article

Implementation and Comparison of Vedic Multiplier using Area Efficient CSLA Architectures

by R. Priya, J. Senthil Kumar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 73 - Number 10
Year of Publication: 2013
Authors: R. Priya, J. Senthil Kumar
10.5120/12778-9326

R. Priya, J. Senthil Kumar . Implementation and Comparison of Vedic Multiplier using Area Efficient CSLA Architectures. International Journal of Computer Applications. 73, 10 ( July 2013), 22-29. DOI=10.5120/12778-9326

@article{ 10.5120/12778-9326,
author = { R. Priya, J. Senthil Kumar },
title = { Implementation and Comparison of Vedic Multiplier using Area Efficient CSLA Architectures },
journal = { International Journal of Computer Applications },
issue_date = { July 2013 },
volume = { 73 },
number = { 10 },
month = { July },
year = { 2013 },
issn = { 0975-8887 },
pages = { 22-29 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume73/number10/12778-9326/ },
doi = { 10.5120/12778-9326 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:39:44.031846+05:30
%A R. Priya
%A J. Senthil Kumar
%T Implementation and Comparison of Vedic Multiplier using Area Efficient CSLA Architectures
%J International Journal of Computer Applications
%@ 0975-8887
%V 73
%N 10
%P 22-29
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In the design of Integrated circuits, area plays a vital role because of increasing the necessity of portable systems. Carry Select Adder (CSLA) is a fast adder used in many data- processing processors for performing fast arithmetic functions. From the structure of the CSLA, the scope is reducing the area of CSLA based on the efficient gate-level modification. In this paper 4 bit, 8 bit, 16 bit, 32 bit, 64 bit and 128 bit Regular Linear CSLA, Modified Linear CSLA, Regular Square-root (SQRT) CSLA and Modified SQRT CSLA architectures have been developed and compared the area of these 4 types of CSLA and also applied these 4 bit, 8 bit, 16 bit, 32 bit, 64 bit and 128 bit CSLAs into 4X4 bit, 8X8 bit, 16X16 bit, 32X32 bit, 64X64 bit and 128X128 bit Vedic Multiplier (VM) respectively, then compared the area of Vedic Multiplier based on this adders. However, the Regular CSLA is still area consuming due to the dual Ripple Carry Adder (RCA) structure. For reducing the area of CSLA, it can be implemented by using a single RCA and an add-one circuit instead of using dual RCA. Comparing the Regular CSLA with Modified CSLA, the Modified CSLA has less area. The results and analysis show that the Modified SQRT CSLA provides better outcomes like less area and also the Vedic Multiplier using Modified Linear CSLA provides less area. This project was aimed for implementing high performance optimized FPGA architecture. Modelsim 10. 0c is used for simulating the CSLAs and VM using CSLAs and synthesized using Xilinx PlanAhead13. 4. Then the implementation is done in Virtex FPGA Kit.

References
  1. Bedrij, O. J. 1962, Carry-select adder, IRE Trans. Electron. Computer, pp. 340–344.
  2. Ramkumar, B. , Kittur, H. M. , and Kannan, P. M. 2010, ASIC implementation of modified faster carry save adder Eur. J. Sci. Res. , vol. 42, no. 1, pp. 53–58.
  3. Ceiang, T. Y. , and Hsiao, M. J. 1998, Carry-select adder using single ripple carry adder Electron. Lett, vol. 34, no. 22, pp. 2101–2103.
  4. Kim, Y. , and Kim, L. S. , 2001, 64-bit carry-select adder with reduced area Electron. Lett. vol. 37, no. 10, pp. 614–615.
  5. Rabaey, J. M. , 2001, Digital Integrated Circuits—A Design Perspective. Upper Saddle River, NJ: Prentice-Hall.
  6. He, Y. , Chang, C. H. , and Gu, J. , 2005, An area efficient 64-bit square Root carry-select adder for low power applications, in proc. IEEE Int. Symp. Circuits Syst. , vol. 4, pp. 4082-4085.
  7. Cadence, 2008, Encounter user guide, Version 6. 2. 4.
  8. Ramkumar, B. , and Harish M Kittur, 2012, Low Power and Area Efficient Carry Select Adder, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, pp. 1-5.
  9. Padma Devi, Ashima Girdher and Balwinder Singh, 1998, Improved Carry Select Adder with Reduced Area and Low Power Consumption, International Journal of Computer Applications, Vol. 3, No. 4, pp. 14-18.
  10. Pushpalata Verma, K. K. , Mehta, 2012, Implementation of an Efficient Multiplier based on Vedic Mathematics Using EDA Tool, International Journal of Engineering and Advanced Technology (IJEAT).
  11. Ganesh Kumar, G. , Charishma, V. , 2012, Design of High Speed Vedic Multiplier using Vedic Mathematics Techniques, International Journal of Scientific and Research Publications.
  12. Vaijyanath Kunchigi, Linganagoda Kulkarni and Subhash Kulkarni, 2012, High Speed and Area Efficient Vedic Multiplier.
  13. Akhilesh Tyagi, 1993, A Reduced-Area Scheme for Carry-Select Adders, IEEE Transactions on Computers, Vol. 42, No. 10, pp. 1163-1170.
  14. Edison, A. J. , and Manikanda babu, C. S. , 2012, An Efficient CSLA Architecture for VLSI Hardware Implementation" International Journal for Mechanical and Industrial Engineering, Vol. 2. Issue 5.
  15. Sreenivasulu, P. , Srinivasa Rao, P. , Malla Reddy, and Vinay Babu, A. , 2012, Energy and Area efficient Carry Select Adder on a reconfigurable Hardware, International Journal of Engineering Research and Applications, Vol. 2, Issue 2, pp. 436-440.
  16. Sarabdeep Singh and Dilip Kumar, 2011, Design of Area and Power efficient Modified Carry Select Adder, International Journal of Computer Applications (0975 – 8887) Volume 33– No. 3.
Index Terms

Computer Science
Information Sciences

Keywords

Area efficient Binary to Excess-1 Converter (BEC) Carry Select Adder (CSLA) Field programmable Gate Array (FPGA) Linear CSLA Square-root CSLA (SQRT CSLA) Vedic Multiplier (VM) Urdhva Tiryakbhyam