Skip to search formSkip to main contentSkip to account menu

Binary number

Known as: Generalized binary number, 011000100110100101101110011000010111001001111001, Binary expansion 
□ In mathematics and digital electronics, a binary number is a number expressed in the binary numeral system or base-2 numeral system which… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
32-bitAbstract data typeAdder (electronics)Ancient Egyptian multiplication

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications
The main contribution of this paper is an exact common subexpression elimination algorithm for the optimum sharing of partial… 
Review
2003
Review
2003
Detection of Nine M8.0-L0.5 Binaries: The Very Low Mass Binary Population and Its Implications for Brown Dwarf and Very Low Mass Star Formation
Use of the highly sensitive Hokupa'a/Gemini curvature wave front sensor has allowed direct adaptive optics (AO) guiding on very… 
Highly Cited
1999
Highly Cited
1999
Some Notes on Steganography
. This essay presents some observations concerning low rate steganography in images where the amount of covert information is… 
Highly Cited
1998
Highly Cited
1998
Compatible genericity with run-time types for the Java programming language
The most serious impediment to writing substantial programs in the Java™ programming language is the lack of a gentricity… 
Highly Cited
1987
Highly Cited
1987
A high-speed multiplier using a redundant binary adder tree
A 16-bit /spl times/ 16-bit multiplier for 2 two's-complement binary numbers based on a new algorithm is described. This… 
Highly Cited
1985
Highly Cited
1985
Rationality and uncertainty
There are, it can be argued, two dominant approaches to rational choice extensively used in decision theory and economics: (1… 
Highly Cited
1980
Highly Cited
1980
The chip complexity of binary arithmetic
The chip complexity of a computation is concerned with the chip area, A, and the time, T, required to perform the computation… 
Highly Cited
1972
Highly Cited
1972
Automatic computation of exponentials, logarithms, ratios and square roots
It is shown how a relatively simple device can evaluate exponentials, logarithms, ratios and square roots for fraction arguments… 
Highly Cited
1969
Highly Cited
1969
Algorithm 358: singular value decomposition of a complex matrix [F1, 4, 5]
p r o c e d u r e Ising (n, x, t, S); i n t e g e r n, x, l; i n t e g e r array S; c o m m e n t Ising generates n-sequences ($1… 
Highly Cited
1968
Highly Cited
1968
An approach to the implementation of digital filters
An approach to the implementation of digital filters is presented that employs a small set of relatively simple digital circuits… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)