Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Heideman, M.T. (1988). Constrained Polynomial Multiplication. In: Multiplicative Complexity, Convolution, and the DFT. Signal Processing and Digital Filtering. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3912-3_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3912-3_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8399-7
Online ISBN: 978-1-4612-3912-3
eBook Packages: Springer Book Archive