arXiv subjects

Tao Jiang

Publications and source records attributed to Tao Jiang.

At least 289 records · Page 16Linked to original sources

arXiv2018

Spatial Lobes Division Based Low Complexity Hybrid Precoding and Diversity Combining for mmWave IoT Systems

This paper focuses on the design of low complexity hybrid analog/digital precoding and diversity combining in millimeter wave (mmWave) Internet of things (IoT) systems. Firstly, by exploiting the sparseness property of the mmWave in the angular domain, we propose a spatial lobes division (SLD) to group the total paths of the mmWave channel into several spatial lobes, where the paths in each spatial lobe form a low-rank sub-channel. Secondly, based on the SLD operation, we propose a low complexity hybrid precoding scheme, named HYP-SLD. Specifically, for each low-rank sub-channel, we formulate the hybrid precoding design as a sparse reconstruction problem and separately maximizes the spectral efficiency. Finally, we further propose a maximum ratio combining based diversity combining scheme, named HYP-SLD-MRC, to improve the bit error rate (BER) performance of mmWave IoT systems. Simulation results demonstrate that, the proposed HYP-SLD scheme significantly reduces the complexity of the classic orthogonal matching pursuit (OMP) scheme. Moreover, the proposed HYP-SLD-MRC scheme achieves great improvement in BER performance compared with the fully digital precoding scheme.

cs.IT↗

arXiv2018

SVM-Based Sea-Surface Small Target Detection: A False-Alarm-Rate-Controllable Approach

In this letter, we consider the varying detection environments to address the problem of detecting small targets within sea clutter. We first extract three simple yet practically discriminative features from the returned signals in the time and frequency domains and then fuse them into a 3-D feature space. Based on the constructed space, we then adopt and elegantly modify the support vector machine (SVM) to design a learning-based detector that enfolds the false alarm rate (FAR). Most importantly, our proposed detector can flexibly control the FAR by simply adjusting two introduced parameters, which facilitates to regulate detector's sensitivity to the outliers incurred by the sea spikes and to fairly evaluate the performance of different detection algorithms. Experimental results demonstrate that our proposed detector significantly improves the detection probability over several existing classical detectors in both low signal to clutter ratio (SCR) (up to 58%) and low FAR (up to 40%) cases.

cs.IT↗

arXiv2018

ShieldScatter: Improving IoT Security with Backscatter Assistance

The lightweight protocols and low-power radio technologies open up many opportunities to facilitate Internet-of-Things (IoT) into our daily life, while their minimalist design also makes IoT devices vulnerable to many active attacks due to the lack of sophisticated security protocols. Recent advances advocate the use of an antenna array to extract fine-grained physical-layer signatures to mitigate these active attacks. However, it adds burdens in terms of energy consumption and hardware cost that IoT devices cannot afford. To overcome this predicament, we present ShieldScatter, a lightweight system that attaches battery-free backscatter tags to single-antenna devices to shield the system from active attacks. The key insight of ShieldScatter is to intentionally create multi-path propagation signatures with the careful deployment of backscatter tags. These signatures can be used to construct a sensitive profile to identify the location of the signals' arrival, and thus detect the threat. We prototype ShieldScatter with USRPs and ambient backscatter tags to evaluate our system in various environments. The experimental results show that even when the attacker is located only 15 cm away from the legitimate device, ShieldScatter with merely three backscatter tags can mitigate 97% of spoofing attack attempts while at the same time trigger false alarms on just 7% of legitimate traffic.

cs.CR↗

arXiv2018

Underwater Anchor-AUV Localization Geometries with an Isogradient Sound Speed Profile: A CRLB-Based Optimality Analysis

Existing works have explored the anchor deployment for autonomous underwater vehicles (AUVs) localization under the assumption that the sound propagates straightly underwater at a constant speed. Considering that the underwater acoustic waves propagate along bent curves at varying speeds in practice, it becomes much more challenging to determine a proper anchor deployment configuration. In this paper, taking the practical variability of underwater sound speed into account, we investigate the anchor-AUV geometry problem in a 3-D time-of-flight (ToF) based underwater scenario from the perspective of localization accuracy. To address this problem, we first rigorously derive the Jacobian matrix of measurement errors to quantify the Cramer-Rao lower bound (CRLB) with a widely-adopted isogradient sound speed profile (SSP). We then formulate an optimization problem that minimizes the trace of the CRLB subject to the angle and range constraints to figure out the anchor-AUV geometry, which is multivariate and nonlinear and thus generally hard to handle. For mathematical tractability, by adopting tools from the estimation theory, we interestingly find that this problem can be equivalently transformed into a more explicit univariate optimization problem. By this, we obtain an easy-to-implement anchor-AUV geometry that yields satisfactory localization performance, referred to as the uniform sea-surface circumference (USC) deployment. Extensive simulation results validate our theoretical analysis and show that our proposed USC scheme outperforms both the cube and the random deployment schemes in terms of localization accuracy under the same parameter settings.

