Multiple-Wordlength Resource Binding [chapter]

George A. Constantinides, Peter Y. K. Cheung, Wayne Luk
2000 Lecture Notes in Computer Science  
This paper describes a novel resource binding technique for use in multiple-wordlength systems implemented in FPGAs. It is demonstrated that the multiple-wordlength binding problem is significantly different for addition and multiplication, and techniques to share resources between several operations are examined for FPGA architectures. A novel formulation of the resource binding problem is presented as an optimal colouring problem on a resource conflict graph, and several algorithms are
more » ... ed to solve this problem. Results collected from many sequencing graphs illustrate the effectiveness of the heuristics developed in this paper, demonstrating significant area reductions over more traditional approaches.
doi:10.1007/3-540-44614-1_69 fatcat:hbnl5kl5tvh57njdosrewa43ye