Results 241 to 250 of about 943,112 (315)

One-step propylene purification from a quaternary mixture by a single physisorbent. [PDF]

Nat Commun
Zhang P, Qiu Z, Liu Y, Chen S, Yang L, Suo X, Cui X, Xing H.   +7 more
europepmc   +1 more source

Design of binary logarithm generators

Proceedings of the Institution of Electrical Engineers, 1968
A design method is described by which a number x, in binary code, can be used to generate the binary form of log2x. Unlike earlier methods, this does not depend on an approximation to a linear relatioqship between x and log2x. The mantissa of the logarithm can be generated with an adequate number of bits, without undue increase in the complexity of the
K.J. Dean
semanticscholar   +3 more sources

Generation of a Precise Binary Logarithm with Difference Grouping Programmable Logic Array

IEEE Transactions on Computers, 1985
The design algorithm of a differential group programmable logic array (DGPLA) to generate the precise binary logarithm function is suggested. It can reach an optimal condition such that the number of bits in a PLA is minimized, while the error is still kept as small as possible.
Hao‐Yung Lo, Aoki
semanticscholar   +4 more sources

A new binary logarithm-based computing system

IEE Proceedings E Computers and Digital Techniques, 1983
G. Frangakis
semanticscholar   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

A new design approach to binary logarithm computation

Signal Processing, 1987
Abstract 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)
Renato de Mori, Régis Cardin
openaire   +2 more sources

A Fast Integer Binary Logarithm of Large Arguments

IEEE Micro, 1987
Simple and fast (10?), this new procedure requires no hardware and features a 10-6 approximation error.
R. Männer
openaire   +2 more sources

Fast optical binary multiplication using a sign/logarithm number system

Optics Letters, 1991
A 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 ...
A, Kostrzewski, G, Eichmann, D H, Kim, Y, Li   +3 more
semanticscholar   +5 more sources

Programmable variable-rate up/down counter for generating binary logarithms

IEE Proceedings E Computers and Digital Techniques, 1984
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.
H.-Y. Lo, Jianli Lu, Y. Aoki
  +4 more sources