17 January 2024 in IEEE Transactions on Wireless Communications
Benefitting from the vast spatial degrees of freedom, the amalgamation of integrated sensing and communication (ISAC) and massive multiple-input multiple-output (MIMO) is expected to simultaneously improve spectral and energy efficiencies as well as the sensing capability. However, a large number of antennas deployed in massive MIMO-ISAC raises critical challenges in acquiring both accurate channel state information and target parameter information. To overcome these two challenges with a unified framework, we first analyze their underlying system models and then propose a novel tensor-based approach that addresses both the channel estimation and target sensing problems. Specifically, by parameterizing the high-dimensional communication channel exploiting a small number of physical parameters, we associate the channel state information with the sensing parameters of targets in terms of angular, delay, and Doppler dimensions. Then, we propose a shared training pattern adopting the same time-frequency resources such that both the channel estimation and target parameter estimation can be formulated as a canonical polyadic decomposition problem with a similar mathematical expression. On this basis, we first investigate the uniqueness condition of the tensor factorization and the maximum number of resolvable targets by utilizing the specific Vandermonde structure. Then, we develop a unified tensor-based algorithm to estimate the parameters including angles, time delays, Doppler shifts, and reflection/path coefficients of the targets/channels. In addition, we propose a segment-based shared training pattern to facilitate the channel and target parameter estimation for the case with significant beam squint effects. Simulation results verify our theoretical analysis and the superiority of the proposed unified algorithms in terms of estimation accuracy, sensing resolution, and training overhead reduction.
29 August 2024 in IEEE Wireless Communications Letters
In this letter, we investigate the channel estimation problem for MIMO wireless communication systems with movable antennas (MAs) at both the transmitter (Tx) and receiver (Rx). To achieve high channel estimation accuracy with low pilot training overhead, we propose a tensor decomposition-based method for estimating the parameters of multi-path channel components, including their azimuth and elevation angles, as well as complex gain coefficients, thereby reconstructing the wireless channel between any pair of Tx and Rx MA positions in the Tx and Rx regions. First, we introduce a two-stage Tx-Rx successive antenna movement pattern for pilot training, such that the received pilot signals in both stages can be expressed as a third-order tensor. Then, we obtain the factor matrices of the tensor via the canonical polyadic decomposition, and thereby estimate the angle/gain parameters for enabling the channel reconstruction between arbitrary Tx/Rx MA positions. In addition, we analyze the uniqueness condition of the tensor decomposition, which ensures the complete channel reconstruction between the whole Tx and Rx regions based on the channel measurements at only a finite number of Tx/Rx MA positions. Finally, simulation results are presented to evaluate the proposed tensor decomposition-based method as compared to existing methods, in terms of channel estimation accuracy and pilot overhead.
4 July 2022 in IEEE Transactions on Communications
Massive multiple-input multiple-output (MIMO) integrated with millimeter-wave (mmWave) can provide unprecedented performance improvement for realizing future wireless communications. However, acquiring accurate channel state information in wideband mmWave massive MIMO systems with hybrid transceiver architectures is even challenging, especially in high-mobility scenarios with severe Doppler effects. In this paper, we propose a tensor decomposition-based method to estimate the time-varying and frequency-selective (TVFS) mmWave MIMO channels. Specifically, by exploiting the sparse scattering nature of TVFS channels, we model the frequency-domain received signal as a third-order tensor that admits a canonical polyadic (CP) decomposition format. Then, we analyze the uniqueness condition of the proposed CP decomposition-based channel estimation problem and propose a novel estimator to acquire TVFS channel parameters including angle of departure/arrival (AoD/AoA), time delay, path gain, and the Doppler shift. To address the sophisticated coupling among unknown parameters, we further propose a joint AoD and Doppler shift estimation (JADE) algorithm that provides reliable initial and iteratively refined estimates. The derived analysis and simulation results verify that the proposed JADE algorithm achieves higher estimation accuracy and guarantees the superiority of the proposed TVFS channel estimator over existing schemes.
27 October 2022 in IEEE Signal Processing Magazine
Sparse modeling for signal processing and machine learning, in general, has been at the focus of scientific research for over two decades. Among others, supervised sparsity-aware learning (SAL) consists of two major paths paved by 1) discriminative methods that establish direct input–output mapping based on a regularized cost function optimization and 2) generative methods that learn the underlying distributions. The latter, more widely known as Bayesian methods , enable uncertainty evaluation with respect to the performed predictions. Furthermore, they can better exploit related prior information and also, in principle, can naturally introduce robustness into the model, due to their unique capacity to marginalize out uncertainties related to the parameter estimates. Moreover, hyperparameters (tuning parameters) associated with the adopted priors, which correspond to cost function regularizers, can be learned via the training data and not via costly cross-validation techniques, which is, in general, the case with the discriminative methods.
22 March 2021 in IEEE Transactions on Cognitive Communications and Networking
Due to the emergence of deep learning, signal recognition has made great strides in performance improvement. The success of most deep learning methods relies on the accessibility of abundant labeled training data. However, the annotation of signals is quite expensive, making it challenging to train deep learning models substantially. This calls for the development of semi-supervised learning (SSL) method to fully utilize the unlabeled data to assist the training of deep learning models. To achieve this goal, three types of loss functions, tailored to the task of SLL-based signal recognition, are carefully designed in this paper. Together with a carefully selected neural network structure, the proposed SSL method can effectively extract the information from unlabeled training data and thus overcome the difficulty of insufficient training. Extensive numerical results using open source datasets are presented to show the superior performance of the proposed SSL method.
1 April 2022 in IEEE Transactions on Signal Processing
Tensor rank learning for canonical polyadic decomposition (CPD) has long been deemed as an essential yet challenging problem. In particular, since thetensor rank controls the complexity of the CPD model, its inaccurate learning would cause overfitting to noise or underfitting to the signal sources, and even destroy the interpretability of model parameters. However, the optimal determination of a tensor rank is known to be a non-deterministic polynomial-time hard (NP-hard) task. Rather than exhaustively searching for the best tensor rank via trial-and-error experiments, Bayesian inference under the Gaussian-gamma prior was introduced in the context of probabilistic CPD modeling, and it was shown to be an effective strategy for automatic tensor rank determination. This triggered flourishing research on other structured tensor CPDs with automatic tensor rank learning. On the other side of the coin, these research works also reveal that the Gaussian-gamma model does not perform well for high-rank tensors and/or low signal-to-noise ratios (SNRs). To overcome these drawbacks, in this paper, we introduce a more advanced generalized hyperbolic (GH) prior to the probabilistic CPD model, which not only includes the Gaussian-gamma model as a special case, but also is more flexible to adapt to different levels of sparsity. Based on this novel probabilistic model, an algorithm is developed under the framework of variational inference, where each update is obtained in a closed-form. Extensive numerical results, using synthetic data and real-world datasets, demonstrate the significantly improved performance of the proposed method in learning both low as well as high tensor ranks even for low SNR cases.