Searcharxiv⌕ Search

arXiv subjects

Hui Gao

Publications and source records attributed to Hui Gao.

At least 73 records · Page 4Linked to original sources
arXiv2020

OTFS Based Receiver Scheme With Multi-Antennas in High-Mobility V2X Systems

Vehicle-to-everything (V2X) is considered as one of the most important applications of future wireless communication networks. However, the Doppler effect caused by the vehicle mobility may seriously deteriorate the performance of the vehicular communication links, especially when the channels exhibit a large number of Doppler frequency offsets (DFOs). Orthogonal time frequency space (OTFS) is a new waveform designed in the delay-Doppler domain, and can effectively convert a doubly dispersive channel into an almost non-fading channel, which makes it very attractive for V2X communications. In this paper, we design a novel OTFS based receiver with multi-antennas to deal with the high-mobility challenges in V2X systems. We show that the multiple DFOs associated with multipaths can be separated with the high-spatial resolution provided by multi-antennas, which leads to an enhanced sparsity of the OTFS channel in the delay-Doppler domain and bears a potential to reduce the complexity of the message passing (MP) detection algorithm. Based on this observation, we further propose a joint MP-maximum ration combining (MRC) iterative detection for OTFS, where the integration of MRC significantly improves the convergence performance of the iteration and gains an excellent system error performance. Finally, we provide numerical simulation results to corroborate the superiorities of the proposed scheme.

cs.IT↗
arXiv2020

Packing branchings under cardinality constraints on their root sets

Edmonds' fundamental theorem on arborescences characterizes the existence of $k$ pairwise arc-disjoint spanning arborescences with prescribed root sets in a digraph. In this paper, we study the problem of packing branchings in digraphs under cardinality constraints on their root sets by arborescence augmentation. Let $D=(V+x,A)$ be a digraph, $\mathcal{P}=$ $\{I_{1}, \ldots, I_{l} \}$ be a partition of $[k]$, $c_{1}, \ldots, c_{l}, c'_{1}, \ldots, c'_{l}$ be nonnegative integers such that $c_α \leq c'_α$ for $α\in [l]$, $F_{1}, \ldots, F_{k}$ be $k$ arc-disjoint $x$-arborescences in $D$ such that $\sum_{i \in I_α}d_{F_{i}}^{+}(x)$ $\leq c'_α$ for $α\in [l]$. We give a characterization on when $F_{1}, \ldots, F_{k}$ can be completed to arc-disjoint spanning $x$-arborescences $F^{*}_{1}, \ldots, F^{*}_{k}$ such that for any $α\in [l]$, $ c_α \leq \sum_{i \in I_α}d^{+}_{F^{*}_{i}}(x)$ $ \leq c'_α$.

math.CO↗
arXiv2019

Low-Complexity Linear Equalization for OTFS Systems with Rectangular Waveforms

Orthogonal time frequency space (OTFS) is a promising technology for high-mobility wireless communications. However, the equalization realization in practical OTFS systems is a great challenge when the non-ideal rectangular waveforms are adopted. In this paper, first of all, we theoretically prove that the effective channel matrix under rectangular waveforms holds the block-circulant property and the special Fourier transform structure with time-domain channel. Then, by exploiting the proved property and structure, we further propose the corresponding low-complexity algorithms for two mainstream linear equalization methods, i.e., zero-forcing (ZF) and minimum mean square error (MMSE). Compared with the existing direct-matrix-inversion-based equalization, the complexities can be reduced by a few thousand times for ZF and a few hundred times for MMSE without any performance loss, when the numbers of symbols and subcarriers are both 32 in OTFS systems.

cs.IT↗
arXiv2019

Dynamic high efficiency 3D meta-holography in visible range with large frames number and high frame rate based on space division multiplexing design

