Dismiss
The InnovationQ application will be updated on Sunday, May 31st from 10am-noon ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

Method for Polynomial Transformation for Recursive Implementation

IP.com Disclosure Number: IPCOM000033541D
Original Publication Date: 2004-Dec-15
Included in the Prior Art Database: 2004-Dec-15

Publishing Venue

Motorola

Related People

Authors:
Barry Herold Mohamed Imtiaz Ahmed King Lee

Abstract

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 [3]. However, these methods still require the use of multipliers.