Demo Data from EDBT 2026 / reviewers in the wild / expert
Qiao Su
dblp:194/8038
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2022
0000-0002-7583-9922ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021
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 · 70% Routing and switching · 30% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Routing and switching › packet forwarding › forwarding protocol
amplify-and-forward relaying |
0.6 | 1 | 2022 | Transceiver Optimization for Two-Hop AF MIMO Relay Systems With DFE Receiver and Direct Link · IEEE Trans. Commun. 2022 |
Physical-layer communications › relaying › relay systems
MIMO relay systems |
0.6 | 1 | 2022 | Transceiver Optimization for Two-Hop AF MIMO Relay Systems With DFE Receiver and Direct Link · IEEE Trans. Commun. 2022 |
Physical-layer communications › signal processing for communications › transceiver design
transceiver optimization |
0.6 | 1 | 2022 | Transceiver Optimization for Two-Hop AF MIMO Relay Systems With DFE Receiver and Direct Link · IEEE Trans. Commun. 2022 |
Physical-layer communications › equalization
decision feedback equalization |
0.2 | 1 | 2022 | Transceiver Optimization for Two-Hop AF MIMO Relay Systems With DFE Receiver and Direct Link · IEEE Trans. Commun. 2022 |
Methods — techniques the papers use, named apart from their topics
subproblem decomposition · 0.6iterative optimization · 0.6MMSE criterion · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Underdetermined Blind Direction-of-Arrival Estimation Using a Moving PlatformabstractUnderdetermined blind DOA estimation for linear arrays without the prior knowledge of array configuration is a challenging problem. Two methods are proposed to solve this problem based on a moving platform. The first one exploits the structure of the equivalent array manifold matrix constructed by using several different time intervals for the array motions and utilizes iterative optimization to obtain the estimation of DOAs. By considering secondary time intervals for the array motions further, the other combines the DOA matrix and multistage Wiener filter (MSWF) to estimate DOAs in a more cost-effective way. Simulation results and complexity analysis testify the effectiveness and superiority of the proposed algorithms. Qiao Su, Xiongwei Zhang, Nan Sha, Kui Xu 0001 |
IEEE Signal Process. Lett. | 1 |
| 2022 | Transceiver Optimization for Two-Hop AF MIMO Relay Systems With DFE Receiver and Direct LinkabstractIn this paper, we consider precoding and receiving matrices optimization for a two-hop amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay system with a decision feedback equalizer (DFE) at the destination node in the presence of the direct source-destination link. By adopting the minimum mean-squared error (MMSE) criterion, we develop two new transceiver design algorithms for such a system. The first one employs an iterative procedure to design the source, relay, feed-forward, and feedback matrices. The second algorithm is a non-iterative suboptimal approach which decomposes the optimization problem into two tractable subproblems and obtains the source and relay precoding matrices by solving the two subproblems sequentially. Simulation results validate the better MSE and bit-error-rate (BER) performance of the proposed algorithms and show that the non-iterative suboptimal method has a negligible performance loss when the ratio of the source node transmission power to the relay node transmission power is small. In addition, the computational complexity analysis suggests that the second algorithm and one iteration of the first algorithm have the same order of complexity. As the first algorithm typically converges within a few iterations, both proposed algorithms exhibit a low complexity order. Qiao Su, Yue Rong |
IEEE Trans. Commun. | 1 |