Efficient Multi-Cycle Folded Integer Multipliers
Ahmad Houraniah, H. Fatih Ugurdag, C. Emre Dedeagac

TL;DR
This paper introduces customizable multi-cycle folded integer multipliers that significantly reduce area, energy, and power consumption for large bit-width multipliers by sharing resources across multiple cycles.
Contribution
It presents novel architectures for multi-cycle folded integer multipliers based on Schoolbook and Karatsuba methods, with a flexible design generator for various throughput and latency requirements.
Findings
Up to 44% area savings for 8-128 bit widths.
Up to 33% energy savings.
Up to 65% peak power reduction.
Abstract
Fast combinational multipliers with large bit widths can occupy significant silicon area, which also drives up power consumption. Area can be reduced through resource sharing (i.e., folding) at the expense of lower throughput, which is acceptable for some applications. This work explores multiple architectures for Multi-Cycle folded Integer Multiplier (MCIM) designs, which are based on Schoolbook and Karatsuba approaches. Applications sometimes require a fractional number of multiplications to be performed per cycle. For example, an algorithm may only require 3.5 multiplications per cycle. In such a case, 3 multipliers with a throughput of 1 plus an additional smaller multiplier with a throughput of would be sufficient to maintain the algorithm's throughput. Our MCIM design generator offers customization in terms of throughput, latency, and clock frequency. MCIM designs were…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLow-power high-performance VLSI design · Quantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata
