DATA PATH SYNTHESIS WITH/WITHOUT CONSTRAINTS.

A method is presented to synthesize the data path directly from the behavior language with or without the constraints on the number of operators. The method consists of operator, bus, and storage element allocators. Hu's algorithm, the A* algorithm, and the cliques partitioning algorithm are adopted to implement those three allocators, respectively. By using allocation sequences and algorithms different from C. J. Tseng and D. P. Siewiorek (1984), in which only the case without constraints is considered, the authors' method produces better results, and can be applied to the case with constraints, which was not formally studied before.