Answers are grounded in this paper and cite their sources.
Floating-point multiplication is a critical operation in modern digital systems, including signal processing, scientific computing, graphics processing, and high-performance embedded applications. With increasing computational demands, high-speed and area-efficient arithmetic units are essential. This paper presents the design and VLSI implementation of a 32-bit single-precision float- ing-point multiplier optimized for enhanced performance through architectural improvements. The proposed design improves mantissa multiplication using Ra- dix-4 modified Booth encoding to reduce partial products, thereby lowering switching activity and propagation delay. A Wallace tree reduction structure is employed for fast parallel partial-product compression, significantly accelerating accumulation compared to conventional array multipliers. To further enhance throughput, a pipelined architecture is introduced, dividing computation into bal- anced stages to minimize critical path delay and increase operating frequency. Exponent addition with bias adjustment, along with systematic normalization and rounding units, ensures accurate and stable floating-point computation, including proper handling of edge cases. The design is implemented in Verilog HDL and synthesized using standard VLSI tools. Results demonstrate improved timing performance and optimized hardware utilization compared to conventional archi- tectures, achieving an effective balance between speed, area, and complexity.
No takes yet. Share an insight, caveat, or question.
Devi et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: