This paper considers multi-view imaging in a sixth-generation (6G) integrated sensing and communication network, which consists of a transmit base-station (TBS), multiple receive base-stations (RBSs) connected to a central processing unit (CPU), and multiple extended targets. Our goal is to devise an effective multi-view imaging technique that can jointly leverage the echo signals at all the RBSs to precisely construct the image of these targets. To achieve this goal, we propose a two-phase framework. In Phase I, each RBS recovers an individual image of all the targets from its own view, which is obtained via utilizing its received signals’ sample covariance matrix to detect the grids with non-zero effective scattering intensity in the region of interest. Moreover, the shape of each grid is adjusted to conform to target geometries. In Phase II, the CPU fuses the individual images of all the RBSs to construct a higher-quality image of all the targets. To this end, we first design an edge-preserving natural neighbor interpolation (EP-NNI) method and then formulate an optimization problem to fuse the interpolated results. Extensive numerical results show that the proposed scheme significantly enhances imaging performance, facilitating high-quality environment reconstruction for future 6G networks.

This paper presents an initial investigation into the combination of integrated sensing and communication (ISAC) and massive communication, both of which are largely regarded as key scenarios in sixth-generation (6G) wireless networks. Specifically, we consider a cell-free network comprising a large number of users, multiple targets, and distributed base stations (BSs). In each time slot, a random subset of users becomes active, transmitting pilot signals that can be scattered by the targets before reaching the BSs. Unlike conventional massive random access schemes, where the primary objectives are device activity detection and channel estimation, our framework also enables target localization by leveraging the multipath propagation effects introduced by the targets. However, due to the intricate dependency between user channels and target locations, characterizing the posterior distribution required for minimum mean-square error (MMSE) estimation presents significant computational challenges. To handle this problem, we propose a hybrid message passing-based framework that incorporates multiple approximations to mitigate computational complexity. Numerical results demonstrate that the proposed approach achieves high-accuracy device activity detection, channel estimation, and target localization simultaneously, validating the feasibility of embedding localization functionality into massive communication systems for future 6G networks.

This paper considers an intelligent reflecting surface (IRS)-assisted bi-static localization architecture for the sixth-generation (6G) integrated sensing and communication (ISAC) network. The system consists of a transmit user, a receive base station (BS), an IRS, and multiple passive targets in either the far-field or near-field region of the IRS. In particular, we focus on the challenging scenario where the line-of-sight (LOS) paths between targets and the BS are blocked, such that the emitted orthogonal frequency division multiplexing (OFDM) signals from the user reach the BS merely via the user-target-IRS-BS path. Our objective is to localize the targets by estimating their relative positions to the IRS from the received signal at the BS, instead of the BS. We show that subspace-based methods, such as the multiple signal classification (MUSIC) algorithm, can be applied to estimate the relative states from the targets to the IRS, while the spectrum ambiguity exhibits caused by the low-rank IRS-BS channel. To overcome this issue, we propose a novel spatiotemporal IRS phase profile and create a virtual signal model by concatenating the temporal signals over multiple OFDM symbols. Furthermore, we rigorously prove that the spectrum ambiguity issue can be resolved almost surely, if the MUSIC algorithm is applied to our properly constructed temporal-domain signals. Numerical results verify the effectiveness and efficiency of our proposed IRS-assisted localization scheme over the other localization counterparts. Our paper demonstrates the potential of employing passive anchors, i.e., IRSs, to improve the sensing coverage of the active anchors, i.e., BSs.

