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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yong Li 0040

dblp:93/2334-40 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0001-5180-0719ORCID · conflict

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

Computer networks · 1 · 1 first-authorTheory of computation · 1

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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › network information theory › relay channel
bi-directional relaying
0.412019
Capacity of the Gaussian Two-Pair Two-Way Relay Channel to Within ½ Bit · IEEE Trans. Inf. Theory 2019
Information theory › channel capacity › capacity analysis
capacity approximation
0.412019
Capacity of the Gaussian Two-Pair Two-Way Relay Channel to Within ½ Bit · IEEE Trans. Inf. Theory 2019
Information theory
channel capacity
0.412019
Capacity of the Gaussian Two-Pair Two-Way Relay Channel to Within ½ Bit · IEEE Trans. Inf. Theory 2019
Information theory › network information theory
relay channel
0.412019
Capacity of the Gaussian Two-Pair Two-Way Relay Channel to Within ½ Bit · IEEE Trans. Inf. Theory 2019

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

superposition coding · 0.4network-coded decoding · 0.4nested lattice coding · 0.4
YearPublicationVenuePosition
2019 Capacity of the Gaussian Two-Pair Two-Way Relay Channel to Within ½ Bit
abstract
This paper studies the transceiver design of the Gaussian two-pair two-way relay channel (TWRC), where two pairs of users exchange information through a common relay in a pairwise manner. Our main contribution is to show that the capacity of the Gaussian two-pair TWRC is achievable to within$\frac{1}{ 2}$bit for arbitrary channel conditions. For the outer bound, we derive a genie-aided bound of the Gaussian two-pair TWRC, which is tighter than the cut-set bound. For the inner bound, we develop a hybrid coding scheme involving Gaussian random coding, nested lattice coding, superposition coding, and network-coded decoding. We further present a message-reassembling strategy to decouple the coding design for the user-to-relay and relay-to-user links, so as to provide flexibility to fully exploit the channel randomness. We show that judicious power allocation at the users and at the relay is necessary to approach the channel capacity under various channel conditions.
Xiaojun Yuan 0002, Haiyang Xin, Soung Chang Liew, Yong Li 0040
IEEE Trans. Inf. Theory4
2017 Capacity Analysis for the Gaussian Two-Pair Two-Way Relay Channel
abstract
This paper studies the transceiver design of the Gaussian two-pair two-way relay channel (TWRC), where two pairs of users exchange information through a common relay in a pairwise manner. Our main contribution is to show that our scheme can achieve the capacity of the two-pair TWRC to within 1/2 bit per user. In the proof, we develop a hybrid coding scheme involving Gaussian random coding, nested lattice coding, superposition coding, and network-coded decoding. Further, we present a message-reassembling strategy to decouple the coding design for the user-to-relay and relay-to-user links, so as to provide more flexibility to fully exploit the channel randomness. We also show that judicious power allocation among the superimposed codeword components at the relay is needed to approach the channel capacity.
Yong Li 0040, Haiyang Xin, Soung Chang Liew, Xiaojun Yuan 0002
GLOBECOM1