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

Tingzhi Qiu

dblp:420/8461 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Computer networks · 1 · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel estimation
0.912025
Triple IRS-Aided Communications: Row-Column Sparsity Enhanced Bayesian Tensor Learning for Channel Estimation · IEEE Trans. Commun. 2025
Physical-layer communications › channel estimation
RIS-assisted channel estimation
0.912025
Triple IRS-Aided Communications: Row-Column Sparsity Enhanced Bayesian Tensor Learning for Channel Estimation · IEEE Trans. Commun. 2025
Physical-layer communications › channel estimation
sparse channel estimation
0.912025
Triple IRS-Aided Communications: Row-Column Sparsity Enhanced Bayesian Tensor Learning for Channel Estimation · IEEE Trans. Commun. 2025

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

sparse matrix recovery · 0.9random matrix prior · 0.9bayesian tensor inference · 0.9
YearPublicationVenuePosition
2025 Triple IRS-Aided Communications: Row-Column Sparsity Enhanced Bayesian Tensor Learning for Channel Estimation
abstract
Channel acquisition presents a major challenge in deploying intelligent reflecting surfaces (IRS) aided communication systems, due to massive reflective elements that create a complex multi-path channel and increase channel dimensions. For an IRS-aided communication system, complete channel includes three parts: From the users to IRS, from the IRS to BS, and from the BS back to the IRS. Thus, a generalized multi-IRS cascaded communication system with three cascaded IRSs is considered. Unfortunately, existing channel estimation methods focus on single or double IRS cascades, which is not applicable to the case of triple cascaded IRS channel estimation directly. In this paper, we study the uplink channel estimation for triple cascaded IRSs aided single-user single-input single-output (SISO) systems. Specifically, the triple IRS cascaded channel is typically sparse. It permits us to characterize the channel estimation as a problem of sparse matrix recovery. Then, the sparse learning is explored to achieve robust channel estimation with limited training overhead. Particularly, the sparse channel matrices of the cascaded triple IRS channels have a common row-column block sparsity structure. However, a unique challenge lies in characterizing and enhancing such a common row-column sparsity. To tackle this issue, we apply a random matrix prior to promote the common row-column-wise sparsity of the channel matrix, and then an efficient Bayesian tensor inference algorithm is proposed to estimate the IRS channel. Finally, simulation results confirm that the proposed scheme outperforms traditional counterparts in terms of accuracy.
Limei Hu, Xiaodan Shao, Tingzhi Qiu, Feng Chen 0023, Lei Cheng 0003, Qingqing Wu 0001
IEEE Trans. Commun.3