On the reduction in multiplicative complexity achieved by the polynomial residue number system

DOI10.1109/78.157231MaRDI QIDQ4031499zbMATH OpenOpenAlexFDO

Authors Glenn S. Zelniker, Fred Taylor

Publication date 1 April 1993

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/78.157231

zbMATH Keywords

associative algebrascomplexity reductionfinite fieldpolynomial multiplicationpolynomial residue number system

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• On the polynomial residue number system (digital signal processing)
• scientific article; zbMATH DE number 4162325
• The multipolynomial channel polynomial residue arithmetic system
• Two-dimensional polynomial residue number system
• Two-dimensional polynomial residue number system

Cited in

(3)

• scientific article; zbMATH DE number 4162325 (Why is no real title available?)
• The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear
• On the polynomial residue number system (digital signal processing)

This page was built for publication: On the reduction in multiplicative complexity achieved by the polynomial residue number system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031499)