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

Xiaofeng Li 0003

dblp:49/6408-3 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2018
0000-0001-7195-9321ORCID · verified

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

Computer networks · 3 · 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
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel estimation
0.312018
Optimal Training for Residual Self-Interference for Full-Duplex One-Way Relays · IEEE Trans. Commun. 2018
Physical-layer communications › relaying › duplex relaying
full-duplex relaying
0.312018
Optimal Training for Residual Self-Interference for Full-Duplex One-Way Relays · IEEE Trans. Commun. 2018
Physical-layer communications › channel estimation
pilot design
0.312018
Optimal Training for Residual Self-Interference for Full-Duplex One-Way Relays · IEEE Trans. Commun. 2018
Physical-layer communications › cooperative communication
relay networks
0.312018
Optimal Training for Residual Self-Interference for Full-Duplex One-Way Relays · IEEE Trans. Commun. 2018
Physical-layer communications › full-duplex communication
residual self-interference
0.312018
Optimal Training for Residual Self-Interference for Full-Duplex One-Way Relays · IEEE Trans. Commun. 2018
Physical-layer communications › interference cancellation
self-interference cancellation
0.312018
Optimal Training for Residual Self-Interference for Full-Duplex One-Way Relays · IEEE Trans. Commun. 2018

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

maximum likelihood estimation · 0.3cramer-rao bound · 0.3broyden-fletcher-goldfarb-shanno · 0.3
YearPublicationVenuePosition
2018 Outage probability of multi-hop networks with amplify-and-forward full-duplex relaying
abstract
The authors consider a multi‐hop amplify‐and‐forward full‐duplex relay system. They take a signal flow graph approach for finding the input–output relationship using Mason's gain formula, and use this expression to compute the system outage probability for different equalisers. For sufficiently large target rates, full‐duplex relaying with equalisers has lower outage probability than half‐duplex relaying, despite the higher residual self‐interference (RSI) of the full‐duplex approach. The full‐duplex system with (unequalised) matched filter at the destination is seen to be sensitive to RSI which shows that equalisation at the destination is a feasible approach to combating the RSI for full‐duplex multi‐hop systems.
Abhilash Sureshbabu, Mohammad Samavat, Xiaofeng Li 0003, Cihan Tepedelenlioglu
IET Commun.3
2018 Optimal Training for Residual Self-Interference for Full-Duplex One-Way Relays
abstract
Channel estimation and optimal training sequence design for full-duplex one-way relays are investigated. We propose a training scheme to estimate the residual self-interference (RSI) channel and the channels between nodes simultaneously. A maximum likelihood estimator is implemented with the Broyden-Fletcher-Goldfarb-Shanno algorithm. In the presence of RSI, the overall source-to-destination channel becomes an inter-symbol-interference (ISI) channel. With the help of estimates of the RSI channel, the destination is able to cancel the ISI through equalization. We derive and analyze the Cramer-Rao bound (CRB) in closed-form by using the asymptotic properties of Toeplitz matrices. The optimal training sequence is obtained by minimizing the CRB. Extensions for the fundamental one-way relay model to the frequency-selective fading channels and the multiple relays case are also considered. For the former, we propose a training scheme to estimate the overall channel, and for the latter the CRB and the optimal number of relays are derived when the distance between the source and the destination is fixed. Simulations using LTE parameters corroborate our theoretical results.
Xiaofeng Li 0003, Cihan Tepedelenlioglu, Habib Senol
IEEE Trans. Commun.1
2017 Channel Estimation for Residual Self-Interference in Full-Duplex Amplify-and-Forward Two-Way Relays
abstract
Training schemes for full duplex two-way relays are investigated. We propose a novel one-block training scheme with a maximum likelihood estimator to estimate the channels between the nodes as well as the residual self-interference (RSI) channel simultaneously. A quasi-Newton algorithm is used to solve the estimator. As a baseline, a multi-block training scheme is also considered. The Cramer-Rao bounds of the one-block and multi-block training schemes are derived. By using the Szegö's theorem about Toeplitz matrices, we analyze how the channel parameters and transmit powers affect the Fisher information. We show analytically that exploiting the structure arising from the RSI channel increases its Fisher information. Numerical results show the benefits of estimating the RSI channel.
Xiaofeng Li 0003, Cihan Tepedelenlioglu, Habib Senol
IEEE Trans. Wirel. Commun.1