cs.IT↗

arXiv2018

Joint Activity Detection and Channel Estimation for IoT Networks: Phase Transition and Computation-Estimation Tradeoff

Massive device connectivity is a crucial communication challenge for Internet of Things (IoT) networks, which consist of a large number of devices with sporadic traffic. In each coherence block, the serving base station needs to identify the active devices and estimate their channel state information for effective communication. By exploiting the sparsity pattern of data transmission, we develop a structured group sparsity estimation method to simultaneously detect the active devices and estimate the corresponding channels. This method significantly reduces the signature sequence length while supporting massive IoT access. To determine the optimal signature sequence length, we study \emph{the phase transition behavior} of the group sparsity estimation problem. Specifically, user activity can be successfully estimated with a high probability when the signature sequence length exceeds a threshold; otherwise, it fails with a high probability. The location and width of the phase transition region are characterized via the theory of conic integral geometry. We further develop a smoothing method to solve the high-dimensional structured estimation problem with a given limited time budget. This is achieved by sharply characterizing the convergence rate in terms of the smoothing parameter, signature sequence length and estimation accuracy, yielding a trade-off between the estimation accuracy and computational cost. Numerical results are provided to illustrate the accuracy of our theoretical results and the benefits of smoothing techniques.

cs.IT↗

arXiv2018

Multiple Preambles for High Success Rate of Grant-Free Random Access with Massive MIMO

Grant-free random access (RA) with massive MIMO is a promising RA technique with low signaling overhead that provides significant benefits in increasing the channel reuse efficiency. Since user equipment (UE) detection and channel estimation in grant-free RA rely solely on the received preambles, preamble designs that enable high success rate of UE detection and channel estimation are very much in need to ensure the performance gain of grant-free RA with massive MIMO. In this paper, a super preamble consisting of multiple consecutive preambles is proposed for high success rate of grant-free RA with massive MIMO. With the proposed approach, the success of UE detection and channel estimation for a RA UE depends on two conditions: 1) it is a solvable UE; 2) its super preamble is detected. Accordingly, we theoretically analyze the solvable rate of RA UEs with multiple preambles and propose a reliable UE detection algorithm to obtain the super preambles of RA UEs by exploiting the quasi-orthogonality characteristic of massive MIMO. Theoretical analysis and simulation results show that turning a preamble into a super preamble consisting of two or three shorter preambles, the success rate of UE detection and channel estimation could be significantly increased using the proposed approach.

cs.IT↗

arXiv2018

Sea Clutter Distribution Modeling: A Kernel Density Estimation Approach

An accurate sea clutter distribution is crucial for decision region determination when detecting sea-surface floating targets. However, traditional parametric models possibly have a considerable gap to the realistic distribution of sea clutters due to the volatile sea states. In this paper, we develop a kernel density estimation based framework to model the sea clutter distributions without requiring any prior knowledge. In this framework, we jointly consider two embedded fundamental problems, the selection of a proper kernel density function and the determination of its corresponding optimal bandwidth. Regarding these two problems, we adopt the Gaussian, Gamma, and Weibull distributions as the kernel functions, and derive the closed-form optimal bandwidth equations for them. To deal with the highly complicated equations for the three kernels, we further design a fast iterative bandwidth selection algorithm to solve them. Experimental results show that, compared with existing methods, our proposed approach can significantly decrease the error incurred by sea clutter modeling (about two orders of magnitude reduction) and improve the target detection probability (up to $36\%$ in low false alarm rate cases).

stat.AP↗

arXiv2018

Spectral Efficiency Analysis of Multi-Cell Massive MIMO Systems with Ricean Fading

This paper investigates the spectral efficiency of multi-cell massive multiple-input multiple-output systems with Ricean fading that utilize the linear maximal-ratio combining detector. We firstly present closed-form expressions for the effective signal-to-interference-plus-noise ratio (SINR) with the least squares and minimum mean squared error (MMSE) estimation methods, respectively, which apply for any number of base-station antennas $M$ and any Ricean $K$-factor. Also, the obtained results can be particularized in Rayleigh fading conditions when the Ricean $K$-factor is equal to zero. In the following, novel exact asymptotic expressions of the effective SINR are derived in the high $M$ and high Ricean $K$-factor regimes. The corresponding analysis shows that pilot contamination is removed by the MMSE estimator when we consider both infinite $M$ and infinite Ricean $K$-factor, while the pilot contamination phenomenon persists for the rest of cases. All the theoretical results are verified via Monte-Carlo simulations.

cs.IT↗

arXiv2018

Enabling Covariance-Based Feedback in Massive MIMO: A User Classification Approach