Hologram is an ideal method for naked eye three-dimensional (3D) display, and computer-generated holography (CGH) makes it possible to reconstruct virtual objects. However, the large pixel size of common CGH devices results in shortages in the applications of hologram, such as narrow field of view, twin images, multi-diffraction orders, et al. Meanwhile, metasurfaces consisted of subwavelength structures show great potential in controlling of light which is suitable for hologram design. There are many inspired works to achieve dynamic meta-hologram as we summary in this paper. And it can be concluded that there is still not such a research work of meta-holography with high efficiency and good display quality in the visible range that can show smooth holographic videos with a large frames number and high frame rate. In current work, we demonstrate a new design of meta-holography in visible range based on space division multiplexing metasurface which can achieve 228 different holographic frames and a very high frame rate (maximum of frame rate, 9523 FPS). Also, the metasurface consists of silicon nitride (SiNx) nanopillars with high efficiency (more than 70%). This method can not only satisfy the needs of holographic display but also be suitable for many different research fields, such as laser fabrication, photolithography, 3D forming of two-photon polymerization and optics information processing, et al.

physics.optics↗
arXiv2019

Low-Complexity Linear Equalizers for OTFS Exploiting Two-Dimensional Fast Fourier Transform

Orthogonal time frequency space (OTFS) modulation can effectively convert a doubly dispersive channel into an almost non-fading channel in the delay-Doppler domain. However, one critical issue for OTFS is the very high complexity of equalizers. In this letter, we first reveal the doubly block circulant feature of OTFS channel represented in the delay-Doppler domain. By exploiting this unique feature, we further propose zero-forcing (ZF) and minimum mean squared error (MMSE) equalizers that can be efficiently implemented with the two-dimensional fast Fourier transform. The complexity of our proposed equalizers is gracefully reduced from $\mathcal{O}\left(\left(NM\right)^{3}\right)$ to $\mathcal{O}\left(NM\mathrm{log_{2}}\left(NM\right)\right)$, where $N$ and $M$ are the number of OTFS symbols and subcarriers, respectively. Analysis and simulation results show that compared with other existing linear equalizers for OTFS, our proposed linear equalizers enjoy a much lower computational complexity without any performance loss.

cs.IT↗
arXiv2019

Wach models and overconvergence of étale $(φ, Γ)$-modules

A classical result of Cherbonnier and Colmez says that all étale $(φ, Γ)$-modules are overconvergent. In this paper, we give another proof of this fact when the base field $K$ is a finite extension of $\mathbb Q_p$. Furthermore, we obtain an explicit ("uniform") lower bound for the overconvergence radius, which was previously not known. The method is similar to that in a previous joint paper with Tong Liu. Namely, we study Wach models (when $K$ is unramified) in modulo $p^n$ Galois representations, and use them to build an overconvergence basis.

math.NT↗
arXiv2019

Crystalline liftings and weight part of Serre's conjecture

We prove some new cases of weight part of Serre's conjectures for mod $p$ Galois representations associated to automorphic representations on unitary groups $U(d)$. The approach is a generalization of the work of Gee-Liu-Savitt, namely, we study reductions of certain crystalline representations, as well as crystalline lifts of these reductions.

math.NT↗
arXiv2019

A note on crystalline liftings in the $\mathbb{Q}_p$ case

Let $p>2$ be a prime. Let $ρ$ be a crystalline representation of $G_{\mathbb{Q}_p}$ with distinct Hodge-Tate weights in $[0, p]$, such that its reduction $\overline ρ$ is upper triangular. Under certain conditions, we prove that $\overline ρ$ has an upper triangular crystalline lift $ρ'$ such that $\mathrm{HT}(ρ')=\mathrm{HT}(ρ)$. The method is based on the author's previous work, combined with an inspiration from the work of Breuil-Herzig.

math.NT↗
arXiv2019

Limit of torsion semi-stable Galois representations with unbounded weights

Let $K$ be a complete discrete valuation field of characteristic $(0, p)$ with perfect residue field, and let $T$ be an integral $\mathbb{Z}_p$-representation of $\mathrm{Gal}(\overline{K}/K)$. A theorem of T. Liu says that if $T/p^n T$ is torsion semi-stable (resp. crystalline) of uniformly bounded Hodge-Tate weights for all $n \geq 1$, then $T$ is also semi-stable (resp. crystalline). In this note, we show that we can relax the condition of "uniformly bounded Hodge-Tate weights" to an unbounded (log-)growth condition.

math.NT↗
arXiv2019

Fixed Region Beamforming using Frequency Diverse Subarray for Secure Mmwave Wireless Communications

