EDBT 2026 Demo / reviewers in the wild / expert
Nathan Levy
dblp:62/2676
· DBLP profile ↗
7ranked-venue papers
6as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 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
5 papers |
Information theory · 93% Coding theory · 7% | |
| Computer networks
3 papers |
Cellular and mobile networks · 62% Physical-layer communications · 38% |
Topics — the 12 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory
network information theory |
0.4 | 4 | 2010 | On Information Rates of the Fading Wyner Cellular Model via the Thouless Formula for the Strip · IEEE Trans. Inf. Theory 2010 Information theoretic aspects of users' activity in a Wyner-like cellular model · IEEE Trans. Inf. Theory 2010 On Certain Large Random Hermitian Jacobi Matrices With Applications to Wireless Communications · IEEE Trans. Inf. Theory 2009 |
Cellular and mobile networks › mobile networks › mobile network architecture
cellular network architecture |
0.2 | 2 | 2010 | Information theoretic aspects of users' activity in a Wyner-like cellular model · IEEE Trans. Inf. Theory 2010 Clustered local decoding for Wyner-type cellular models · IEEE Trans. Inf. Theory 2009 |
Information theory › network information theory › multiuser capacity
sum-rate capacity |
0.2 | 2 | 2010 | On Information Rates of the Fading Wyner Cellular Model via the Thouless Formula for the Strip · IEEE Trans. Inf. Theory 2010 On Certain Large Random Hermitian Jacobi Matrices With Applications to Wireless Communications · IEEE Trans. Inf. Theory 2009 |
Information theory
channel capacity |
0.2 | 1 | 2014 | Cognitive Wyner Networks With Clustered Decoding · IEEE Trans. Inf. Theory 2014 |
Information theory › network information theory
interference network |
0.2 | 1 | 2014 | Cognitive Wyner Networks With Clustered Decoding · IEEE Trans. Inf. Theory 2014 |
Information theory › channel capacity › high-SNR analysis
multiplexing gain |
0.2 | 1 | 2014 | Cognitive Wyner Networks With Clustered Decoding · IEEE Trans. Inf. Theory 2014 |
Cellular and mobile networks
uplink transmission |
0.1 | 1 | 2010 | Information theoretic aspects of users' activity in a Wyner-like cellular model · IEEE Trans. Inf. Theory 2010 |
Coding theory › error-correcting codes › locally decodable codes
local decoding |
0.1 | 1 | 2010 | Information theoretic aspects of users' activity in a Wyner-like cellular model · IEEE Trans. Inf. Theory 2010 |
Information theory › probability theory
random matrix theory |
0.1 | 1 | 2010 | On Information Rates of the Fading Wyner Cellular Model via the Thouless Formula for the Strip · IEEE Trans. Inf. Theory 2010 |
Physical-layer communications
MIMO |
0.1 | 1 | 2009 | On Certain Large Random Hermitian Jacobi Matrices With Applications to Wireless Communications · IEEE Trans. Inf. Theory 2009 |
Physical-layer communications
random matrix theory |
0.1 | 1 | 2009 | On Certain Large Random Hermitian Jacobi Matrices With Applications to Wireless Communications · IEEE Trans. Inf. Theory 2009 |
Information theory › network information theory
interference channel |
0.1 | 1 | 2009 | Clustered local decoding for Wyner-type cellular models · IEEE Trans. Inf. Theory 2009 |
Methods — techniques the papers use, named apart from their topics
genie-aided bounds · 0.4achievable rate bounds · 0.2lyapunov exponent · 0.2rate splitting · 0.2random matrix theory · 0.2thouless formula · 0.1random schrödinger operator theory · 0.1lyapunov exponents · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Cognitive Wyner Networks With Clustered DecodingabstractWe study an interference network where equally numbered transmitters and receivers lie on two parallel lines, with each transmitter opposite its intended receiver. We consider two short-range interference models: the asymmetric network, where the signal sent by each transmitter is interfered only by the signal sent by its left neighbor (if present), and a symmetric network, where it is interfered by both its left and its right neighbors. Each transmitter is cognizant of its own message, the messages of the tℓtransmitters to its left, and the messages of the trtransmitters to its right. Each receiver decodes its message based on the signals received at its own antenna, at the rrreceive antennas to its left, and at the rrreceive antennas to its right. For such networks, we provide upper and lower bounds on the multiplexing gain, i.e., on the high signal-to-noise ratio asymptotic logarithmic growth of the sum-rate capacity. In some cases, our bounds coincide, e.g., for the asymmetric network. Our results exhibit an equivalence between the transmitter sideinformation parameters tℓ, tr and the receiver side-information parameters rℓ, rrin the sense that increasing/decreasing tℓor trby a positive integer δ has the same effect on the multiplexing gain as increasing/decreasing rℓor rrby δ. Moreover-even in asymmetric networks-there is an equivalence between the left side-information parameters (tℓ, rℓ) and the right sideinformation parameters (tr, rr). Amos Lapidoth, Nathan Levy, Shlomo Shamai, Michèle Wigger |
IEEE Trans. Inf. Theory | 2 |
| 2010 | Information theoretic aspects of users' activity in a Wyner-like cellular modelabstractWe address an application of multiuser information theory to the study of the uplink of a communication system with randomly activated users. We first assume that all the messages are jointly decoded by a multicell processor. Then, we relax this hypothesis and study the network under the assumption that the decoding of the message of a given user is only based on the messages received within a given distance of this user. Our results show that for a general class of models, under adequate hypothesis, local decoding performs almost as well as global decoding and that the difference converges to 0 exponentially fast as the size of the decoding window goes to infinity. Nathan Levy, Shlomo Shamai |
IEEE Trans. Inf. Theory | 1 |
| 2010 | On Information Rates of the Fading Wyner Cellular Model via the Thouless Formula for the StripabstractIn this paper, we apply the theory of random Schrödinger operators to the analysis of multiusers communication channels similar to the Wyner model, which are characterized by short-range intercell interference. WithHthe channel transfer matrix,HHfis a narrow band matrix, a fact that does not permit the use of classical random matrices theory. On the other hand,HHfis in many aspects similar to a random Schrödinger operator. We relate the per-cell sum-rate capacity of the channel to the integrated density of states of a random Schrödinger operator; the latter is then related to the top Lyapunov exponent of a random sequence of matrices via a version of the Thouless formula. We also derive several bounds on the limiting per-cell sum-rate capacity, some based on the theory of random Schrödinger operators, and some derived from information theoretical considerations. Finally, we get explicit results in the high-signal-to-noise ratio (SNR) regime for some particular cases. Nathan Levy, Ofer Zeitouni, Shlomo Shamai |
IEEE Trans. Inf. Theory | 1 |
| 2009 | A cognitive network with clustered decodingabstractWe study the uplink of a linear cellular model featuring short range inter-cell interference. Specifically, we consider a K-transmitter/K-receiver interference network where the signal transmitted by a given transmitter is interfered by the signal sent by the transmitter to its left. We assume that each transmitter has side-information consisting of the messages of the Jlusers to its left and the Jrusers to its right, and that each receiver can decode its message using the signals received at its own antenna, at the ilantennas to its left, and at the irantennas to its right. For this setting, we characterize the multiplexing gain, i.e., the asymptotic logarithmic growth of the sum-rate capacity at high SNR, and point out interesting duality aspects. We also present results on the multiplexing gain of a symmetric version of this network where the signal sent by a given transmitter is interfered by the signals sent by the transmitter to its left and the transmitter to its right. Nathan Levy, Shlomo Shamai, Michèle Wigger, Amos Lapidoth |
ISIT | 1 |
| 2009 | Clustered local decoding for Wyner-type cellular modelsabstractWe study the uplink of Wyner-type cellular models featuring short range inter-cell interference. We assume that the decoding of the message sent by a given transmitter is done locally, that is using only the signals received at the antennas in its vicinity. We derive upper and lower bounds on the achievable rate for a two-dimensional model and for a one-dimensional model with an attenuation parameter. The analysis of our cellular models will rely on rate splitting and genie-aided bounds, originally employed in the framework of the interference channel. Nathan Levy, Shlomo Shamai |
IEEE Trans. Inf. Theory | 1 |
| 2009 | On Certain Large Random Hermitian Jacobi Matrices With Applications to Wireless CommunicationsabstractIn this paper we study the spectrum of certain large random HermitianJacobimatrices. These matrices are known to describe certain communication setups. In particular, we are interested in an uplink cellular channel which models mobile users experiencing a soft-handoff situation under joint multicell decoding. Considering rather general fading statistics we provide a closed-form expression for the per-cell sum-rate of this channel in high signal-to-noise ratio (SNR), when an intra-cell time-division multiple-access (TDMA) protocol is employed. Since the matrices of interest aretridiagonal, their eigenvectors can be considered as sequences with second-order linear recurrence. Therefore, the problem is reduced to the study of the exponential growth of products of two-by-two matrices. For the case whereKusers are simultaneously active in each cell, we obtain a series of lower and upper bound on the high-SNR power offset of the per-cell sum-rate, which are considerably tighter than previously known bounds. Nathan Levy, Oren Somekh, Shlomo Shamai, Ofer Zeitouni |
IEEE Trans. Inf. Theory | 1 |
| 2008 | On certain large random Hermitian Jacobi matrices with applications to wireless communicationsabstractIn this paper we study the spectrum of certain large random Hermitian Jacobi matrices. These matrices are known to describe certain communication setups. In particular we are interested in an uplink cellular channel which models mobile users experiencing a soft-handoff situation under joint multicell decoding. Considering rather general fading statistics we provide a closed form expression for the per-cell sum-rate of this channel in high-SNR, when an intra-cell TDMA protocol is employed. Since the matrices of interest are tridiagonal, their eigenvectors can be considered as sequences with second order linear recurrence. Therefore, the problem is reduced to the study of the exponential growth of products of two by two matrices. For the case where K users are simultaneously active in each cell, we obtain a series of lower and upper bounds on the high-SNR power offset of the per-cell sum-rate, which are considerably tighter than previously known bounds. Nathan Levy, Oren Somekh, Shlomo Shamai, Ofer Zeitouni |
ISIT | 1 |