AKArun Pachai Kannu

Arun Pachai Kannu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Arun Pachai Kannu has a total of 18 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Sparse Regression Codes Achieve Multi-User Diversity Without Channel State Information

    by V. S. V. Sandeep, Sai Dinesh Kancharana, 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.


  • Sparse Regression Codes for Non-Coherent SIMO Channels

    by Sai Dinesh Kancharana, Madhusudan Kumar Sinha, 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.


  • Open Access

    Sparse Regression Codes exploit Multi-User Diversity without CSI

    by V S V Sandeep, Sai Dinesh Kancharana, 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. As opposed to the 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 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.

  • Generalized Sparse Regression Codes for Short Block Lengths

    by Madhusudan Kumar Sinha, Arun Pachai Kannu

    Sparse Regression Code (SPARC) connects the sparse signal recovery framework with the error control coding techniques. In this paper, we focus on improving the block error performance of SPARC in short block length regime over the AWGN channel. Towards that, we introduce suitable candidates for dictionary matrices in real and complex fields using Gold sequences and mutually unbiased bases (MUB). We propose two generalizations of SPARC (GSPARC), develop a greedy decoder called Match and Decode (MAD) algorithm, and provide its analytical noiseless recovery guarantees. We propose a parallel greedy search technique called parallel MAD (PMAD) to improve performance. We describe the applicability of GSPARC with PMAD decoder for multi-user channels, providing a non-orthogonal multiple access scheme. We present numerical results comparing the block error rate (BLER) performance of the proposed algorithms for GSPARC in AWGN channels in the short block length regime. The PMAD decoder gives better BLER than the approximate message-passing decoder for SPARC. GSPARC with PMAD gives comparable and competitive BLER performance compared to other existing codes. In multi-user channels, GSPARC with PMAD decoder outperforms the sphere packing lower bounds of an orthogonal multiple access scheme with the same spectral efficiency.


  • Open Access

    3-D Beamforming Training Using Mutually Unbiased Bases for Cell Discovery in mm-Wave Systems

    by P. Rashmi, A. Manoj, Arun Pachai Kannu

    Beamforming training or cell discovery (CD) is a fundamental procedure in millimeter wave communication systems in which the user detects the presence of a base station, acquires the identity of that base station, and finds suitable beamforming directions to establish the wireless link for the subsequent data transmission phase. We consider uniform planar array-based beamforming under both separable and non-separable configurations as it allows confined antenna placements and 3-D steering of beams. Our focus is to design the beamforming training phase and develop low-complexity receiver algorithms for the cell discovery procedure. By exploiting the sparse nature of the mm-wave channels and using an equivalent compressive sensing measurement model, we obtain analytical bounds for the cell detection probability in terms of the mutual coherence parameter of the resulting sensing matrix. Using mutually unbiased bases (MUB) from quantum information theory, we design CD schemes with low mutual coherence. Our design includes parameters that control the training phase duration, and we analytically characterize the relationship between the training duration and the corresponding mutual coherence value. We present detailed simulation studies using experimentally driven mm-wave channel simulators and show that our MUB based scheme gives superior detection performance when compared to the conventional beam sweeping based schemes and random beamforming schemes.


  • Open Access

    Generalized Sparse Regression Codes for Short Block Lengths

    by Madhusudan Kumar Sinha, Arun Pachai Kannu

    Sparse regression codes (SPARC) connect the sparse signal recovery framework of compressive sensing with error control coding techniques. SPARC encoding produces codewords which are \emph{sparse} linear combinations of columns of a dictionary matrix. SPARC decoding is accomplished using sparse signal recovery algorithms. We construct dictionary matrices using Gold codes and mutually unbiased bases and develop suitable generalizations of SPARC (GSPARC). We develop a greedy decoder, referred as match and decode (MAD) algorithm and provide its analytical noiseless recovery guarantees. We propose a parallel greedy search technique, referred as parallel MAD (PMAD), to improve the performance. We describe the applicability of GSPARC with PMAD decoder for multi-user channels, providing a non-orthogonal multiple access scheme. We present numerical results comparing the block error rate (BLER) performance of the proposed algorithms for GSPARC in AWGN channels, in the short block length regime. The PMAD decoder gives better BLER than the approximate message passing decoder for SPARC. GSPARC with PMAD gives comparable and competitive BLER performance, when compared to other existing codes. In multi-user channels, GSPARC with PMAD decoder outperforms the sphere packing lower bounds of an orthogonal multiple access scheme, which has the same spectral efficiency.

  • Parallel Greedy Search for Random Access in Wireless Networks

    by Rahul Kumar, Madhusudan Kumar Sinha, Arun Pachai Kannu

    We consider the random access problem in wireless networks such as cellular networks and massive machine type communication networks, where a large number of devices/users are connected to a base station. In order to establish communication with the base station, as a part of the random access procedure, active users select and transmit codes (pilot sequences) randomly from a codebook. Since the active users are typically a small fraction of the total users, sparse signal recovery algorithms are employed to detect the transmitted codes. In this paper, we use multiple measurement vector model for the received signal and develop a parallel greedy search algorithm and it’s stopping criteria to detect the active users. We show through simulations that the proposed scheme, compared with the existing greedy algorithms, gives better detection performance at lower false alarms levels. We study how the code length and the code word size need to be chosen in order to detect a given number of active users. We also address the scenario when there are different timing offsets for signals received from different users.


  • Analysis of Beam Sweeping Techniques for Cell-Discovery in Millimeter Wave Systems

    by P. Rashmi, A. Manoj, Arun Pachai Kannu

    Cell discovery is the procedure in which a user equipment (UE) finds a suitable base station (BS) to establish a communication link. When beamforming with antenna arrays is done at both transmitter and receiver, cell discovery in mm wave systems also involves finding the correct angle of arrival – angle of departure alignment between the UE and the detected BS. First, we consider the single BS scenario and present the mathematical model for the cell discovery problem. We present the details of the beam sweepingbased techniques and explain the beam combining scheme to reduce the training overhead. We analytically characterize the performance of energy detector at the UE for both beam sweeping and beam combining methods under some channel assumptions. Further, we consider the multiple BS case where BSs transmit synchronization signals along with directional beamforming. We analyze the performance of the energy detector in this case as well. We finally present simulation studies with channels generated using generic mm wave channel emulators and draw inferences on the role of various parameters on the cell discovery performance.


  • Open Access

    Analysis of Beam Sweeping Techniques for Cell-Discovery in mm Wave Systems

    by Rashmi P, Manoj A, Arun Pachai Kannu

    Cell discovery is the procedure in which a user equipment (UE) finds a suitable base station (BS) to establish a communication link. When beamforming with antenna arrays is done at both transmitter and receiver, cell discovery in mm wave systems also involves finding the correct angle of arrival - angle of departure alignment between the UE and the detected BS. First, we consider the single BS scenario and present the mathematical model for the cell discovery problem. We present the details of the beam sweeping based techniques and explain the beam combining scheme to reduce the training overhead. We analytically characterize the performance of energy detector at the UE for both beam sweeping and beam combining methods under some channel assumptions. Further, we consider the multiple BS case where BSs transmit synchronization signals along with directional beamforming. We analyze the performance of the energy detector in this case as well. We finally present simulation studies with channels generated using generic mm wave channel emulators and draw inferences on the role of various parameters on the cell discovery performance.

  • Algorithms for Change Detection With Sparse Signals

    by Aditi Jain, Pradeep Sarvepalli, Srikrishna Bhashyam, Arun Pachai Kannu

    We consider the change detection problem where the pre-change observation vectors are purely noise and the post-change observation vectors are noise-corrupted compressive measurements of sparse signals with a common support, measured using a sensing matrix. In general, post-change probability density function (pdf) of the observations depends on parameters such as the support and variances of the sparse signal. When these parameters are unknown, we propose two approaches. In the first approach, we approximate the post-change pdf based on the known parameters such as mutual coherence of the sensing matrix and bounds on the signal variances. In the second approach, we parameterize the post-change pdf with an unknown parameter and try to estimate this parameter using two different methods, stochastic gradient descent and generalized likelihood ratio. In both these approaches, we employ the conventional cumulative sum (CUSUM) algorithm with various decision statistics such as the energy of the observations, correlation values with columns of the sensing matrix and the maximum value of such correlations. We analytically characterize the worst-case detection delay and average run length to false alarm performance of pdf-approximation based approach. We also numerically study the performance and offer insights on the relevance of various decision statistics in different signal to noise ratio (SNR) regimes. We also address the problem of designing sensing matrices with small mutual coherence by using designs from quantum information theory. One such design using equi-angular lines has an additional structure which allows exact characterization of the post-change pdf of the correlation values, even when the support set of the sparse signal is unknown. We apply our detection algorithms with sensing matrix designed from equi-angular lines to a massive random access problem and show their superior performance over conventional Gold codes.