Massive multiple-input multiple-output (MIMO) wireless communications refers to the idea equipping cellular base stations (BSs) with a very large number of antennas, and has been shown to potentially allow for orders of magnitude improvement in spectral and energy efficiency using relatively simple (linear) processing. In this paper, we present a comprehensive overview of state-of-the-art research on the topic, which has recently attracted considerable attention. We begin with an information theoretic analysis to illustrate the conjectured advantages of massive MIMO, and then we address implementation issues related to channel estimation, detection and precoding schemes. We particularly focus on the potential impact of pilot contamination caused by the use of non-orthogonal pilot sequences by users in adjacent cells. We also analyze the energy efficiency achieved by massive MIMO systems, and demonstrate how the degrees of freedom provided by massive MIMO systems enable efficient single-carrier transmission. Finally, the challenges and opportunities associated with implementing massive MIMO in future wireless communications systems are discussed.

/pdf/an-overview-of-massive-mimo-benefits-and-challenges-5e3yrz2gcj.pdf

An Overview of Massive MIMO: Benefits and Challenges

There is considerable pressure to define the key requirements of 5G, develop 5G standards, and perform technology trials as quickly as possible. Normally, these activities are best done in series but there is a desire to complete these tasks in parallel so that commercial deployments of 5G can begin by 2020. 5G will not be an incremental improvement over its predecessors; it aims to be a revolutionary leap forward in terms of data rates, latency, massive connectivity, network reliability, and energy efficiency. These capabilities are targeted at realizing high-speed connectivity, the Internet of Things, augmented virtual reality, the tactile internet, and so on. The requirements of 5G are expected to be met by new spectrum in the microwave bands (3.3-4.2 GHz), and utilizing large bandwidths available in mm-wave bands, increasing spatial degrees of freedom via large antenna arrays and 3-D MIMO, network densification, and new waveforms that provide scalability and flexibility to meet the varying demands of 5G services. Unlike the one size fits all 4G core networks, the 5G core network must be flexible and adaptable and is expected to simultaneously provide optimized support for the diverse 5G use case categories. In this paper, we provide an overview of 5G research, standardization trials, and deployment challenges. Due to the enormous scope of 5G systems, it is necessary to provide some direction in a tutorial article, and in this overview, the focus is largely user centric, rather than device centric. In addition to surveying the state of play in the area, we identify leading technologies, evaluating their strengths and weaknesses, and outline the key challenges ahead, with research test beds delivering promising performance but pre-commercial trials lagging behind the desired 5G targets.

5G : A tutorial overview of standards, trials, challenges, deployment, and practice

tions. Bootstrap has found many applications in engineering field, including artificial neural networks, biomedical engineering, environmental engineering, image processing, and radar and sonar signal processing. Basic concepts of the bootstrap are summarized in each section as a step-by-step algorithm for ease of implementation. Most of the applications are taken from the signal processing literature. The principles of the bootstrap are introduced in Chapter 2. Both the nonparametric and parametric bootstrap procedures are explained. Babu and Singh (1984) have demonstrated that in general, these two procedures behave similarly for pivotal (Studentized) statistics. The fact that the bootstrap is not the solution for all of the problems has been known to statistics community for a long time; however, this fact is rarely touched on in the manuscripts meant for practitioners. It was first observed by Babu (1984) that the bootstrap does not work in the infinite variance case. Bootstrap Techniques for Signal Processing explains the limitations of bootstrap method with an example. I especially liked the presentation style. The basic results are stated without proofs; however, the application of each result is presented as a simple step-by-step process, easy for nonstatisticians to follow. The bootstrap procedures, such as moving block bootstrap for dependent data, along with applications to autoregressive models and for estimation of power spectral density, are also presented in Chapter 2. Signal detection in the presence of noise is generally formulated as a testing of hypothesis problem. Chapter 3 introduces principles of bootstrap hypothesis testing. The topics are introduced with interesting real life examples. Flow charts, typical in engineering literature, are used to aid explanations of the bootstrap hypothesis testing procedures. The bootstrap leads to second-order correction due to pivoting; this improvement in the results due to pivoting is also explained. In the second part of Chapter 3, signal processing is treated as a regression problem. The performance of the bootstrap for matched filters as well as constant false-alarm rate matched filters is also illustrated. Chapters 2 and 3 focus on estimation problems. Chapter 4 introduces bootstrap methods used in model selection. Due to the inherent structure of the subject matter, this chapter may be difficult for nonstatisticians to follow. Chapter 5 is the most impressive chapter in the book, especially from the standpoint of statisticians. It provides real data bootstrap applications to illustrate the theory covered in the earlier chapters. These include applications to optimal sensor placement for knock detection and land-mine detection. The authors also provide a MATLAB toolbox comprising frequently used routines. Overall, this is a very useful handbook for engineers, especially those working in signal processing.

Probability and Random Processes

