3 February 2017 in IEEE Communications Surveys & Tutorials
As a paradigm to recover the sparse signal from a small set of linear measurements, compressed sensing (CS) has stimulated a great deal of interest in recent years. In order to apply the CS techniques to wireless communication systems, there are a number of things to know and also several issues to be considered. However, it is not easy to grasp simple and easy answers to the issues raised while carrying out research on CS. The main purpose of this paper is to provide essential knowledge and useful tips and tricks that wireless communication researchers need to know when designing CS-based wireless systems. First, we present an overview of the CS technique, including basic setup, sparse recovery algorithm, and performance guarantee. Then, we describe three distinct subproblems of CS, viz., sparse estimation, support identification, and sparse detection, with various wireless communication applications. We also address main issues encountered in the design of CS-based wireless communication systems. These include potentials and limitations of CS techniques, useful tips that one should be aware of, subtle points that one should pay attention to, and some prior knowledge to achieve better performance. Our hope is that this paper will be a useful guide for wireless communication researchers and even non-experts to get the gist of CS techniques.
10 July 2019 in IEEE Access
As a paradigm to recover unknown entries of a matrix from partial observations, low-rank matrix completion (LRMC) has generated a great deal of interest. Over the years, there have been lots of works on this topic, but it might not be easy to grasp the essential knowledge from these studies. This is mainly because many of these works are highly theoretical or a proposal of new LRMC technique. In this paper, we give a contemporary survey on LRMC. In order to provide a better view, insight, and understanding of potentials and limitations of the LRMC, we present early scattered results in a structured and accessible way. Specifically, we classify the state-of-the-art LRMC techniques into two main categories and then explain each category in detail. We next discuss the issues to be considered when one considers using the LRMC techniques. These include intrinsic properties required for the matrix recovery and how to exploit a special structure in the LRMC design. We also discuss the convolutional neural network (CNN)-based LRMC algorithms exploiting the graph structure of a low-rank matrix. Furthermore, we present the recovery performance and the computational complexity of state-of-the-art LRMC techniques. Our hope is that this paper will serve as a useful guide for practitioners and non-experts to catch the gist of the LRMC.
11 February 2019 in IEEE Journal on Selected Areas in Communications
The fifth generation (5G) wireless systems aims to differentiate its services based on different application scenarios. Instead of constructing different physical networks to support each application, radio access network (RAN) slicing is deemed as a prospective solution to help operate multiple logical separated wireless networks in a single physical network. In this paper, we incorporate two typical 5G services, i.e., enhanced Mobile BroadBand (eMBB) and Ultra-Reliable Low-Latency Communications (URLLC), in a cloud RAN (C-RAN), which is suitable for RAN slicing due to its high flexibility. In particular, for eMBB, we make use of multicasting to improve the throughput, and for URLLC, we leverage the finite blocklength capacity to capture the delay accurately. We envision that there will be many slice requests for each of these two services. Accepting a slice request means a certain amount of revenue (consists of long-term revenue and shot-term revenue) is earned by the C-RAN operator. Our objective is to maximize the C-RAN operator’s revenue by properly admitting the slice requests, subject to the limited physical resource constraints. We formulate the revenue maximization problem as a mixed-integer nonlinear programming (MINLP) and exploit efficient approaches to solve it, such as successive convex approximation and semidefinite relaxation. Simulation results show that our proposed algorithm significantly saves system power consumption and receives the near-optimal revenue with an acceptable time complexity.
7 May 2012 in IEEE Communications Letters
In this paper, we consider a multiuser detection technique when the signal sparsity is changing over time. The key ingredient of our method is a clever switching between the CS reconstruction algorithm and classical detection depending on the sparsity level of the signals being detected. Since none of these approaches is uniformly better in a situation where the sparsity level is varying, proposed switching algorithm can effectively combine the merits of both. We show that the proposed switching algorithm provides substantial performance gain over individual algorithms in the multiuser detection of CDMA downlink.
12 March 2019 in IEEE Transactions on Communications
22 June 2018 in IEEE Transactions on Communications
Channel feedback is essential in frequency division duplexing (FDD) massive multiple-input multiple-output (MIMO) systems. Unfortunately, prior work on multiuser MIMO has shown that the feedback overhead scales linearly with the number of base station (BS) antennas, which is large in massive MIMO systems. To reduce the feedback overhead, we propose an angle-of-departure (AoD) adaptive subspace codebook for channel feedback in FDD massive MIMO systems. Our key insight is to leverage the observation that path AoDs vary more slowly than the path gains. Within the angle coherence time, by utilizing the constant AoD information, the proposed AoDadaptive subspace codebook is able to quantize the channel vector in a more accurate way. From the performance analysis, we show that the feedback overhead of the proposed codebook only scales linearly with a small number of dominant (path) AoDs instead of the large number of BS antennas. Moreover, we compare the proposed quantized feedback technique using the AoD-adaptive subspace codebook with a comparable analog feedback method. Extensive simulations show that the proposed AoD-adaptive subspace codebook achieves good channel feedback quality, while requiring low overhead.