Constrained Polynomial Multiplication

  • Michael T. Heideman
Part of the Signal Processing and Digital Filtering book series (SIGNAL PROCESS)


Frequently, one or both of the polynomials to be multiplied has some special characteristic, such as symmetry in the coefficients, coefficients that are zero or in G, or some other possibility. What are the effects of input constraints on the multiplicative complexity of systems of polynomial multiplication? This chapter shows precisely what types of constraints reduce multiplicative complexity. These results are then applied to the special case of products of polynomials exhibiting symmetry.


Difference Equation Polynomial Multiplication Symmetric Polynomial Chinese Remainder Theorem Input Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1988

Authors and Affiliations

  • Michael T. Heideman
    • 1
  1. 1.Etak IncorporatedMenlo ParkUSA

Personalised recommendations