Results 281 to 290 of about 2,170,347 (337)

An efficient redundant-binary number to binary number converter

IEEE Journal of Solid-State Circuits, 1992
The 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/.
null Sung-Ming Yen   +3 more
openaire   +1 more source

On the Addition of Binary Numbers

IEEE Transactions on Computers, 1970
An 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

A Novel Redundant Binary Number to Natural Binary Number Converter

Journal of Signal Processing Systems, 2009
Redundant 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 ...
S. K. Sahoo   +3 more
openaire   +1 more source

The Number of Gaps in Binary Pictures

2005
This paper identifies the total number of gaps of object pixels in a binary picture, which solves an open problem in 2D digital geometry (or combinatorial topology of binary pictures). We obtain a formula for the total number of gaps as a function of the number of object pixels (grid squares), vertices (corners of grid squares), holes, connected ...
BRIMKOV V. E   +4 more
openaire   +2 more sources

Binary Numbers

Mathematics Teaching in the Middle School, 2018
A cartoon involving binary numbers is coupled with a full-page activity sheet.
openaire   +1 more source

On the Number of Classes of Binary Matrices

IEEE Transactions on Computers, 1973
Cellular switching theory gives rise to the problems of counting the number of equivalence classes of m X n matrices of zeros and ones under: 1) row and column permutations; and 2) row and column permutations together with column complementations. A number of techniques are given for the solution of these problems.
openaire   +2 more sources

A ``Binary'' System for Complex Numbers

Journal of the ACM, 1965
Computer operations with complex numbers are usually performed by dealing with the real and imaginary parts separately and combining the two as a final operation. It might be an advantage in some problems to treat a complex number as a unit and to carry out all operations in this form.
openaire   +1 more source

Home - About - Disclaimer - Privacy