This paper addresses the joint transceiver design, including pilot transmission, channel feature extraction and feedback, as well as precoding, for low-overhead downlink massive multiple-input multiple-output (MIMO) communication in frequency-division duplex (FDD) systems. Although deep learning (DL) has shown great potential in tackling this problem, existing methods often suffer from poor scalability in practical systems, as the solution obtained in the training phase merely works for a fixed feedback capacity and a fixed number of users in the deployment phase. To address this limitation, we propose a novel DL-based framework comprised of choreographed neural networks, which can utilize one training phase to generate all the transceiver solutions used in the deployment phase with varying sizes of feedback codebooks and numbers of users. The proposed framework includes a residual vector-quantized variational autoencoder (RVQ-VAE) for efficient channel feedback and an edge graph attention network (EGAT) for robust multi-user precoding. It can adapt to different feedback capacities by flexibly adjusting the RVQ codebook sizes using the hierarchical codebook structure, and scale with the number of users through a feedback module sharing scheme and the inherent scalability of EGAT. Moreover, a progressive training strategy is proposed to further enhance data transmission performance and generalization capability. Numerical results on a real-world dataset demonstrate the superior scalability and performance of our approach over existing methods.

This paper considers the joint pilot, feedback, and precoding design for low-overhead downlink multi-user multiple-input multiple-output (MU-MIMO) communication in frequency-division duplex (FDD) systems. Although the deep learning (DL) technique has demonstrated the potential to address this challenging problem, most of the current works along this line suffer from poor scalability because the numbers of users during the training and implementation phases have to be the same. To overcome this limitation, we propose a novel scalable DL framework for joint transceiver design in FDD systems using neural networks (NNs). Specifically, we design a vector-quantized variational autoencoder-based feedback scheme with a common quantization codebook shared by all the users for efficient feedback. Additionally, we employ a graph attention network (GAT) for effective precoding design. Thanks to the shared feedback module and the inherent scalability of GAT, the proposed NN trained for a particular number of users can be applied in practice given any number of users with satisfactory performance. Numerical results using a real-world channel dataset are provided to demonstrate the superior scalability and performance of the proposed approach over the existing baseline methods.

This paper investigates the robust wideband channel estimation problem in the millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) systems. In such a scenario, the beam squint effect that the array response vectors vary with different frequencies and the impulsive noise can occur, which pose great challenges for accurate channel estimation. Directly applying the existing channel estimation methods usually suffers significant performance degradation, since they are proposed based on the assumptions of frequency-invariant array response vectors and Gaussian distributed noise. To address these issues, this paper proposes a novel wideband channel estimation method with robustness to impulsive noise. Specifically, the proposed method incorporates a cyclic refinement step to overcome the estimation inaccuracy caused by the greedy nature of matching-pursuit-esque algorithms. In particular, the generalized$\ell_{p}$-norm minimization criterion is adopted in Newton's method to improve the performance robustness against the non-Gaussian impulsive noise. Numerical results are provided to verify the superior performance of the proposed method over the existing representative benchmarks.

This paper considers networked sensing in cellular network, where multiple base stations (BSs) first compress their received echo signals from multiple targets and then forward the quantized signals to the central unit (CU) via limited-capacity fronthaul links, such that the CU can leverage all useful echo signals to perform high-resolution localization. Under this setup, we manage to characterize the posterior Cramér-Rao Bound (PCRB) for localizing all the targets with random positions, as a function of the transmit covariance matrix and the compression noise covariance matrix of each BS. Then, a PCRB minimization problem subject to the transmit power constraints and the fronthaul capacity constraints is formulated to jointly design the BSs’ transmission and compression strategies. We propose an efficient algorithm to solve this problem based on the alternating optimization technique. Specifically, it is shown that when either the transmit covariance matrices or the compression noise covariance matrices are fixed, the successive convex approximation (SCA) technique can be leveraged to optimize the other type of covariance matrices locally optimally. Moreover, we also propose a novel estimate-then-beamform-then-compress strategy for the massive receive antenna scenario, under which each BS first estimates targets’ angle-of-arrivals (AOAs) locally, then beamforms its high-dimension received signals into low-dimension ones based on the estimated AOAs, and last compresses the beamformed signals for fronthaul transmission. An efficient beamforming and compression design method is devised under this strategy. Numerical results are provided to verify the effectiveness of our proposed algorithms.

