No Arabic abstract
Fine-grained indoor localization has attracted attention recently because of the rapidly growing demand for indoor location-based services (ILBS). Specifically, massive (large-scale) multiple-input and multiple-output (MIMO) systems have received increasing attention due to high angular resolution. This paper presents an indoor localization testbed based on a massive MIMO orthogonal frequency-division multiplexing (OFDM) system, which supports physical-layer channel measurements. Instead of exploiting channel state information (CSI) directly for localization, we focus on positioning from the perspective of multipath components (MPCs), which are extracted from the CSI through the space-alternating generalized expectation-maximization (SAGE) algorithm. On top of the available MPCs, we propose a generalized fingerprinting system based on different single-metric and hybrid-metric schemes. We evaluate the impact of the varying antenna topologies, the size of the training set, the number of antennas, and the effective signal-to-noise ratio (SNR). The experimental results show that the proposed fingerprinting method can achieve centimeter-level positioning accuracy with a relatively small training set. Specifically, the distributed uniform linear array obtains the highest accuracy with about 1.63-2.5-cm mean absolute errors resulting from the high spatial resolution.
Multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) is a key technology component in the evolution towards next-generation communication in which the accuracy of timing and frequency synchronization significantly impacts the overall system performance. In this paper, we propose a novel scheme leveraging extreme learning machine (ELM) to achieve high-precision timing and frequency synchronization. Specifically, two ELMs are incorporated into a traditional MIMO-OFDM system to estimate both the residual symbol timing offset (RSTO) and the residual carrier frequency offset (RCFO). The simulation results show that the performance of an ELM-based synchronization scheme is superior to the traditional method under both additive white Gaussian noise (AWGN) and frequency selective fading channels. Finally, the proposed method is robust in terms of choice of channel parameters (e.g., number of paths) and also in terms of generalization ability from a machine learning standpoint.
With the rapid development of indoor location-based services (LBSs), the demand for accurate localization keeps growing as well. To meet this demand, we propose an indoor localization algorithm based on graph convolutional network (GCN). We first model access points (APs) and the relationships between them as a graph, and utilize received signal strength indication (RSSI) to make up fingerprints. Then the graph and the fingerprint will be put into GCN for feature extraction, and get classification by multilayer perceptron (MLP).In the end, experiments are performed under a 2D scenario and 3D scenario with floor prediction. In the 2D scenario, the mean distance error of GCN-based method is 11m, which improves by 7m and 13m compare with DNN-based and CNN-based schemes respectively. In the 3D scenario, the accuracy of predicting buildings and floors are up to 99.73% and 93.43% respectively. Moreover, in the case of predicting floors and buildings correctly, the mean distance error is 13m, which outperforms DNN-based and CNN-based schemes, whose mean distance errors are 34m and 26m respectively.
Recently, integrating the communication and sensing functions into a common network has attracted a great amount of attention. This paper considers the advanced signal processing techniques for enabling the radar to sense the environment via the communication signals. Since the technologies of orthogonal frequency division multiplexing (OFDM) and multiple-input multiple-output (MIMO) are widely used in the legacy cellular systems, this paper proposes a two-stage signal processing approach for radar sensing in an MIMO-OFDM system, where the scattered channels caused by various targets are estimated in the first stage, and the location information of the targets is then extracted from their scattered channels in the second stage. Specifically, based on the observations that radar sensing is similar to multi-path communication in the sense that different targets scatter the signal sent by the radar transmitter to the radar receiver with various delay, and that the number of scatters is limited, we show that the OFDM-based channel training approach together with the compressed sensing technique can be utilized to estimate the scattered channels efficiently in Stage I. Moreover, to tackle the challenge arising from range resolution for sensing the location of closely spaced targets, we show that the MIMO radar technique can be leveraged in Stage II such that the radar has sufficient spatial samples to even detect the targets in close proximity based on their scattered channels. Last, numerical examples are provided to show the effectiveness of our proposed sensing approach which merely relies on the existing MIMO-OFDM communication techniques.
In frequency-division duplexing (FDD) massive multiple-input multiple-output (MIMO), deep learning (DL)-based superimposed channel state information (CSI) feedback has presented promising performance. However, it is still facing many challenges, such as the high complexity of parameter tuning, large number of training parameters, and long training time, etc. To overcome these challenges, an extreme learning machine (ELM)-based superimposed CSI feedback is proposed in this paper, in which the downlink CSI is spread and then superimposed on uplink user data sequence (UL-US) to feed back to base station (BS). At the BS, an ELM-based network is constructed to recover both downlink CSI and UL-US. In the constructed ELM-based network, we employ the simplifi
Algorithms for Massive MIMO uplink detection typically rely on a centralized approach, by which baseband data from all antennas modules are routed to a central node in order to be processed. In case of Massive MIMO, where hundreds or thousands of antennas are expected in the base-station, this architecture leads to a bottleneck, with critical limitations in terms of interconnection bandwidth requirements. This paper presents a fully decentralized architecture and algorithms for Massive MIMO uplink based on recursive methods, which do not require a central node for the detection process. Through a recursive approach and very low complexity operations, the proposed algorithms provide a sequence of estimates that converge asymptotically to the zero-forcing solution, without the need of specific hardware for matrix inversion. The proposed solution achieves significantly lower interconnection data-rate than other architectures, enabling future scalability.