Heuristic Datapath Allocation for Multiple Wordlength Systems
George A. Constantinides, Peter Y. K. Cheung, Wayne Luk · 2001
This paper introduces a heuristic to solve the combined scheduling, resource binding, and wordlength selection problem for multiple wordlength systems. The algorithm involves an iterative refinement of operator wordlength information, leading to a scheduled and bound data-flow graph. Scheduling is performed with incomplete wordlength information during the intermediate stages of this refinement process. Results show significant area savings over known alternative approaches. 1