This paper considers networked sensing in cellular network, where multiple base stations (BSs) first compress their received echo signals from multiple targets and then forward the quantized signals to the cloud via limited-capacity backhaul links, such that the cloud can leverage all useful echo signals to perform high-resolution localization. Under this setup, we manage to characterize the posterior Cramér-Rao Bound (PCRB) for localizing all the targets as a function of the transmit covariance matrix and the compression noise covariance matrix of each BS. Then, a PCRB minimization problem subject to the transmit power constraints and the backhaul capacity constraints is formulated to jointly design the BSs’ transmission and compression strategies. We propose an efficient algorithm to solve this problem based on the alternating optimization technique. Specifically, it is shown that when either the transmit covariance matrices or the compression noise covariance matrices are fixed, the successive convex approximation technique can be leveraged to optimize the other type of covariance matrices locally. Numerical results are provided to verify the effectiveness of our proposed algorithm.

Fast and precise beam alignment is crucial for high-quality data transmission in millimeter-wave (mmWave) communication systems, where large-scale antenna arrays are utilized to overcome the severe propagation loss. To tackle the challenging problem, we propose a novel deep learning-based hierarchical beam alignment method for both multiple-input single-output (MISO) and multiple-input multiple-output (MIMO) systems, which learns two tiers of probing codebooks (PCs) and uses their measurements to predict the optimal beam in a coarse-to-fine search manner. Specifically, a hierarchical beam alignment network (HBAN) is developed for MISO systems, which first performs coarse channel measurement using a tier-1 PC, then selects a tier-2 PC for fine channel measurement, and finally predicts the optimal beam based on both coarse and fine measurements. The propounded HBAN is trained in two steps: the tier-1 PC and the tier-2 PC selector are first trained jointly, followed by the joint training of all the tier-2 PCs and beam predictors. Furthermore, an HBAN for MIMO systems is proposed to directly predict the optimal beam pair without performing beam alignment individually at the transmitter and receiver. Numerical results demonstrate that the proposed HBANs are superior to the state-of-the-art methods in both alignment accuracy and signaling overhead reduction.

This paper investigates the problem of activity detection and channel estimation in cooperative multi-cell massive access systems with temporally correlated activity, where all access points (APs) are connected to a central unit via fronthaul links. We propose to perform user-centric AP cooperation for computation burden alleviation and introduce a generalized sliding-window detection strategy for fully exploiting the temporal correlation in activity. By establishing the probabilistic model associated with the factor graph representation, we propose a scalable Dynamic Compressed Sensing-based Multiple Measurement Vector Generalized Approximate Message Passing (DCS-MMV-GAMP) algorithm from the perspective of Bayesian inference. Therein, the activity likelihood is refined by performing standard message passing among the activities in the spatial-temporal domain and GAMP is employed for efficient channel estimation. Furthermore, we develop two schemes of quantize-and-forward (QF) and detect-and-forward (DF) based on DCS-MMV-GAMP for the finite-fronthaul-capacity scenario, which are extensively evaluated under various system limits. Numerical results verify the significant superiority of the proposed approach over the benchmarks. Moreover, it is revealed that QF can usually realize superior performance when the antenna number is small, whereas DF shifts to be preferable with limited fronthaul capacity if the large-scale antenna arrays are equipped.

This paper studies the user activity detection and channel estimation problem in a temporally-correlated massive access system where a very large number of users communicate with a base station sporadically and each user once activated can transmit with a large probability over multiple consecutive frames. We formulate the problem as a dynamic compressed sensing (DCS) problem to exploit both the sparsity and the temporal correlation of user activity. By leveraging the hybrid generalized approximate message passing (HyGAMP) framework, we design a computationally efficient algorithm, HyGAMP-DCS, to solve this problem. In contrast to only exploiting the historical estimations, the proposed algorithm performs bidirectional message passing between the neighboring frames for activity likelihood update to fully exploit the temporally-correlated user activities. Furthermore, we develop an expectation maximization HyGAMP-DCS (EM-HyGAMP-DCS) algorithm to adaptively learn the hyperparameters during the estimation procedure when the system statistics are unknown. In particular, we propose to utilize the analysis tool of state evolution to find the appropriate hyperparameter initialization of EM-HyGAMP-DCS. Simulation results demonstrate that our proposed algorithms can significantly improve the user activity detection accuracy and reduce the channel estimation error.

