Results 231 to 240 of about 796,772 (273)
Some of the next articles are maybe not open access.
A Fast Binary Logarithm Algorithm [DSP Tips & Tricks
IEEE Signal Processing Magazine, 2010This article presents a computationally fast algorithm for computing logarithms. The algorithm is particularly well suited for implementation using fixed-point processors.
C. S. Turner
openaire +3 more sources
A new design approach to binary logarithm computation
Signal Processing, 1987Abstract A combinational circuit for computing the binary logarithm of an N bits number is proposed. The structure has a time complexity of O(logN) and an area complexity of O(N2). The same structure can be used for computing the antilogarithm of a number, thus allowing to obtain the quotient of two binary numbers in O(logN) time complexity and O(N2)
R. Cardin, R. De Mori
openaire +3 more sources
Tables of Binary Logarithms, Uncertainty Functions, and Binary Log Functions
Three sets of 4-place tables are presented, one set on each of two facing pages: binary logarithms (log2 n) of 3-digit numbers, uncertainty functions (– p log2 p) and binary log functions (log2 1/ p) for values of p from .001 to .999.
Earl A. Alluisi
openalex +4 more sources
Fast optical binary multiplication using a sign/logarithm number system
Optics Letters, 1991A new fast binary multiplication scheme based on a nonholographic optical content-addressable memory (CAM) is presented. By using a sign/logarithm number (SLN) system, the multiplication operation is performed through a binary logarithmic addition. A three-stage CAM-based multiplication scheme is proposed in which the first CAM converts input binary ...
Andrew Kostrzewski+3 more
semanticscholar +5 more sources
Computer Multiplication and Division Using Binary Logarithms
A method of computer multiplication and division is proposed which uses binary logarithms. The logarithm of a binary number may be determined approximately from the number itself by simple shifting and counting. A simple add or subtract and shift operation is all that is required to multiply or divide.
John N. Mitchell
openalex +3 more sources
Programmable variable-rate up/down counter for generating binary logarithms [PDF]
The design of an algorithm for a programmable variable-rate counter for generating precise binary logarithmic functions is presented. The error in log 2 (l + x), as defined by Iog 2 (l + x) - x, may be considered as a set of straight lines whose slopes, either positive or negative, are chosen to be integral multiples of a binary fraction.
Lo, Lü, Aoki
openalex +2 more sources
Binary logarithms for computing integral and non-integral roots and powers
This paper suggests a method of utilizing binary logarithms to compute the power, root, or any exponential of a number. It is an extension of Mitchell's (1962) technique. Due to the approximation of the binary logarithms, there will be errors in the calculations of the results.
Hao‐Yung Lo
openalex +3 more sources
On Computer Multiplication and Division Using Binary Logarithms
E. V. Krishnamurthy
openalex +3 more sources
Exponentiation Using Binary Logarithms
IETE Journal of Research, 1980A method for digital exponentiation is described. In the method, the binary lg lg (lgN=log2N) of the number (say, z=yz) is computed, The required value (z) is obtained by taking antilogarithm twice. The determination of the logarithm and antilogarithm can be accomplished by simple shifting of the registers in a digital logic, thus the exponentiation ...
V.K. Srivastava, I.U. Ansari
openaire +2 more sources
R66-78 Computation of the Base Two Logarithm of Binary Number
Charles W. Hastings
openalex +3 more sources