In recent years, deep neural networks have been successful in both industry and academia, especially for computer vision tasks. The great success of deep learning is mainly due to its scalability to encode large-scale data and to maneuver billions of model parameters. However, it is a challenge to deploy these cumbersome deep models on devices with limited resources, e.g., mobile phones and embedded devices, not only because of the high computational complexity but also the large storage requirements. To this end, a variety of model compression and acceleration techniques have been developed. As a representative type of model compression and acceleration, knowledge distillation effectively learns a small student model from a large teacher model. It has received rapid increasing attention from the community. This paper provides a comprehensive survey of knowledge distillation from the perspectives of knowledge categories, training schemes, teacher-student architecture, distillation algorithms, performance comparison and applications. Furthermore, challenges in knowledge distillation are briefly reviewed and comments on future research are discussed and forwarded.

Knowledge Distillation: A Survey

Approximate computing has recently emerged as a promising approach to energy-efficient design of digital systems. Approximate computing relies on the ability of many systems and applications to tolerate some loss of quality or optimality in the computed result. By relaxing the need for fully precise or completely deterministic operations, approximate computing techniques allow substantially improved energy efficiency. This paper reviews recent progress in the area, including design of approximate arithmetic blocks, pertinent error and quality measures, and algorithm-level techniques for approximate computing.

/pdf/approximate-computing-an-emerging-paradigm-for-energy-z7hetfdl3q.pdf

Approximate computing: An emerging paradigm for energy-efficient design

There is a trend that the functionalities of communication, computing, and caching (CC&C) are merging together in the future networks. Recently, this mergence is formed by the concept of cloud radio access network (C-RAN) with caching as a service (CaaS). In this paper, we dissect the interactions of CC&C in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e. computational and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool affects the short-term beamforming in the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP), and then approximate the problem as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a distributed fashion. Simulation results demonstrate the that the proposed scheme is more cost saving than that without considering the integration of CC&C.

Exploring the interactions of communication, computing and caching in cloud RAN under two timescale

Joint sparse recovery aims to reconstruct multiple sparse signals having a common support using multiple measurement vectors (MMV). In this paper, we propose a robust joint sparse recovery algorithm, termed MMV multiple orthogonal least squares (MMV-MOLS). Owing to the novel identification rule that fully exploits the correlation between the measurement vectors, MMV-MOLS greatly improves the accuracy of the recovered signals over the conventional joint sparse recovery techniques. From the simulation results, we show that MMV-MOLS outperforms conventional joint sparse recovery algorithms, in both full row rank and rank deficient scenarios. In our analysis, we show that MMV-MOLS recovers any row $K$ -sparse matrix accurately in the full row rank scenario with m = K + 1 measurements, which is, in fact, the minimum number of measurements to recover a row $K$ -sparse matrix. In addition, we analyze the performance guarantee of the MMV-MOLS algorithm in the rank deficient scenario using the restricted isometry property (RIP).

Multiple Orthogonal Least Squares for Joint Sparse Recovery

The problem of locating valid peaks from data corrupted by noise frequently arises while analyzing experimental data. In various biological and chemical data analysis tasks, peak detection thus constitutes a critical preprocessing step that greatly affects downstream analysis and eventual quality of experiments. Many existing techniques require the users to adjust parameters by trial and error, which is error-prone, time-consuming and often leads to incorrect analysis results. Worse, conventional approaches tend to report an excessive number of false alarms by finding fictitious peaks generated by mere noise. We have designed a novel peak detection method that can significantly reduce parameter sensitivity, yet providing excellent peak detection performance and negligible false alarm rates from gas chromatographic data. The key feature of our new algorithm is the successive use of peak enhancement algorithms that are deliberately designed for a gradual improvement of peak detection quality. We tested our approach with real gas chromatograms as well as intentionally contaminated spectra that contain Gaussian or speckle-type noise. Our results demonstrate that the proposed method can achieve near perfect peak detection performance while maintaining very small false alarm probabilities in case of gas chromatograms. Given the fact that biological signals appear in the form of peaks in various experimental data and that the propose method can easily be extended to such data, our approach will be a useful and robust tool that can help researchers highlight valid signals in their noisy measurements.

/pdf/nonlinear-preprocessing-method-for-detecting-peaks-from-gas-2gy16yyw9h.pdf

Nonlinear preprocessing method for detecting peaks from gas chromatograms

In this work, we propose a simple yet effective beam-forming technique for multiple-input multiple-output (MIMO) multi-pair two-way relay channels. Two key ingredients in our technique are adoption of signal space alignment (SSA) for transmit and receive beamforming and amplify-and-forward (AF) relay beamforming based on advanced zero-forcing (ZF) criterion. From the sum-rate analysis on MIMO multi-pair two-way relay channels, we show that the proposed method achieves full multiplexing gain and substantial beamforming gain in realistic multi-pair two-way relay scenario.

Byonghyo Shim

Papers

Exploring the interactions of communication, computing and caching in cloud RAN under two timescale

Multiple Orthogonal Least Squares for Joint Sparse Recovery

Nonlinear preprocessing method for detecting peaks from gas chromatograms

Joint transceiver and relay beamforming design for multi-pair two-way relay systems

Error -Tolerant Digital Signal Processing