Performance Comparison of Fast Multipliers Implemented on Variable Precision Floating Point Multiplication Algorithm
نویسندگان
چکیده
The multiplication is the basic arithmetic operation in any typical processor. The multiplication process requires more hardware resources and processing time when compared with addition and subtraction. The accuracy of a multiplication mostly relies on the precision of the multiplication; a variable precision multiplier will have more accuracy than single or double precision multipliers. In this paper, a variable precision floating point multiplier is considered and total architecture for the variable precision multiplier is proposed also four different multipliers are implemented using the variable precision algorithm. The comparative study on performance analysis like delay characteristics and area is done for the considered multipliers. The best multiplier to be used for the variable precision algorithm is proposed.
منابع مشابه
Combined Integer and Variable Precision (CIVP) Floating Point Multiplication Architecture for FPGAs
In this paper, we propose an architecture/methodology for making FPGAs suitable for integer as well as variable precision floating point multiplication. The proposed work will of great importance in applications which requires variable precision floating point multiplication such as multi-media processing applications. In the proposed architecture/methodology, we propose the replacement of exis...
متن کاملA Double Precision Floating Point Multiplier Suitably Designed for FPGAs and ASICs
In this paper, a double precision IEEE 754 floating-point multiplier with high speed and low power is presented. The bottleneck of any double precision floatingpoint multiplier design is the 53x53 multiplication of the mantissas (52 bit mantissa+1 hidden bit). This paper proposes a approach to improve this performance bottleneck by adding a redundant 54 bit initialized to ‘0’ in the mantissas o...
متن کاملASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm
Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...
متن کاملA Novel Time-Area-Power Efficient Single Precision Floating Point Multiplier
In this paper, a single precision IEEE 754 floatingpoint multiplier with high speed and low power is presented. The bottleneck of any single precision floating-point multiplier design is the 24x24 bit integer multiplier. Urdhava Triyakbhyam algorithm of ancient Indian Vedic Mathematics is utilized to improve its efficiency. In the proposed architecture, the 24x24 bit multiplication operation is...
متن کاملDesign and Implementation of Binary Signed Vedic Multiplier for Real Time Digital Signal Processing Applications
In any digital signal processors (DSP’s) the speed of the multipliers plays a very important role. The precision of the multipliers also plays very important role along with its speed. For many high performance systems such as Digital Signal Processors, Microprocessors etc Multipliers are the key components. Since the Floating point multipliers can provide required precision but they are relati...
متن کامل