In this paper, we propose a novel channel feedback scheme for frequency division duplexing massive multi-input multi-output systems. The concept uses the notion of user statistical separability which was hinted in several prior works in the massive antenna regime but not fully exploited so far. We here propose a hybrid statistical-instantaneous feedback scheme based on a user classification mechanism where the classification metric derives from a rate bound analysis. According to classification results, a user either operates on a statistical feedback mode or instantaneous mode. Our results illustrate the sum rate advantages of our scheme under a global feedback overhead constraint.

cs.IT↗

arXiv2018

Authenticating On-Body Backscatter by Exploiting Propagation Signatures

The vision of battery-free communication has made backscatter a compelling technology for on-body wearable and implantable devices. Recent advances have facilitated the communication between backscatter tags and on-body smart devices. These studies have focused on the communication dimension, while the security dimension remains vulnerable. It has been demonstrated that wireless connectivity can be exploited to send unauthorized commands or fake messages that result in device malfunctioning. The key challenge in defending these attacks stems from the minimalist design in backscatter. Thus, in this paper, we explore the feasibility of authenticating an on-body backscatter tag without modifying its signal or protocol. We present SecureScatter, a physical-layer solution that delegates the security of backscatter to an on-body smart device. To this end, we profile the on-body propagation paths of backscatter links, and construct highly sensitive propagation signatures to identify on-body backscatter links. We implement our design in a software radio and evaluate it with different backscatter tags that work at 2.4 GHz and 900 MHz. Results show that our system can identify on-body devices at 93.23% average true positive rate and 3.18% average false positive rate.

cs.HC↗

arXiv2018

On the almost decrease of a subexponential density

For a subexponential density, so far, there has been no positive conclusion or counter example to show whether it is almost decreasing. In this paper, a subexponential density supported on $\mathbb{R}^+\cup\{0\}$ without the almost decrease is constructed by a little skillful method. The density is a positive piecewise linear function with a more normal shape. Correspondingly, there exists a local subexponential distribution which is not locally almost decreasing. Based on an example of Cline \cite{C1986}, some similar results are also obtained for the long-tailed density excluding the subexponential density and the local long-tailed distribution excluding the local subexponential distribution. Finally, the paper shows that, for the local subexponentiality of a distribution supported on $\mathbb{R}$, the local almost decreasing condition is necessary in some sense.

math.PR↗

arXiv2018

On Secure Transmission Design: An Information Leakage Perspective

Information leakage rate is an intuitive metric that reflects the level of security in a wireless communication system, however, there are few studies taking it into consideration. Existing work on information leakage rate has two major limitations due to the complicated expression for the leakage rate: 1) the analytical and numerical results give few insights into the trade-off between system throughput and information leakage rate; 2) and the corresponding optimal designs of transmission rates are not analytically tractable. To overcome such limitations and obtain an in-depth understanding of information leakage rate in secure wireless communications, we propose an approximation for the average information leakage rate in the fixed-rate transmission scheme. Different from the complicated expression for information leakage rate in the literature, our proposed approximation has a low-complexity expression, and hence, it is easy for further analysis. Based on our approximation, the corresponding approximate optimal transmission rates are obtained for two transmission schemes with different design objectives. Through analytical and numerical results, we find that for the system maximizing throughput subject to information leakage rate constraint, the throughput is an upward convex non-decreasing function of the security constraint and much too loose security constraint does not contribute to higher throughput; while for the system minimizing information leakage rate subject to throughput constraint, the average information leakage rate is a lower convex increasing function of the throughput constraint.

cs.CR↗

arXiv2018

Extremal problems on ordered and convex geometric hypergraphs

An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich history with applications to a variety of problems in combinatorial geometry. In this paper, we consider analogous extremal problems for uniform hypergraphs, and discover a general partitioning phenomenon which allows us to determine the order of magnitude of the extremal function for various ordered and convex geometric hypergraphs. A special case is the ordered $n$-vertex $r$-graph $F$ consisting of two disjoint sets $e$ and $f$ whose vertices alternate in the ordering. We show that for all $n \geq 2r + 1$, the maximum number of edges in an ordered $n$-vertex $r$-graph not containing $F$ is exactly \[ {n \choose r} - {n - r \choose r}.\] This could be considered as an ordered version of the Erdős-Ko-Rado Theorem, and generalizes earlier results of Capoyleas and Pach and Aronov-Dujmovič-Morin-Ooms-da Silveira.

math.CO↗

arXiv2018

Few-femtosecond Electron Beam with THz-frequency Wakefield-driven Compression

