Computational and Implementation Complexity of Polynomial Evaluation Schemes
2011 (English)In: Proceedings of NORCHIP, 2011 Date:14-15 Nov. 2011, IEEE conference proceedings, 2011, 1-6 p.Conference paper (Refereed)
In this work, we consider the computational complexity of different polynomial evaluation schemes. By considering the number of operations of different types, critical path, pipelining complexity, and latency after pipelining, high-level comparisons are obtained. These can then be used to short list suitable candidates for an implementation given the specifications. Not only multiplications are considered, but they are divided into data-data multiplications, squarers, and data-coefficient multiplications, as the latter can be optimized depending on implementation architecture and application.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2011. 1-6 p.
Adders, Computer architecture, Delay, Filtering algorithms, ISO, Pipeline processing, Polynomials
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-73935DOI: 10.1109/NORCHP.2011.6126735ISBN: 978-1-4577-0515-1 (www)ISBN: 978-1-4577-0514-4 (print)OAI: oai:DiVA.org:liu-73935DiVA: diva2:478816
NORCHIP 2011. The Nordic Microelectronics event, 29th Norchip Conference 14-15 November 2011, Lund, Sweden