A heuristic approach for multiple restricted multiplication

— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied by several coefficients which, while not constant, are drawn from a relatively small set of values. The algorithm involves deriving directed acyclic graphs representing multiple constant multiplication obtained for each time step and then merging these graphs into a single MRM graph. For FPGA implementation, the proposed approach results in significant area savings, especially for large problem sizes, and is time-efficient compared to a previous optimum approach using Integer Linear Programming.

• Type: Conference
• Year: 2005
• Where: ISCAS
• Authors: Nalin Sidahao, George A. Constantinides, Peter Y. K. Cheung
• Keywords: ISCAS 2005, Multiple Constant Multiplication, Multiple Restricted Multiplication, Single Mrm Graph