Imperial College London > Talks@ee.imperial > CAS Talks > <FPT Practice Talk> ARCHITECT: Arbitrary-precision Constant-hardware Iterative Compute
Log inImperial users Other users No account?Information onFinding a talk Adding a talk Syndicating talks Who we are Everything else |
<FPT Practice Talk> ARCHITECT: Arbitrary-precision Constant-hardware Iterative ComputeAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact George A Constantinides. Many algorithms feature an iterative loop that converges to the result of interest. The numerical operations in such algorithms are generally implemented using finite-precision arithmetic, either fixed or floating point, most of which operate least-significant digit first. This results in a fundamental problem: if, after some time, the result has not converged, is this because we have not run the algorithm for enough iterations or because the arithmetic in some iterations was insufficiently precise? There is no easy way to answer this question, so users will often overbudget precision in the hope that the answer will always be to run for a few more iterations. We propose a fundamentally new approach: armed with the appropriate arithmetic able to generate results from most-significant digit first, we show that fixed compute-area hardware can be used to calculate an arbitrary number of algorithmic iterations to arbitrary precision, with both precision and iteration index increasing in lockstep. Thus, datapaths constructed following our principles demonstrate efficiency over their traditional arithmetic equivalents where the latter’s precisions are either under- or over-budgeted for the computation of a result to a particular accuracy. For the execution of 100 iterations of the Jacobi method, we obtain a 1.60× increase in frequency and 15.7× LUT and 50.2× flip-flop reductions over a 2048-bit parallel-in, serial-out traditional arithmetic equivalent, along with 46.2× LUT and 83.3× flip-flop decreases versus the state-of-the-art online arithmetic implementation. This talk is part of the CAS Talks series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCOMMSP Seminar Type the title of a new list hereOther talksLinear Programming Approach to Singularly Perturbed Problems of Optimal Thermodynamic Costs in Implementing Kalman-Bucy Filters Emerging Cyber-Human Workplaces with Internet of Things: Challenges and Opportunities |