SINGLE-PRECISION MULTIPLIER WITH REDUCED CIRCUIT COMPLEXITY FOR SIGNAL-PROCESSING APPLICATIONS

When two numbers are multiplied, a double-wordlength product is produced. In applications where only the single-precision product is required, the double-wordlength result is rounded to single-precision. Hence, in single-precision applications, it is not necessary to compute the least significant part of the product exactly. Instead, it is only necessary to estimate the carries generated in the computation of the least significant part that will ripple into the most significant part of the product. This will produce single-precision multiplier with significantly reduced circuit complexity. In this paper, we present three novel methods for realizing this class of reduced complexity single-precision multipliers. Their performances are also analyzed.