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.

Sai Dinesh Kancharana

dblp:378/6097 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
0000-0003-2451-4041ORCID · reported

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 · 77% Cellular and mobile networks · 23%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › MIMO
noncoherent communication
1.012026
Sparse Regression Codes for Non-Coherent SIMO Channels · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes
sparse regression codes
1.012026
Sparse Regression Codes for Non-Coherent SIMO Channels · IEEE Trans. Commun. 2026
Cellular and mobile networks
6g
0.312026
Sparse Regression Codes for Non-Coherent SIMO Channels · IEEE Trans. Commun. 2026

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

maximum likelihood · 2.0matching pursuit · 2.0approximate message passing · 2.0
YearPublicationVenuePosition
2026 Sparse Regression Codes for Non-Coherent SIMO Channels
abstract
Motivated by hyper-reliable low-latency communication in 6G, we consider error control coding for short block lengths in multi-antenna SIMO flat-fading channels. In general, the channel fading coefficients are unknown at both the transmitter and receiver, which is referred to as a non-coherent channel. Conventionally, pilot symbols are transmitted to facilitate channel estimation, causing power and bandwidth overhead. Our paper considers sparse regression codes (SPARCs) for non-coherent flat-fading channels without using pilots. We develop a novel greedy decoder for SPARC using maximum likelihood (ML) principles, referred to as maximum likelihood matching pursuit (MLMP). MLMP works based on successive combining principles as opposed to conventional greedy algorithms, which are based on successive cancellation. We also obtain the noiseless perfect recovery condition for our successive combining algorithm. We further introduce an enhanced version named parallel-MLMP (P-MLMP) to improve performance by mitigating error propagation in greedy methods. In addition, we develop an approximate message passing (AMP) SPARC decoder for the non-coherent SIMO flat-fading model. Using simulation studies, we show that the MLMP decoder for SPARC outperforms AMP and other greedy decoders. Also, SPARC with P-MLMP decoder outperforms polar codes employing pilot-based channel estimation and polar codes with non-coherent decoders.
Sai Dinesh Kancharana, Madhusudan Kumar Sinha, Arun Pachai Kannu
IEEE Trans. Commun.1