Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,211,759 papers from all fields of science
Search
Sign In
Create Free Account
Binary logarithm
Known as:
Logarithmus dualis
, Log2
, Logarithmus binaris
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AKS primality test
Algorithm
Analysis of algorithms
Binary entropy function
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Energy-Efficient Frequency and Power Allocation for Cognitive Radios in Television Systems
K. Illanko
,
M. Naeem
,
A. Anpalagan
,
D. Androutsos
IEEE Systems Journal
2016
Corpus ID: 6730584
Energy-efficient resource allocation for cognitive radios operating in television systems (TV white spaces) presents a unique…
Expand
Highly Cited
2011
Highly Cited
2011
End-to-End Performance of Cooperative Relaying in Spectrum-Sharing Systems With Quality of Service Requirements
V. Asghari
,
S. Aïssa
IEEE Transactions on Vehicular Technology
2011
Corpus ID: 782060
We propose adopting a cooperative relaying technique in spectrum-sharing cognitive radio (CR) systems to more effectively and…
Expand
Highly Cited
2010
Highly Cited
2010
A verifiable multi-secret sharing scheme based on cellular automata
Ziba Eslami
,
Jamal Zarepour-Ahmadabadi
Information Sciences
2010
Corpus ID: 15408909
2009
2009
An Optimal Transmit Power Allocation for the Two-Way Relay Channel Using Physical-Layer Network Coding
Wonjae Shin
,
Namyoon Lee
,
Jong-Han Lim
,
Changyong Shin
IEEE International Conference on Communications…
2009
Corpus ID: 45296033
A two-way relaying system using the physical-layer network coding (PNC) does not cause the spectral loss induced by the half…
Expand
Highly Cited
2008
Highly Cited
2008
Joint Power and Channel Allocation for Cognitive Radios
F. Digham
IEEE Wireless Communications and Networking…
2008
Corpus ID: 17202060
Spectrum scarcity is the major challenge facing all parties working in the telecommunications industry. As recently shown, the…
Expand
1998
1998
Fast Algorithms for Complete Linkage Clustering
D. Krznaric
,
C. Levcopoulos
Discrete & Computational Geometry
1998
Corpus ID: 37651770
Abstract. It is shown that the complete linkage clustering of n points can be computed in O(n log2 n) time. Furthermore, it is…
Expand
Highly Cited
1989
Highly Cited
1989
Fault-Tolerant Routing in Multistage Interconnection Networks
A. Varma
,
C. Raghavendra
IEEE Trans. Computers
1989
Corpus ID: 9142941
The fault tolerance of multiprocessor systems with multistage interconnection networks under multiple faults in the network is…
Expand
1988
1988
Efficient Parallel Triconnectivity in Logarithmic Time
V. Ramachandran
,
U. Vishkin
Aegean Workshop on Computing
1988
Corpus ID: 43540432
We present two new techniques for trimming a logarithmic factor from the running time of efficient parallel algorithms for graph…
Expand
Review
1987
Review
1987
VLSI Architectures for Multidimensional Fourier Transform Processing
I. Gertner
,
Moshe Shamash
IEEE transactions on computers
1987
Corpus ID: 35165704
It is often desirable in modern signal processing applications to perform two-dimensional or three-dimensional Fourier transforms…
Expand
Highly Cited
1976
Highly Cited
1976
Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network
T. Lang
IEEE transactions on computers
1976
Corpus ID: 33840542
The shuffle-exchange network is considered as an interconnection network between processors and memory modules in an array…
Expand
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)
ACCEPT & CONTINUE