Tuanwei Tian

dblp:253/1757 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2026
0000-0002-4954-301XORCID · corroborated

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

Computer networks · 2 · 2 first-author · 2 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 · 67% Cellular and mobile networks · 33%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
integrated sensing and communication
1.012026
A Geometrically-Constrained Separable Multidimensional OMP for Joint Channel Estimation and Localization in RIS-Assisted ISAC System · IEEE Trans. Commun. 2026
Physical-layer communications › channel estimation
orthogonal matching pursuit
1.012026
A Geometrically-Constrained Separable Multidimensional OMP for Joint Channel Estimation and Localization in RIS-Assisted ISAC System · IEEE Trans. Commun. 2026
Physical-layer communications › signal processing for communications › signal recovery
sparse recovery
1.012026
A Geometrically-Constrained Separable Multidimensional OMP for Joint Channel Estimation and Localization in RIS-Assisted ISAC System · IEEE Trans. Commun. 2026

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

separable multidimensional OMP · 1.0maximum a posteriori estimation · 1.0geometric feasibility filtering · 1.0
YearPublicationVenuePosition
2026 A Geometrically-Constrained Separable Multidimensional OMP for Joint Channel Estimation and Localization in RIS-Assisted ISAC System
abstract
This paper investigates the joint channel estimation and localization problem for integrated sensing and communication (ISAC) systems assisted by a reconfigurable intelligent surface (RIS). The key technical challenges involve addressing the computational complexity of high-dimensional sparse recovery while effectively exploiting geometric relationships in parameter estimation. To begin with, we formulate the joint estimation problem as a geometrically-constrained sparse recovery task based on maximum a posteriori estimation principles, incorporating physical feasibility constraints. Then, we propose the geometrically-constrained separable multidimensional orthogonal matching pursuit (GSMOMP) algorithm, which iteratively executes three key procedures: (1) coarse candidate selection via separable projections to avoid high-dimensional tensor construction; (2) geometric feasibility filtering to eliminate physically implausible propagation paths; and (3) refined atom selection with joint parameter updates that concurrently optimize both channel estimates and location parameters. The convergence is ensured by analytically demonstrating the monotonic decrease of the residual error. Finally, numerical results verify the effectiveness of the proposed algorithm, which achieves substantial computational efficiency improvement compared to conventional MOMP while maintaining comparable localization and angular estimation accuracy.
Tuanwei Tian, Yujia Han, Xingwang Li 0001, Xianxiang Yu, Hao Deng 0001
IEEE Trans. Commun.1
2023 Hybrid/Reflective Beamforming for IRS-Assisted Dual-Function Radar-Communication System
abstract
This article investigates the joint design problem of the hybrid/reflective beamforming for the dual-function radar-communication (DRC) system with the help of an intelligent reflecting surface (IRS). The degrees of freedom for beamformer design are the analog and digital beamformers (DBF) at the base station (BS), and the reflective beamformer (RBF) at the IRS. To begin with, we formulate the beamformer design problem as a weighted sum-rate (WSR) maximization problem subject to the transmit power and similarity between the designed beamformer and the reference one with desired beampattern property. Then, utilizing equivalent reformulation of the preceding design problem, we conceive an alternating direction sequential programming (ADSP)-based algorithm that iteratively updates the following low-complexity subproblems: 1) DBF at the BS through the Powell–Hestenes–Rockafellar (PHR) method; 2) analog beamformer at the BS using the Riemannian conjugate gradient method; and 3) RBF at the IRS by the successive convex approximation (SCA) technique. The convergence is ensured by analytically offering the nondecreasing and boundary of the WSR value. Finally, numerical results verify the effectiveness of the proposed algorithm, which achieves superior WSR performance while ensuring the radar requirement.
Tuanwei Tian, Hao Deng 0001, Guchong Li, Jianhua Lu
IEEE Internet Things J.1
2023 Active-Passive Beamforming With Imperfect CSI for IRS-Assisted Sensing System
abstract
For the intelligent reflecting surface (IRS) assisted sensing system, this letter investigates the joint design problem of active and passive beamforming with imperfect channel state information (CSI). To begin with, the beamformer design problem is formulated as a stochastic optimization problem with inner-layer variable (active beamforming vector) and outer-layer variable (passive phase-shift matrix), subject to the available transmit power and constant modulus constraints. Then, utilizing equivalent reformulation of the preceding design problem, we conceive a stochastic successive inner-outer programming (SSIOP) algorithm that updates the inner-layer and outer-layer variables in sequence and returns the corresponding closed-form solutions. Finally, numerical results assess the dependability of the SSIOP algorithm under an imperfect CSI scenario.
Tuanwei Tian, Hao Deng 0001, Guchong Li, Rui Ma 0017
IEEE Signal Process. Lett.1