Millimeter-wave (mmWave) using conventional phased array (CPA) enables highly directional and fixed angular beamforming (FAB), therefore enhancing physical layer security (PLS) in the angular domain. However, as the eavesdropper is located in the direction pointed by the mainlobe of the information-carrying beam, information leakage is inevitable and FAB cannot guarantee PLS performance. To address this threat, we propose a novel fixed region beamforming (FRB) by employing a frequency diverse subarray (FDSA) architecture to enhance the PLS performance for mmWave directional communications. In particular, we carefully introduce multiple frequency offset increments (FOIs) across subarrays to achieve a sophisticated beampattern synthesis that ensures a confined information transmission only within the desired angle-range region (DARR) in close vicinity of the target user. More specifically, we formulate the secrecy rate maximization problem with FRB over possible subarray FOIs, and consider two cases of interests, i.e., without/with the location information of eavesdropping, both turn out to be NP-hard. For the unknown eavesdropping location case, we propose a seeker optimization algorithm to minimize the maximum sidelobe peak of the beampattern outside the DARR. As for the known eavesdropping location case, a block coordinate descend linear approximation algorithm is proposed to minimize the sidelobe level in the eavesdropping region. By using the proposed FRB, the mainlobes of all subarrays are constructively superimposed in the DARR while the sidelobes are destructively overlayed outside the DARR. Therefore, FRB takes prominent effect on confining information transmission within the DARR. Numerical simulations demonstrate that the proposed FDSA-based FRB can provide superior PLS performance over the CPA-based FAB.

cs.IT↗
arXiv2019

Locally analytic vectors and overconvergent $(φ, τ)$-modules

Let $p$ be a prime, let $K$ be a complete discrete valuation field of characteristic $0$ with a perfect residue field of characteristic $p$, and let $G_K$ be the Galois group. Let $π$ be a fixed uniformizer of $K$, let $K_\infty$ be the extension by adjoining to $K$ a system of compatible $p^n$-th roots of $π$ for all $n$, and let $L$ be the Galois closure of $K_\infty$. Using these field extensions, Caruso constructs the $(φ, τ)$-modules, which classify $p$-adic Galois representations of $G_K$. In this paper, we study locally analytic vectors in some period rings with respect to the $p$-adic Lie group $\mathrm{Gal}(L/K)$, in the spirit of the work by Berger and Colmez. Using these locally analytic vectors, and using the classical overconvergent $(φ, Γ)$-modules, we can establish the overconvergence property of the $(φ, τ)$-modules.

math.NT↗
arXiv2019

Blind Channel Separation in Massive MIMO System under Pilot Spoofing and Jamming Attack

We consider a channel separation approach to counter the pilot attack in a massive MIMO system, where malicious users (MUs) perform pilot spoofing and jamming attack (PSJA) in uplink by sending symbols to the basestation (BS) during the channel estimation (CE) phase of the legitimate users (LUs). More specifically, the PSJA strategies employed by the MUs may include (i) sending the random symbols according to arbitrary stationary or non-stationary distributions that are unknown to the BS; (ii) sending the jamming symbols that are correlative to those of the LUs. We analyze the empirical distribution of the received pilot signals (ED-RPS) at the BS, and prove that its characteristic function (CF) asymptotically approaches to the product of the CFs of the desired signal (DS) and the noise, where the DS is the product of the channel matrix and the signal sequences sent by the LUs/MUs. These observations motivate a novel two-step blind channel separation method, wherein we first estimate the CF of DS from the ED-RPS and then extract the alphabet of the DS to separate the channels. Both analysis and simulation results show that the proposed method achieves good channel separation performance in massive MIMO systems.

cs.IT↗
arXiv2018

Loose crystalline lifts and overconvergence of étale $(φ, τ)$-modules

Let $p$ be a prime, $K$ a finite extension of $\mathbb Q_p$, and let $G_K$ be the absolute Galois group of $K$. The category of étale $(φ, τ)$-modules is equivalent to the category of $p$-adic Galois representations of $G_K$. In this paper, we show that all étale $(φ, τ)$-modules are overconvergent; this answers a question of Caruso. Our result is an analogy of the classical overconvergence result of Cherbonnier and Colmez in the setting of étale $(φ, Γ)$-modules. However, our method is completely different from theirs. Indeed, we first show that all $p$-power-torsion representations admit loose crystalline lifts; this allows us to construct certain Kisin models in these torsion representations. We study the structure of these Kisin models, and use them to build an overconvergence basis.

