EDBT 2026 Demo / reviewers in the wild / expert
Haishi Ning
dblp:12/7881
· DBLP profile ↗
4ranked-venue papers
4as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-authorComputer networks · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
2 papers |
Information theory · 100% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › network information theory › relay channel
amplify-and-forward relaying |
0.1 | 1 | 2011 | Generalized Sequential Slotted Amplify and Forward Strategy in Cooperative Communications · IEEE Trans. Inf. Theory 2011 |
Information theory › network information theory
cooperative communication |
0.1 | 1 | 2011 | Generalized Sequential Slotted Amplify and Forward Strategy in Cooperative Communications · IEEE Trans. Inf. Theory 2011 |
Information theory
diversity gain |
0.1 | 1 | 2011 | Feasibility Condition for Interference Alignment With Diversity · IEEE Trans. Inf. Theory 2011 |
Information theory › communication channels › MIMO › MIMO channel
diversity-multiplexing tradeoff |
0.1 | 1 | 2011 | Generalized Sequential Slotted Amplify and Forward Strategy in Cooperative Communications · IEEE Trans. Inf. Theory 2011 |
Information theory › network information theory › interference channel
interference alignment |
0.1 | 1 | 2011 | Feasibility Condition for Interference Alignment With Diversity · IEEE Trans. Inf. Theory 2011 |
Information theory › network information theory
interference channel |
0.1 | 1 | 2011 | Feasibility Condition for Interference Alignment With Diversity · IEEE Trans. Inf. Theory 2011 |
Information theory › network information theory › multiple-access channel
cooperative multiple access channel |
0.0 | 1 | 2011 | Generalized Sequential Slotted Amplify and Forward Strategy in Cooperative Communications · IEEE Trans. Inf. Theory 2011 |
Information theory › communication channels › MIMO
MIMO channel |
0.0 | 1 | 2011 | Feasibility Condition for Interference Alignment With Diversity · IEEE Trans. Inf. Theory 2011 |
Information theory › channel capacity › high-SNR analysis
multiplexing gain |
0.0 | 1 | 2011 | Feasibility Condition for Interference Alignment With Diversity · IEEE Trans. Inf. Theory 2011 |
Methods — techniques the papers use, named apart from their topics
interference alignment precoding · 0.1diversity-multiplexing tradeoff analysis · 0.1diversity analysis · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Generalized Sequential Slotted Amplify and Forward Strategy in Cooperative CommunicationsabstractThis paper proposes a generalized sequential slotted amplify and forward (GSSAF) strategy for single-antenna wireless cooperative networks. The diversity and multiplexing tradeoff (DMT) is analyzed. Applications to cooperative multiple relay channels, cooperative broadcast channels (CBC) and cooperative multiple access channels are considered and the DMT upper bound is proven to be achievable for each case. Other than proposing the best known near-optimal strategy for CBC, another important contribution is to show that GSSAF can be used as a unified strategy to achieve DMT optimality in wireless cooperative networks with unit multiplexing gains. Haishi Ning, Cong Ling 0001, Kin K. Leung |
IEEE Trans. Inf. Theory | 1 |
| 2011 | Feasibility Condition for Interference Alignment With DiversityabstractThis paper studies the diversity benefit of different interference alignment solutions. While most research about interference alignment was aiming at deriving or realizing the maximum achievable multiplexing gain, the symbol error rate performance, which can be characterized by the diversity gain is of equal importance. Different interference alignment solutions are classified into two categories called diversity interference alignment and zero-forcing interference alignment. Although these two types of solutions are not distinguishable in terms of the multiplexing gain, this paper will show their difference lies in the fact that they have different diversity gains. In this paper, a K-user (M × N) interference channel is used, with each user sending 1 degree of freedom of information by using interference alignment precoding and receiving filters but without space-time codes. The feasibility conditions for diversity interference alignment to be achieved are analyzed and the diversity orders different solutions can provide are compared. The results imply that diversity interference alignment solutions offer both multiplexing and diversity gains simultaneously. It also tells us two important rules about the interference alignment precoding filters design: an optimal design has to take both desired and interference channel matrices into consideration and the separation of interference alignment precoding filters design and space-time codes design may not be optimal in general. Haishi Ning, Cong Ling 0001, Kin K. Leung |
IEEE Trans. Inf. Theory | 1 |
| 2010 | Relay-aided interference alignment: Feasibility conditions and algorithmabstractConsider a (1 × 1, ½)Ksymmetric wireless interference network where K single-antenna user-pairs want to achieve ½ degrees of freedom each. It has been proved that it is almost surely infeasible to achieve interference alignment without symbol extension. While it was proved relays can not increase the degree of freedom of wireless interference networks, we show this does not preclude the usefulness of using relays to construct practical solutions to approach interference alignment with finite symbol extensions. Feasibility conditions for relay-aided interference alignment are analyzed and an example about how to design the relaying functions to approach interference alignment is given. Simulation results also justify the use of relays as a practical means to do interference alignment with finite symbol extensions. Haishi Ning, Cong Ling 0001, Kin K. Leung |
ISIT | 1 |
| 2009 | Near-Optimal Relaying Strategy for Cooperative Broadcast ChannelsabstractWe propose a near-optimal relaying strategy for cooperative broadcast channels (CBC), CBC-SSAF, based on the class of sequential slotted amplify and forward (SSAF) strategies. Our strategy allows each destination to act in turn as a relay and forward its previously received signal to other destinations. While CBC-SSAF is not a full multiplexing gain strategy, the loss is negligible when the number of destinations is large. Moreover, CBC-SSAF allows each destination to be protected by the maximum number of extra paths in order to achieve the near-optimal diversity gain in the high multiplexing gain regime. A diversity and multiplexing tradeoff (DMT) lower bound for CBC-SSAF is derived which suggests that our proposed relaying strategy approaches the multiple-input multiple-output (MIMO) DMT upper bound and is therefore asymptotically optimal. Haishi Ning, Cong Ling 0001, Kin K. Leung |
ICC | 1 |