Imperial College London > Talks@ee.imperial > CAS Talks > Area-efficient Division for 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 |
Area-efficient Division for 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 iterative algorithms contain a set of operations including division, multiplication and addition. Traditionally, carry direction reversal between most-significant-digit-first (MSDF) division and least-significant-digit-first (LSDF) addition or multiplication stalls computation until all digits in the preceding operation have been calculated. Numerical operations are also normally implemented using finite-precision datatypes, so precision must be chosen prior to the iterative algorithm’s commencement. Subsequently, users typically over-budget their precision in order to achieve a convergent result. To address these issues, we propose an area-efficient architecture for ARCHITECT (ARbitrary-precision Constant-Hardware ITErative CompuTe) division and composite division/multiplication-addition arithmetic on field-programmable gate arrays (FPGAs), which is able to complete. 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 listsType the title of a new list here COMMSP SeminarOther talksiCore Seminar: London-ish Lattice Coding & Crypto Meeting and IEEE Information Theory Society Distinguished Lecture Linear Programming Approach to Singularly Perturbed Problems of Optimal |