Variable Latency Rounding for Golschmidt Algorithm with Parallel Remainder Estimation

Clicks: 174
ID: 273703
2009
This paper presents a rounding method for functional iteration algorithms. The new method is made up of a new rounding algorithm and the calculation of a remainder estimation. The rounding method uses the result directly obtained from the algorithm without any transformation. The remainder estimation is calculated in parallel with the algorithm execution. This allow us to avoid the conventional remainder calculation after obtaining result, most of the times. In this way, the final implementation has a variable latency. By using adequate configurations the remainder calculation is only necessary in 9% of the total cases.
Reference Key
bruguera20092009variable Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Daniel Piso Fernandez,Javier Diaz Bruguera;Daniel Piso Fernandez;Javier Diaz Bruguera;
Journal 2009 12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools
Year 2009
DOI 10.1109/dsd.2009.165
URL
https://sciprofiles.com/publication/view/d462a070fc29154083e99bc71b2dfd55
Keywords
costs delay approximation algorithms hardware computer architecture convergence contracts algorithm design and analysis digital systems design methodology

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.