Results 251 to 260 of about 566,670 (285)
Phase Equilibrium of <i>n</i>-Nonane + <i>n</i>-Decane for Low-Temperature Thermal Energy Storage: Insights into Odd-Even Effects. [PDF]
Sequeira MCM+5 more
europepmc +1 more source
Advantages of imperfect dice rolls over coin flips for random number generation. [PDF]
Pfeffer DT+4 more
europepmc +1 more source
Boosting multiplexing capabilities for error-robust spatial transcriptomic methods using a set exchange approach. [PDF]
Boström J, Zapaɫa M, Adameyko I.
europepmc +1 more source
Binary vector copy number engineering improves Agrobacterium-mediated transformation
Matthew J. Szarzanowicz+17 more
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An efficient redundant-binary number to binary number converter
IEEE Journal of Solid-State Circuits, 1992The authors present a method for converting the redundant-binary representation into the 2's complement binary representation. Instead of using the conventional full adders, a more efficient redundant-binary number to binary number converter can be designed with the aid of the new variable C/sub i/.
Chi-Sung Laih+3 more
openaire +2 more sources
A Novel Redundant Binary Number to Natural Binary Number Converter
Journal of Signal Processing Systems, 2009Redundant binary number appears to be appropriate for high-speed arithmetic operation, but the delay and hardware cost associated with the conversion from redundant binary (RB) to natural binary (NB) number is still a challenging task. In the present investigation a simple approach has been adopted to achieve high speed with lesser hardware and power ...
Abhijit Asati+3 more
openaire +2 more sources
On the Addition of Binary Numbers
IEEE Transactions on Computers, 1970An upper bound is derived for the time required to add numbers modulo 2n, using circuit elements with a limited fan-in and unit delay, and assuming that all numbers have the usual binary encoding. The upper bound is within a factor (1 + e) of Winograd's lower bound (which holds for all encodings), where e→0 as n→∞, and only O(n log n) circuit elements ...
openaire +2 more sources