Multiplier Optimization via E-Graph Rewriting (2312.06004v1)
Abstract: Multiplier circuits account for significant resource usage in datapath-dominated circuit designs, and RTL designers continue to build bespoke hand-crafted multiplication arrays for their particular application. The construction of an optimized multiplier presents trade-offs between pre-processing to generate a smaller array and array reduction. A data structure known as an e-graph has recently been applied to datapath optimization, where the e-graph's ability to efficiently explore trade-offs has been shown to be crucial. We propose an e-graph based rewriting framework to construct optimized multiplier circuits. Such a framework can express alternative multiplier representations and generate customized circuit designs. We demonstrate that the proposed tool, which we call OptiMult, can reduce the latency of a squarer by up to 46% and reduce the latency of a standard multiplier by up to 9% when compared against logic synthesis instantiated components.
- W. J. Stenzel, W. J. Kubitz, and G. H. Garcia, “A Compact High-Speed Parallel Multiplication Scheme,” IEEE Transactions on Computers, vol. C-26, no. 10, 1977.
- C. S. Wallace, “A Suggestion for a Fast Multiplier,” IEEE Transactions on Electronic Computers, vol. EC-13, no. 1, 1964.
- L. Dadda, “Some schemes for parallel multipliers,” Alta frequenza, vol. 34, pp. 349–356, 1965.
- M. Kumm and J. Kappauf, “Advanced Compressor Tree Synthesis for FPGAs,” IEEE Transactions on Computers, vol. 67, no. 8, 2018.
- H. Parandeh-Afshar, P. Brisk, and P. Ienne, “Improving synthesis of compressor trees on FPGAs via integer linear programming,” in Proceedings -Design, Automation and Test in Europe, DATE, 2008.
- S. Coward, G. A. Constantinides, and T. Drane, “Automatic Datapath Optimization using E-Graphs,” in IEEE 29th Symposium on Computer Arithmetic (ARITH). IEEE, 9 2022, pp. 43–50.
- E. Ustun, I. San, J. Yin, C. Yu, and Z. Zhang, “IMpress: Large Integer Multiplication Expression Rewriting for FPGA HLS,” in 2022 IEEE 30th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), 2022, pp. 1–10.
- S. Coward, G. A. Constantinides, and T. Drane, “Automating Constraint-Aware Datapath Optimization using E-Graphs,” in Design Automation Conference, 2023. [Online]. Available: https://arxiv.org/abs/2303.01839
- T. Koehler, P. Trinder, and M. Steuwer, “Sketch-Guided Equality Saturation: Scaling Equality Saturation to Complex Optimizations of Functional Programs,” 11 2021.
- M. Willsey, C. Nandi, Y. R. Wang, O. Flatt, Z. Tatlock, and P. Panchekha, “Egg: Fast and extensible equality saturation,” in Proceedings of the ACM on Principles of Programming Languages, vol. 5, no. POPL, 2021.
- Y. R. Wang, S. Hutchison, J. Leang, B. Howe, and D. Suciu, “SPORES: Sum-product optimization via relational equality saturation for large scale linear algebra,” Proceedings of the VLDB Endowment, vol. 13, no. 11, 2020.
- M. D. Ercegovac and T. Lang, “Fast Multiplication Without Carry-Propagate Addition,” IEEE Transactions on Computers, vol. 39, no. 11, 1990.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