Fast and precise beam alignment is crucial to support high-quality data transmission in millimeter wave (mmWave) communication systems. In this work, we propose a novel deep learning based hierarchical beam alignment method that learns two tiers of probing codebooks (PCs) and uses their measurements to predict the optimal beam in a coarse-to-fine searching manner. Specifically, the proposed method first performs coarse channel measurement using the tier-1 PC, then selects a tier-2 PC for fine channel measurement, and finally predicts the optimal beam based on both coarse and fine measurements. The proposed deep neural network (DNN) architecture is trained in two steps. First, the tier-1 PC and the tier-2 PC selector are trained jointly. After that, all the tier-2 PCs together with the optimal beam predictors are trained jointly. The learned hierarchical PCs can capture the features of propagation environment. Numerical results based on realistic ray-tracing datasets demonstrate that the proposed method is superior to the state-of-art beam alignment methods in both alignment accuracy and sweeping overhead.

This paper studies the temporal-correlated massive access system where a large number of devices communicate with the base station sporadically and continue transmitting data in the adjacent frames in high probability when being active. By exploiting the sparsity and the temporal correlations of the user activities, the joint user activity detection and channel estimation (JUADCE) problem in multiple consecutive frames can be formulated as a dynamic compressed sensing (DCS) problem. Specifically, we formulate a probabilistic model that accounts the statistics of channels and characterizes the evolutions of the user activities by a steady Markov chain. The hybrid generalized approximate message passing (HyGAMP) framework is leveraged to develop a computationally efficient algorithm named HyGAMP-DCS to solve the JUADCE problem. The HyGAMP-DCS algorithm performs channel estimation in the GAMP part and soft user activity information update in the MP part, then exchanges intrinsic information between these two parts for performance enhancement. Simulation results demonstrate that the proposed algorithm can significantly outperform the conventional DCS-based algorithms and the GAMP algorithm which ignores the temporal correlations.

This paper considers the massive connectivity problem in an asynchronous grant-free random access system, where a huge number of devices sporadically transmit data to a base station (BS) with imperfect synchronization. The goal is to design algorithms for joint user activity detection, delay detection, and channel estimation. By exploiting the sparsity on both user activity and delays, we formulate a hierarchical sparse signal recovery problem in both the single-antenna and the multiple-antenna scenarios. While traditional compressed sensing algorithms can be applied to these problems, they suffer high computational complexity and often require the perfect statistical information of channel and devices. This paper solves these problems by designing the Learned Approximate Message Passing (LAMP) network, which belongs to model-driven deep learning approaches and ensures efficient performance without tremendous training data. Particularly, in the multiple-antenna scenario, we design three different LAMP structures, namely, distributed, centralized and hybrid ones, to balance the performance and complexity. Simulation results demonstrate that the proposed LAMP networks can significantly outperform the conventional AMP method thanks to their ability of parameter learning. It is also shown that LAMP has robust performance to the maximal delay spread of the asynchronous users.

This paper considers massive connectivity in asynchronous systems, where a large number of devices sporadically send data to the base station (BS) with imperfect synchronization. Grant-free random access is considered and each device is assigned with a unique but not necessarily orthogonal pilot sequence for identification and channel estimation. The goal is to design algorithms for joint user activity detection, delay detection, and channel estimation. We first adopt a transmission model where a guard interval is inserted between pilot and data in order to eliminate the potential cross pilot-data interference between asynchronous devices. By exploiting the feature of the asynchronous massive connectivity, we formulate a sparse signal recovery problem with hierarchical sparsity on the user activity and the time delays. We propose the Learned approximate message passing (LAMP) network that combines deep learning in the AMP framework to solve the problem. This neural network benefits from parameter learning ability of deep learning and low computation complexity of the AMP algorithm. Simulation results demonstrate that the LAMP network can perform much better than the AMP algorithm with no prior knowledge of the system statistics. Its performance is also insensitive to the maximal delay spread of the asynchronous users.