Multi_radix Complex Division with Operand Rounding
نویسندگان
چکیده
منابع مشابه
Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification
An efficient initial approximation method for multiplicative division and square root is proposed. It is a modification of the piecewise linear approximation. The multiplication and the addition required for the linear approximation are replaced by only one multiplication with a slight modification of the operand. The same accuracy is achieved. The modification of the operand requires only a bi...
متن کاملFast Ieee Rounding for Division by Functional Iteration
A class of high performance division algorithms is functional iteration. Division by functional iteration uses multiplication as the fundamental operator. The main advantage of division by functional iteration is quadratic convergence to the quotient. However, unlike non-restoring division algorithms such as SRT division, functional iteration does not directly provide a nal remainder. This make...
متن کاملAdditively Homomorphic Encryption with d-Operand Multiplications
The search for encryption schemes that allow to evaluate functions (or circuits) over encrypted data has attracted a lot of attention since the seminal work on this subject by Rivest, Adleman and Dertouzos in 1978. In this work we define a theoretical object, chained encryption schemes, which allow an efficient evaluation of polynomials of degree d over encrypted data. Chained encryption scheme...
متن کاملTwo Operand Binary Adders with Threshold Logic
This paper deals with a new method for implementing Binary Adders of two operands whose main characteristics are: They are built using only threshold gates; carry output, besides carry input, is used to obtain each sum bit and the total number of gates is a linear function of the number of bits of the operands (n).
متن کاملComplex Division with Prescaling of Operands
We adapt the radix-r digit-recurrence division algorithm to complex division. By prescaling the operands, we make the selection of quotient digits simple. This leads to a simple hardware implementation, and allows correct rounding of complex quotient. To reduce large prescaling tables required for radices greater than 4, we adapt the bipartite-table method to multiple-operand functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2020
ISSN: 0975-8887
DOI: 10.5120/ijca2020919768