Abstract: In order to implement high level synthesis for polynomial datapaths, the ordered, reduced and canonical weighted generalized list was used to represent for the polynomials. The weighted generalized list was linearized firstly. And based on the weighted generalized list, a high level optimization method for polynomial datapaths was given, which traverses the nodes of the weighted generalized list in a bottom-up fashion and extracted the product terms and sum terms from the weighted generalized list iteratively, and then transformes weighted generalized list into a set of irreducible hierarchical weighted generalized lists, and finally transformes the set of irreducible hierarchical weighted generalized lists into corresponding schedulable data flow graphs which are better suited for high level synthesis. Experiments show that the register transfer level structure which obtained from the schedulable data flow graphs generated by the proposed method had smaller latency and less datapth area than those obtained using traditional methods.

Key words: polynomial, weighted generalized list, datapaths, high level synthesis