Person:

Kung, H.

This paper presents the design of MIMO/CON (“MIMO with concurrent channel access and estimation”), a PHY/MAC cross-layer design delivering throughput scalable to many users for multiuser MIMO wireless networking. By allowing concurrent launches of multiple data transmissions from multiple users, MIMO/CON can fully realize the capacity gain of a multi-antenna MIMO system. Using compressive sensing, MIMO/CON simultaneously estimates channel state information (CSI) of multiple channels from concurrently received preambles. Furthermore, MIMO/CON can boost channel utilization by allowing concurrent transmissions to exceed receive antennas momentarily. MIMO/CON has been implemented and evaluated on a lab testbed with software-defined radios. Further, simulation results suggest that MIMO/CON can achieve an improvement by up to 210% in MAC throughput over existing staggered access protocols in a 5×5 MIMO scenario.

Incorporating wireless transceivers with numerous antennas (such as Massive-MIMO) is a prospective way to increase the link capacity or enhance the energy efficiency of future communication systems. However, the benefits of such approach can be realized only when proper channel information is available at the transmitter. Since the amount of the channel information required by the transmitter is large with so many antennas, the feedback is arduous in practice, especially for frequency division duplexing (FDD) systems. This paper proposes channel feedback reduction techniques based on the theory of compressive sensing, which permits the transmitter to obtain channel information with acceptable accuracy under substantially reduced feedback load. Furthermore, by leveraging properties of compressive sensing, we present two adaptive feedback protocols, in which the feedback content can be dynamically configured based on channel conditions to improve the efficiency.

Continuous fine-grain status monitoring of a cloud data center enables rapid response to anomalies, but handling the resulting torrent of data poses a significant challenge. As a solution, we propose CloudSense, a new switch design that performs in-network compression of status streams via compressive sensing. Using MapReduce straggler detection as an example of cloud monitoring, we give evidence that CloudSense allows earlier detection of stragglers, since finer-grain status can be reported for a given bandwidth budget. Furthermore, CloudSense showcases the advantage of an intrinsic property of compressive sensing decoding that enables detection of the slowest stragglers first. Finally, CloudSense achieves in-network compression via a low-complexity encoding scheme, which is easy and convenient to implement in a switch. We envision that CloudSense switches could form the foundation of a "compressed status information plane" that is useful for monitoring not only the cloud data center itself, but also the user applications that it hosts.

Compressive sensing has gained momentum in recent years as an exciting new theory in signal processing with several useful applications. It states that signals known to have a sparse representation may be encoded and later reconstructed using a small number of measurements, approximately proportional to the signal s sparsity rather than its size. This paper addresses a critical problem that arises when scaling compressive sensing to signals of large length: that the time required for decoding becomes prohibitively long, and that decoding is not easily parallelized. We describe a method for partitioned compressive sensing, by which we divide a large signal into smaller blocks that may be decoded in parallel. However, since this process requires a signi cant increase in the number of measurements needed for exact signal reconstruction, we focus on mitigating artifacts that arise due to partitioning in approximately reconstructed signals. Given an error-prone partitioned decoding, we use large magnitude components that are detected with highest accuracy to in uence the decoding of neighboring blocks, and call this approach neighbor-weighted decoding. We show that, for applications with a prede ned error threshold, our method can be used in conjunction with partitioned compressive sensing to improve decoding speed, requiring fewer additional measurements than unweighted or locally-weighted decoding.

We present compressed statistical testing (CST) with an illustrative application to radar target detection. We characterize an optimality condition for a compressed domain test to yield the same result as the corresponding test in the uncompressed domain. We demonstrate by simulation that under high SNR, a likelihood ratio test with compressed samples at 3.3x or even higher compression ratio can achieve detection performance comparable to that with uncompressed data. For example, our compressed domain Sample Matrix Inversion test for radar target detection can achieve constant false alarm rate (CFAR) performance similar to the corresponding test in the raw data domain. By exploiting signal sparsity in the target and interference returns, compressive sensing based CST can incur a much lower processing cost in statistical training and decision making, and can therefore enable a variety of distributed applications such as target detection on resource limited mobile devices.