math.NT↗
arXiv2018

Deep sub-Ångstrom imaging of 2D materials with a high dynamic range detector

Aberration-corrected optics have made electron microscopy at atomic-resolution a widespread and often essential tool for nanocharacterization. Image resolution is dominated by beam energy and the numerical aperture of the lens (α), with state-of-the-art reaching ~0.47 Å at 300 keV. Two-dimensional materials are imaged at lower beam energies to avoid knock-on damage, limiting spatial resolution to ~1 Å. Here, by combining a new electron microscope pixel array detector with the dynamic range to record the complete distribution of transmitted electrons and full-field ptychography to recover phase information from the full phase space, we increased the spatial resolution well beyond the traditional lens limitations. At 80 keV beam energy, our ptychographic reconstructions significantly improved image contrast of single-atom defects in MoS2, reaching an information limit close to 5α, corresponding to a 0.39 Å Abbe resolution, at the same dose and imaging conditions where conventional imaging modes reach only 0.98 Å.

cond-mat.mtrl-sci↗
arXiv2017

Absence of a Band Gap at Interface of a Metal and Highly Doped Monolayer $MoS_2$

High quality electrical contact to semiconducting transition metal dichalcogenides (TMDCs) such as $MoS_2$ is key to unlocking their unique electronic and optoelectronic properties for fundamental research and device applications. Despite extensive experimental and theoretical efforts reliable ohmic contact to doped TMDCs remains elusive and would benefit from a better understanding of the underlying physics of the metal-TMDC interface. Here we present measurements of the atomic-scale energy band diagram of junctions between various metals and heavily doped monolayer $MoS_2$ using ultra-high vacuum scanning tunneling microscopy (UHV-STM). Our measurements reveal that the electronic properties of these junctions are dominated by 2D metal induced gap states (MIGS). These MIGS are characterized by a spatially growing measured gap in the local density of states (L-DOS) of the $MoS_2$ within 2 nm of the metal-semiconductor interface. Their decay lengths extend from a minimum of ~0.55 nm near mid gap to as long as 2 nm near the band edges and are nearly identical for Au, Pd and graphite contacts, indicating that it is a universal property of the monolayer semiconductor. Our findings indicate that even in heavily doped semiconductors, the presence of MIGS sets the ultimate limit for electrical contact.

cond-mat.mtrl-sci↗
arXiv2017

Two bounds for generalized $3$-connectivity of Cartesian product graphs

The generalized $k$-connectivity $κ_{k}(G)$ of a graph $G$, which was introduced by Chartrand et al.(1984) is a generalization of the concept of vertex connectivity. Let $G$ and $H$ be nontrivial connected graphs. Recently, Li et al. gave a lower bound for the generalized $3$-connectivity of the Cartesian product graph $G \square H$ and proposed a conjecture for the case that $H$ is $3$-connected. In this paper, we give two different forms of lower bounds for the generalized $3$-connectivity of Cartesian product graphs. The first lower bound is stronger than theirs, and the second confirms their conjecture.

math.CO↗
arXiv2017

Promoting information spreading by using contact memory

Promoting information spreading is a booming research topic in network science community. However, the exiting studies about promoting information spreading seldom took into account the human memory, which plays an important role in the spreading dynamics. In this paper we propose a non-Markovian information spreading model on complex networks, in which every informed node contacts a neighbor by using the memory of neighbor's accumulated contact numbers in the past. We systematically study the information spreading dynamics on uncorrelated configuration networks and a group of $22$ real-world networks, and find an effective contact strategy of promoting information spreading, i.e., the informed nodes preferentially contact neighbors with small number of accumulated contacts. According to the effective contact strategy, the high degree nodes are more likely to be chosen as the contacted neighbors in the early stage of the spreading, while in the late stage of the dynamics, the nodes with small degrees are preferentially contacted. We also propose a mean-field theory to describe our model, which qualitatively agrees well with the stochastic simulations on both artificial and real-world networks.

physics.soc-ph↗