Evaluation of linear, quadratic and cubic expressions on a binary tree

Recently P.C. Mathias and L.M. Patnaik (1988) proposed a hexagonal interconnection structure on a square grid of processing elements (PEs) to evaluate linear, quadratic and cubic expressions. In the letter an efficient systolic algorithm is presented to evaluate these expressions, which runs on a simpler interconnection structure, the binary tree of PEs.