Method for Polynomial Transformation for Recursive Implementation
Original Publication Date: 2004-Dec-15
Included in the Prior Art Database: 2004-Dec-15
This paper presents a method to transform a regular polynomial into a recursive form. For an nth degree polynomial, 2n -1 multiplications and n additions are required. The transformation removes the multiplications and achieves the same with just n additions, hence reducing hardware complexity, power consumption and area requirements. Most methods to reduce computational complexity of a polynomial generation make use of Horner’s rule or Estrin’s Algorithm . However, these methods still require the use of multipliers.