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

Yi Wang 0050

dblp:17/221-50 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2019
—ORCID · conflict

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

Computer networks · 4 · 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.

Computer networks
2 papers
Physical-layer communications · 54% Internet architecture and protocols · 28% Cellular and mobile networks · 18%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
coordinated multipoint
0.412019
Physical Layer Network Coding in Network MIMO: A New Design for 5G and Beyond · IEEE Trans. Commun. 2019
Internet architecture and protocols
network coding
0.412019
Physical Layer Network Coding in Network MIMO: A New Design for 5G and Beyond · IEEE Trans. Commun. 2019
Physical-layer communications › MIMO › distributed MIMO
network MIMO
0.412019
Physical Layer Network Coding in Network MIMO: A New Design for 5G and Beyond · IEEE Trans. Commun. 2019
Internet architecture and protocols › network coding
physical-layer network coding
0.412019
Physical Layer Network Coding in Network MIMO: A New Design for 5G and Beyond · IEEE Trans. Commun. 2019
Physical-layer communications
channel coding
0.212015
Code Design for Iterative Decoding of Multilevel Codes · IEEE Trans. Commun. 2015
Physical-layer communications › modulation
coded modulation
0.212015
Code Design for Iterative Decoding of Multilevel Codes · IEEE Trans. Commun. 2015
Physical-layer communications › channel coding › decoding algorithms › iterative decoding
EXIT chart analysis
0.212015
Code Design for Iterative Decoding of Multilevel Codes · IEEE Trans. Commun. 2015
Physical-layer communications › channel coding › decoding algorithms
iterative decoding
0.212015
Code Design for Iterative Decoding of Multilevel Codes · IEEE Trans. Commun. 2015
Physical-layer communications › modulation › coded modulation
multilevel coded modulation
0.212015
Code Design for Iterative Decoding of Multilevel Codes · IEEE Trans. Commun. 2015
Cellular and mobile networks
radio access networks
0.112019
Physical Layer Network Coding in Network MIMO: A New Design for 5G and Beyond · IEEE Trans. Commun. 2019

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

two-stage search algorithm · 0.4QAM modulation · 0.4curve fitting · 0.2EXIT function analysis · 0.2
YearPublicationVenuePosition
2019 Physical Layer Network Coding in Network MIMO: A New Design for 5G and Beyond
abstract
Physical layer network coding (PNC) has been studied to serve wireless network MIMO systems with much lower backhaul load than approaches such as Cloud Radio Access Network (Cloud-RAN) and coordinated multipoint (CoMP). In this paper, we present a design guideline of engineering applicable PNC to fulfil the request of high user densities in 5G wireless RAN infrastructure. We show that the proposed design criteria guarantee that: 1) the whole system operates over binary system; 2) the PNC functions utilized at each access point overcome all singular fade states; and 3) the destination can unambiguously recover all source messages, while the overall backhaul load remains at the lowest level. We then develop a two-stage search algorithm to identify the optimum PNC mapping functions which greatly reduces the real-time computational complexity. The impact of estimated channel information and reduced number of singular fade states in different QAM modulation schemes are studied in this paper. Numerical results show that the proposed schemes achieve low outage probability with reduced backhaul load.
Tong Peng, Yi Wang 0050, Alister Burr, Mohammad Shikh-Bahaei
IEEE Trans. Commun.2
2018 A Physical Layer Network Coding Design for 5G Network MIMO
abstract
This paper presents a physical layer network coding (PNC) approach for network MIMO (N-MIMO) systems to release the heavy burden of backhaul load. The proposed PNC approach is applied for uplink scenario in binary systems, and the design guideline serves multiple mobile terminals (MTs) and guarantees unambiguous recovery of the message from each MT. We present a novel PNC design criterion first based on binary matrix theories, followed by an adaptive optimal mapping selection algorithm based on the proposed design criterion. In order to reduce the real-time computational complexity, a two-stage search algorithm for the optimal binary PNC mapping matrix is developed. Numerical results show that the proposed scheme achieves lower outage probability with reduced backhaul load compared to practical CoMP schemes which quantize the estimated symbols from a log-likelihood ratio (LLR) based multiuser detector into binary bits at each access point(AP).
Tong Peng, Yi Wang 0050, Alister Burr, Mohammad Shikh-Bahaei
GLOBECOM2
2015 Complex Low Density Lattice Codes to Physical Layer Network Coding
abstract
In this paper we present a physical-layer network coding (PNC) scheme based on the recently developed complex low density lattice codes (CLDLC). CLDLC has high coding gain, good algebraic properties, and better coding gain at low dimension than real LDLC, which make it a good candidate for PNC. We show a parametric decoder for CLDLC, and demonstrate, via simulation that CLDLC-based PNC achieves good performance in a two way relay channel.
Yi Wang 0050, Alister Burr
ICC1
2015 Code Design for Iterative Decoding of Multilevel Codes
abstract
The code design problem for multilevel coded modulation with iterative decoding (MLCM-ID) has been left unsolved over a decade. In this paper, we define the code design criterion for MLCM-ID based on a novel concept-parametrically-mapped EXIT (PM-EXIT) function. We derive the EXIT functions for MLCM-ID, and present the mathematical work by which the three area theorems of PM-EXIT function are proved. This gives theoretical support of the curve-fitting techniques used in MLCM-ID, and also provides firm proof that the PM-EXIT function design rule allows in principle capacity-achieving code assignment. The simulation results perfectly match the theoretical analysis, and also confirm that the design rule proposed fully exploits the flexibility of MLCM-ID in the choice of codes. Both in theory and simulations, our code design is verified.
Yi Wang 0050, Alister Burr
IEEE Trans. Commun.1