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

Agrim Agarwal

dblp:360/4442 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0003-4003-5841ORCID · corroborated

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

Computer networks · 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 · 92% Wireless networking · 8%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel estimation
0.912025
Sparse Channel Estimation in IRS-Assisted Massive MIMO Cognitive Radio Systems · IEEE Trans. Commun. 2025
Physical-layer communications › MIMO
massive MIMO
0.912025
Sparse Channel Estimation in IRS-Assisted Massive MIMO Cognitive Radio Systems · IEEE Trans. Commun. 2025
Physical-layer communications › channel estimation
sparse channel estimation
0.912025
Sparse Channel Estimation in IRS-Assisted Massive MIMO Cognitive Radio Systems · IEEE Trans. Commun. 2025
Wireless networking
cognitive radio
0.312025
Sparse Channel Estimation in IRS-Assisted Massive MIMO Cognitive Radio Systems · IEEE Trans. Commun. 2025
Physical-layer communications
reconfigurable intelligent surface
0.312025
Sparse Channel Estimation in IRS-Assisted Massive MIMO Cognitive Radio Systems · IEEE Trans. Commun. 2025

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

orthogonal matching pursuit · 0.9compressed sensing · 0.9bayesian learning · 0.9
YearPublicationVenuePosition
2025 Sparse Channel Estimation in IRS-Assisted Massive MIMO Cognitive Radio Systems
abstract
This paper proposes novel Bayesian learning approaches for sparse channel estimation in a multi-user millimeter-wave massive multiple-input multiple-output underlay cognitive radio system. The intelligent reflecting surfaces (IRS)-aided secondary network adopts a two-phase transmission protocol comprising of silent and estimation phases. During the silent phase, the secondary base station(SBS) captures primary network pilot transmissions to estimate the cascaded channel between primary users and the SBS. Next, the estimation phase considers two pilot design policies with an inherent estimation accuracy and spectral efficiency trade-off, for cascaded channel estimation with respect to the secondary users, IRS, and SBS. Further, the associated hybrid and marginalized Cramér-Rao bounds are developed to benchmark the efficacy of proposed estimation schemes. Simulation results demonstrate the superior performance of the proposed approaches in comparison to existing compressed sensing methods such as orthogonal matching pursuit and subspace multi-user joint channel estimation.
Agrim Agarwal, Amrita Mishra, Ashirwad Ray, Priyanka Das 0001
IEEE Trans. Commun.1
2023 Sparse Bayesian Learning-based Channel Estimation for IRS-aided Millimeter Wave Massive MIMO Systems
abstract
Intelligent reflecting surface (IRS)-aided millimeter wave (mmWave) systems are potential contenders for large scale deployment in 5G and beyond communication. Owing to the passive nature of IRS systems, the acquisition of accurate channel state information in bandwidth constrained scenarios becomes a highly challenging task. This work leverages the inherent sparsity associated with cascaded channels of IRS mmWave systems to develop novel sparse Bayesian learning (SBL)-based channel estimation algorithms. The underlying row-wise temporal correlation of the effective angular domain sparse channel matrix is first theoretically demonstrated followed by the development of the temporal SBL channel estimation approach. Further, utilizing the scaling property of cascaded channels for multiple users, low complex variants of the proposed SBL solutions are developed. Simulation results demonstrate significant improvement of the proposed SBL schemes over existing techniques.
Agrim Agarwal, Amrita Mishra, Priyanka Das 0001
PIMRC1