We propose and demonstrate a novel method to produce few-femtosecond electron beam with relatively low timing jitter. In this method a relativistic electron beam is compressed from about 150 fs (rms) to about 7 fs (rms, upper limit) with the wakefield at THz frequency produced by a leading drive beam in a dielectric tube. By imprinting the energy chirp in a passive way, we demonstrate through laser-driven THz streaking technique that no additional timing jitter with respect to an external laser is introduced in this bunch compression process, a prominent advantage over the conventional method using radio-frequency bunchers. We expect that this passive bunching technique may enable new opportunities in many ultrashort-beam based advanced applications such as ultrafast electron diffraction and plasma wakefield acceleration.

physics.acc-ph↗

arXiv2018

Virtual Carrier Sensing Based Random Access in Massive MIMO Systems

The 5th generation mobile communication systems aim to support massive access for future wireless applications. Unfortunately, wireless resource scarcity in random access (RA) is a fundamental bottleneck for enabling massive access. To address this problem, we propose a virtual carrier sensing (VCS) based RA scheme in massive MIMO systems. The essence of the proposed scheme lies in exploiting wireless spatial resources of uplink channels occupied by assigned user equipments (UEs) to increase channel resources for RA. With the proposed scheme, RA UEs are able to exploit the spatial resources that are approximately orthogonal to those of assigned UEs, thus sharing the uplink channel resource with assigned UEs without causing significant interference to them. Specifically, to ensure RA UEs avoid serious interference with assigned UEs, base station (BS) sends tailored virtual carriers to RA UEs on behalf of assigned UEs. RA UEs then conduct VCS to determine whether or not the uplink channel resource is available for RA. Closed-form approximations for probability of channel availability and uplink achievable rate with the proposed scheme are derived. Theoretical analysis and simulation results show that the proposed scheme is able to significantly increase channel resources of RA for massive access.

cs.IT↗

arXiv2018

Smoothed SVD-based Beamforming for FBMC/OQAM Systems Based on Frequency Spreading

The combination of singular value decomposition (SVD)-based beamforming and filter bank multicarrier with offset quadrature amplitude modulation (FBMC/OQAM) has not been successful to date. The difficulty of this combination is that, the beamformers may experience significant changes between adjacent subchannels, therefore destroy the orthogonality among FBMC/OQAM real-valued symbols, even under channels with moderate frequency selectivity. In this paper, we address this problem from two aspects: i) an SVD-FS-FBMC architecture is adopted to support beamforming with finer granularity in frequency domain, based on the frequency spreading FBMC (FS-FBMC) structure, i.e., beamforming on FS-FBMC tones rather than on subchannels; ii) criterion and methods are proposed to smooth the beamformers from tone to tone. The proposed finer beamforming and smoothing greatly improve the smoothness of beamformers, therefore effectively suppress the leaked ICI/ISI. Simulations are conducted under the scenario of IEEE 802.11n wireless LAN. Results show that the proposed SVD-FS-FBMC system shares close BER performance with its orthogonal frequency division multiplexing (OFDM) counterpart under the frequency selective channels.

eess.SP↗

arXiv2018

On Turán exponents of bipartite graphs

A long-standing conjecture of Erdős and Simonovits asserts that for every rational number $r\in (1,2)$ there exists a bipartite graph $H$ such that $\ex(n,H)=Θ(n^r)$. So far this conjecture is known to be true only for rationals of form $1+1/k$ and $2-1/k$, for integers $k\geq 2$. In this paper we add a new form of rationals for which the conjecture is true; $2-2/(2k+1)$, for $k\geq 2$. This in its turn also gives an affirmative answer to a question of Pinchasi and Sharir on cube-like graphs. Recently, a version of Erdős and Simonovits's conjecture where one replaces a single graph by a family, was confirmed by Bukh and Conlon. They proposed a construction of bipartite graphs which should satisfy Erdős and Simonovits's conjecture. Our result can also be viewed as a first step towards verifying Bukh and Conlon's conjecture. We also prove the an upper bound on the Turán's number of $θ$-graphs in an asymmetric setting and employ this result to obtain yet another new rational exponent for Turán exponents; $r=7/5$.

math.CO↗

arXiv2018

Success Probability of Grant-Free Random Access with Massive MIMO

Massive MIMO opens up new avenues for enabling highly efficient random access (RA) by offering abundance of spatial degrees of freedom. In this paper, we investigate the grant-free RA with massive MIMO and derive the analytic expressions of success probability of the grant-free RA for conjugate beamforming and zero-forcing beamforming techniques.With the derived analytic expressions, we further shed light on the impact of system parameters on the success probability. Simulation results verify the accuracy of the analyses. It is confirmed that the grant-free RA with massive MIMO is an attractive RA technique with low signaling overhead that could simultaneously accommodate a number of RA users, which is multiple times the number of RA channels, with close-to-one success probability. In addition, when the number of antennas in massive MIMO is sufficiently large, we show that the number of orthogonal preambles would dominate the success probability.

cs.IT↗