Sai Dinesh Kancharana

Sai Dinesh Kancharana

Auto-generated profile, based on publicly available information

Sai Dinesh Kancharana

Indian Institute of Technology Madras, Chennai, India

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 October 2025 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
SKSai Dinesh Kancharana
Sai Dinesh Kancharana
MSMadhusudan Kumar Sinha
Madhusudan Kumar Sinha
AKArun Pachai Kannu
Arun Pachai Kannu
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.

16 April 2026 in IEEE Open Journal of the Communications Society
Verified
Journal Article
Open access
VSV. S. V. Sandeep
V. S. V. Sandeep
SKSai Dinesh Kancharana
Sai Dinesh Kancharana
AKArun Pachai Kannu
Arun Pachai Kannu
We study sparse regression codes (SPARC) for multiple access channels with multiple receive antennas, in non-coherent flat fading channels. We propose a novel practical decoder, referred to as maximum likelihood matching pursuit (MLMP), which greedily finds the support of the codewords of users with partial maximum likelihood metrics. Unlike conventional successive-cancellation-based greedy algorithms, MLMP works as a successive-combining energy detector. We also propose MLMP modifications to improve the performance at high code rates. Our proposed decoder does not need any channel state information but requires only the second order channel fading statistics. We give a method to estimate the required second order channel statistics using the received observations, without any pilots. Our studies in short block lengths show that, even without any channel state information, SPARC with MLMP decoder achieves multi-user diversity in some scenarios, giving better error performance with multiple users than that of the corresponding single-user case. We also show that SPARC with MLMP performs better than conventional sparse recovery algorithms and pilot-aided transmissions with polar codes.

21 May 2024 in TechRxiv
Verified
Preprint
Open access
PDF file
SKSai Dinesh Kancharana
Sai Dinesh Kancharana
MSMadhusudan Kumar Sinha
Madhusudan Kumar Sinha
APArun Pachai
Arun Pachai
We study the sparse regression codes over flat-fading channels with multiple receive antennas. We consider a practical scenario where the channel state information is not available at the transmitter and the receiver. In this setting, we study the maximum likelihood (ML) detector for SPARC, which has a prohibitively high search complexity. We propose a novel practical decoder, named maximum likelihood matching pursuit (MLMP), which incorporates a greedy search mechanism along with the ML metric. We also introduce a parallel search mechanism for MLMP. Comparing with the existing block-orthogonal matching pursuit based decoders, we show that MLMP has significant gains in the block error rate (BLER) performance. We also show that the proposed approach has significant gains over polar codes employing pilot-aided channel estimation.