Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Evgeny Levitan

dblp:24/2587 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Information theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory
hypothesis testing
0.012002
A competitive Neyman-Pearson approach to universal hypothesis testing with applications · IEEE Trans. Inf. Theory 2002
Information theory › hypothesis testing › binary hypothesis testing
neyman-pearson detection
0.012002
A competitive Neyman-Pearson approach to universal hypothesis testing with applications · IEEE Trans. Inf. Theory 2002
Information theory › hypothesis testing › nonparametric testing
universal hypothesis testing
0.012002
A competitive Neyman-Pearson approach to universal hypothesis testing with applications · IEEE Trans. Inf. Theory 2002

Methods — techniques the papers use, named apart from their topics

kullback-leibler divergence · 0.0generalized likelihood ratio test · 0.0
YearPublicationVenuePosition
2006 ASIC Implementation of Beamforming and SDMA for WiFi Metropolitan-Area Deployment
abstract
This paper presents an ASIC hardware architecture of a multi-antenna access point (AP), compliant with 802.11a/b/g standard and designed for outdoor metropolitan-area deployment. The AP has a six-antenna array and its PHY layer implements single-user maximum ratio combining (MRC) and transmit beamforming (BF), as well as downlink multi-user fourfold spatial division multiple-access (SDMA). The clients use standard WiFi 802.11a/b/g networks interface cards (NICs).
Ruby Tweg, Ruvi Alpert, Hanan Leizerovich, Avi Steiner, Evgeny Levitan, Einat Offir-Arad, Alex Bar Guy, Ben Zickel, Aviv Aviram, Amit Frieman, Mati Wax
GLOBECOM5
2002 A competitive Neyman-Pearson approach to universal hypothesis testing with applications
abstract
The problem of hypothesis testing for parametric information sources whose parameters are not explicitly known is considered. A new, modified version of the Neyman-Pearson criterion of optimality, where the uniform constraint on exponential rate of the false-alarm probability is replaced by one that depends on unknown values of the parameters, is proposed. An optimal universal decision rule, based on Kullback-Leibler divergence, is developed and shown to be efficient in the sense of achieving exponential decay of both misdetection and false-alarm probabilities for all values of unknown parameters, whenever such an efficient decision rule exists at all. Furthermore, necessary and sufficient conditions for the existence of such efficient universal tests are established and the best universally achievable error exponents are presented. Finally, the proposed approach is applied to several important problems in signal processing and communications and compared to the generalized likelihood ratio test (LRT).
Evgeny Levitan, Neri Merhav
IEEE Trans. Inf. Theory1