Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

Binary logarithm

Known as: Logarithmus dualis, Log2, Logarithmus binaris 
In mathematics, the binary logarithm (log2 n) is the power to which the number 2 must be raised to obtain the value n. That is, for any real number x… 
Wikipedia

Related topics

Related topics

50 relations
AKS primality testAlgorithmAnalysis of algorithmsBinary entropy function
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Energy and Spectral Efficiency of Very Large Multiuser MIMO Systems
A multiplicity of autonomous terminals simultaneously transmits data streams to a compact array of antennas. The array uses… 
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2011
Highly Cited
2011
Hybrid Full-Duplex/Half-Duplex Relaying with Transmit Power Adaptation
Focusing on two-antenna infrastructure relays employed for coverage extension, we develop hybrid techniques that switch… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2008
Highly Cited
2008
Iterative Hard Thresholding for Compressed Sensing
  • figure 1
Highly Cited
2006
Highly Cited
2006
Local Graph Partitioning using PageRank Vectors
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on… 
Highly Cited
2000
Highly Cited
2000
Recursive PCA for adaptive process monitoring
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Review
1990
Review
1990
Fast Fourier transforms: a tutorial review and a state of the art
Highly Cited
1987
Highly Cited
1987
Speeding the Pollard and elliptic curve methods of factorization
Since 1974, several algorithms have been developed that attempt to factor a large number N by doing extensive computations module… 
  • table 1
  • table 2
Highly Cited
1973
Highly Cited
1973
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
An mth-order recurrence problem is defined as the computation of the series x<inf>1</inf>, x<inf>2</inf>, ..., X<inf>N</inf… 
  • figure 2
  • table I
  • figure 3
  • table II
  • figure 1
Highly Cited
1972
Highly Cited
1972
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum… 
  • figure 1
Highly Cited
1962
Highly Cited
1962
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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE