Multi‐precision binary multiplier architecture for multi‐precision floating‐point multiplication
نویسندگان
چکیده
منابع مشابه
Optimizing Multiprecision Multiplication for Public Key Cryptography
In this paper we recall the hybrid method of Gura et al. for multi-precision multiplication [4] which is an improvement on the basic Comba method and which exploits the increased number of registers available on modern architectures in order to avoid duplicated loads from memory. We then show how to improve and generalise the method for application across a wide range of processor types, settin...
متن کاملEfficient multiprecision floating point multiplication with optimal directional rounding
An algorithm is described for multiplying multipre-cision oating point numbers. The algorithm produces either the smallest oating point number greater than or equal to the true product or the greatest oating point number smaller than or equal to the true product. Software implementations of multiprecision precision oating point multiplication can reduce the computing time by a factor of two if ...
متن کاملAdaptive Multiprecision Path Tracking
This article treats numerical methods for tracking an implicitly defined path. The numerical precision required to successfully track such a path is difficult to predict a priori, and indeed, it may change dramatically through the course of the path. In current practice, one must either choose a conservatively large numerical precision at the outset or re-run paths multiple times in successivel...
متن کاملFast Rounding in Multiprecision . . .
to Section III, the factorized algorithm computes (14) and (15) with 36 multiplications and 90 additions. Other symmetries of (14) and (15) can be exploited: the first terms of the sums in (14) and also the first of d, and the second of di', the first of d; and the second of dd, the first of di' and the second of d; are pairwise equal, therefore, only 18 multiplications and 48 additions in GF(2...
متن کاملMultiprecision division: Expanded Version
This paper presents a study of multiprecision division on processors containing word-by-word multipliers. It compares several algorithms by first optimizing each for the software environment, and then comparing their performances on simple machine models. While the study was originally motivated by floating-point division in the small-word environment, the results are extended to multiprecision...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Circuits, Devices & Systems
سال: 2021
ISSN: 1751-858X,1751-8598
DOI: 10.1049/cds2.12041