We propose a medium access control (MAC) protocol for wireless local area networks (LANs) that leverages the theory of compressive sensing. The proposed compressive sensing MAC (CS-MAC) exploits the sparse property that, at a given time, only a few hosts are expected to request for radio channel access. Under CS-MAC, a central coordinator, such as a wireless access point (AP) can recover a multitude of these requests in one decoding operation, and then schedule multiple hosts accordingly. The coordinator is only required to receive a relatively small number of random projections of host requests, rather than polling individual hosts. This results in an efficient request-grant method. Via a hardware prototype based on a software-de ned radio platform, we demonstrate the feasibility of realizing CS-MAC with compressive measurements formed in the air to achieve high efficiency.

We describe a method of integrating Karhunen-Loève Transform (KLT) into compressive sensing, which can as a result improve the compression ratio without affecting the accuracy of decoding. We present two complementary results: 1) by using KLT to find an optimal basis for decoding we can drastically reduce the number of measurements for compressive sensing used in applications such as radio spectrum analysis; 2) by using compressive sensing we can estimate and recover the KLT basis from compressive measurements of an input signal. In particular, we propose CS-KLT, an online estimation algorithm to cope with nonstationarity of wireless channels in reality. We validate our results with empirical data collected from a wideband UHF spectrum and eld experiments to detect multiple radio transmitters, using software-defined radios.

We present a chip architecture for a compressive sensing based method that can be used in conjunction with the JTAG standard to detect IC Trojans. The proposed architecture compresses chip output resulting from a large number of test vectors applied to a circuit under test (CUT). We describe our designs in sensing leakage power, computing random linear combinations under compressive sensing, and piggybacking these new functionalities on JTAG. Our architecture achieves approximately a 10× speedup and 1000× reduction in output bandwidth while incurring a small area overhead.

Detecting Trojans in an integrated circuit (IC) is an important but hard problem. A Trojan is malicious hardware it can be extremely small in size and dormant until triggered by some unknown circuit state. To allow wake-up, a Trojan could draw a minimal amount of power, for example, to run a clock or a state machine, or to monitor a triggering event. We introduce DISTROY (Discover Trojan), a new approach that can effciently and reliably detect extremely small background power leakage that a Trojan creates and as a result, we can detect the Trojan. We formulate our method based on compressive sensing, a recent advance in signal processing, which can recover a signal using the number of measurements approximately proportional to its sparsity rather than size. We argue that circuit states in which the Trojan background power consumption stands out are rare, and thus sparse, so that we can apply compressive sensing. We describe how this is done in DISTROY so as to afford suffcient measurement statistics to detect the presence of Trojans. Finally, we present our initial simulation results that validate DISTROY and discuss the impact of our work in the field of hardware security.

Spectrum sensing is of fundamental importance to many wireless applications including cognitive radio channel assignment and radiolocation. However, conventional spectrum sensing can be prohibitively expensive in computation and network bandwidth when the bands under scanning are wide and highly contested. In this paper we propose distributed spectrum sensing with multiple sensing nodes in a UAV environment. The ground nodes in our scheme sense the spectrum in parallel using compressive sensing. Each sensor node transmits compressive measurements to a nearby UAV in the air. The UAV performs decoding on the received measurements; it decodes information with increasing resolution as it receives more measurements. Furthermore, by a property of compressive sensing decoding, frequencies of large magnitude responses are recovered first. In the proposed scheme, as soon as the UAV detects the presence of such high-power frequencies from a sensor, this information is used to aid decoding for other sensors. We argue that such collaboration enabled by UAV will greatly enhance the decoding accuracy of compressive sensing. We use packet-loss traces acquired in UAV flight experiments in the field, as well as field experiments involving software-defined radios, to validate the effectiveness of this distributed compressive sensing approach.