International Research Journal of Engineering and Technology (IRJET)
e-ISSN: 2395-0056
Volume: 11 Issue: 04 | Apr 2024
p-ISSN: 2395-0072
www.irjet.net
Implementation of High speed and Area efficient Karatsuba Multiplier Using Sklansky adder Sai Rama Rao T1, Tulasi Ratnam K2, Navya Sri K3, Bhagya Sree E4, Nalini Devi G5, Nagaraju P6 12345Graduate Student,6Assistant Professor, Department of Electronics and Communication
Engineering, Sri Vasavi Engineering College, Tadepalligudem, West Godavari, Andhra Pradesh, India. ---------------------------------------------------------------------***---------------------------------------------------------------------
Abstract -Multiplication serves as the center of many
Traditional methods for floating-point multiplication often face challenges in terms of speed and area efficiency. One promising approach to address these challenges is leveraging the Karatsuba algorithm, a fast multiplication technique known for its divide-and-conquer strategy, which reduces massive number multiplication to smaller, more manageable subproblems. It accomplishes this by intelligently breaking down the two floating-point values (A and B) into high and low-order bits. This decomposition facilitates recursive calls to the Karatsuba algorithm on the smaller parts. The real magic, is its ability to estimate the middle product (P2) - the product of A and B's middle-order bits - using just high and low-order data. This estimation reduces the requirement for a full multiplication, resulting in a considerable reduction in the number of multiplication steps necessary.
computer processes, hence the creation of efficient multiplication algorithms is a crucial area of research. The Karatsuba method is widely recognized for its ability to speed multiplication by dividing big operands into smaller, simpler to handle sub problems. However, delivering high-speed performance while preserving area is still a difficulty in real applications. This paper proposes a novel approach to enhance both speed and area efficiency of Karatsuba multiplication through the integration of Sklansky adders. Sklansky adders are a type of parallel prefix adder, known for their inherent parallelism and compact layout, offer a promising solution to address the performance and resource utilization concerns associated with traditional multiplication architectures. The proposed design leverages the recursive nature of Karatsuba multiplication to exploit parallelism at various stages of the algorithm. By incorporating Sklansky adders into critical sections of the Karatsuba multiplier, the proposed architecture achieves significant improvements in both speed and area efficiency compared to Vedic multiplier implementation. Furthermore, the design exhibits scalability across different operand sizes, making it suitable for a wide range of applications demanding high-performance multiplication capabilities.
The benefits of the Karatsuba algorithm are numerous. Firstly, it has a time complexity of around O(n^1.58), which is significantly better than the O(n^2) difficulty of the gradeschool technique, especially for large numbers. This leads to considerably quicker computations, which is beneficial for applications that rely heavily on floating-point calculations. Second, its divide-and-conquer nature makes it ideal for hardware implementation in processors and other computing devices. This enables effective use of hardware resources for floating-point multiplication applications.
Key Words: Karatsuba Multiplier, Sklansky Adder, Vedic multiplier.
This paper explores the design and implementation of floating-point multiplication using the Karatsuba multiplier in VLSI. We begin by providing a brief overview of floating-point representation and the challenges associated with its multiplication. Subsequently, we delve into the principles of the Karatsuba algorithm and its adaptation for floating-point arithmetic.
1. INTRODUCTION In the realm of Very Large-Scale Integration (VLSI) design, optimizing arithmetic operations for floating-point numbers is crucial for achieving high-performance computing systems. Floating-point multiplication, a fundamental arithmetic operation in many computational tasks, demands efficient algorithms and hardware implementations to meet the increasing demands of modern applications.
2. Literature Survey Haripriya A et al. present a special Vedic multiplier architecture that utilizes the fundamental components of digital signal processors, the RCA and CSLA architectures. The study encourages CSLA integration, emphasizing power, speed, and area efficiency in order to increase multiplication. The Urdhva-Tiryakbhyam approach is used to divide the input operands into smaller blocks. The intermediate products are then obtained, and the CSLA is used to sum the results to achieve the final result. Despite problems with area efficiency brought on by CSLA's twin RCA design, synthesis
The realm of floating-point multiplication underlies a wide range of scientific calculations, from simulating complicated phenomena in nature to processing enormous datasets in machine learning. However, the typical, elementary-school approach of multiplying big floating-point numbers rapidly becomes computationally costly. This is where the brilliant Karatsuba algorithm shines.
© 2024, IRJET
|
Impact Factor value: 8.226
|
ISO 9001:2008 Certified Journal
|
Page 1900