9 July 2018 in IEEE Transactions on Communications
In a multi-user millimeter (mm) wave communication system, we consider the problem of estimating the channel response between the base station (BS) and each of the user equipments (UE). We propose three different pilot training schemes/strategies, namely, 1) Estimating mm wave channels separately at the UE’s, 2) Joint estimation of mm wave channels of all the UE’s simultaneously at the BS, and 3) Two stage process involving estimation at both the UE’s and the BS. We propose two random constructions for the pilot/training signals/beamforming weights and analytically characterize the mutual coherence parameter of the resulting sensing matrices for one of the constructions. By exploiting the structure in mm wave channels, we develop a generalized block orthogonal matching pursuit (G-BOMP) algorithm for channel estimation in all the three strategies. Further, we establish sufficient conditions for exact support recovery by the proposed G-BOMP algorithm and derive an upper bound on the norm of the channel estimation error. We also study the performance of our G-BOMP algorithm in terms of the average beamforming gain and average spectral efficiency achieved via simulations. Our results show that the proposed G-BOMP algorithm outperforms the conventional OMP algorithm and other existing multiuser mm wave channel estimation techniques. G-BOMP also performs comparable to the computationally expensive compressive estimation using Newton’s refinement technique, for the first pilot training strategy in which the UE’s estimate the channels separately.
15 January 2024 in IEEE Transactions on Communications
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.
18 May 2010 in IEEE Transactions on Information Theory
In this paper, we consider noncoherent single-antenna communication over doubly selective block-fading channels with discrete block-fading interval N . In our noncoherent setup, neither the transmitter nor the receiver know the channel fading coefficients, though both know the channel statistics. In particular, we consider discrete-time channels whose impulse-response trajectories obey a complex-exponential basis expansion model with uncorrelated coefficients, and we show that such a model holds in the limit N ¿ ¿ for pulse-shaped transmission/reception over certain wide-sense stationary uncorrelated scattering channels. First, we show that, when the inputs are chosen from continuous distributions, the channel's multiplexing gain (i.e., capacity pre-log factor) equals max(0, 1 - N delay N Dopp/N) , for discrete delay spread N delay and discrete Doppler spread N Dopp. Next, for the case of strictly doubly selective fading (i.e., N Dopp > 1 and N delay > 1), we establish that, for cyclic-prefixed affine pilot-aided transmission (PAT) schemes designed to minimize the mean-squared error (MSE) attained by pilot-aided minimum-MSE channel estimation, the pre-log factor of the achievable rate is less than the channel's multiplexing gain. We then provide guidelines for the design of PAT schemes whose achievable-rate pre-log factor equals the channel's multiplexing gain and construct an example.
13 February 2020 in IEEE Transactions on Signal Processing
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.
14 February 2017 in IEEE Communications Letters
In single stream MIMO communication systems, the beamforming or precoding vectors are chosen as the singular vectors corresponding to the largest singular value of the MIMO channel matrix, in order to maximize the received signal to noise ratio (SNR). In practical scenarios, beamforming vectors are chosen based on the estimated channel matrix corrupted by estimation errors. In our work, we analytically obtain lower bounds on the received SNR and the corresponding channel capacity, under this mismatched beamforming. We apply our bounds to millimeter wave beamforming systems and show that they are tight in moderate to high SNR regimes.
21 October 2025 in IEEE Transactions on Communications
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.