arXiv subjects

Xin Su

Publications and source records attributed to Xin Su.

90 records · Page 5Linked to original sources

arXiv2023

Fast Online Adaptive Enrichment for Poroelasticity with High Contrast

In this work, we develop an online adaptive enrichment method within the framework of the Constraint Energy Minimizing Generalized Multiscale Finite Element Method (CEM-GMsFEM) for solving the linear heterogeneous poroelasticity models with coefficients of high contrast. The proposed method makes use of information of residual-driven error indicators to enrich the multiscale spaces for both the displacement and the pressure variables in the model. Additional online basis functions are constructed in oversampled regions accordingly and are adaptively chosen to reduce the error the most. A complete theoretical analysis of the online enrichment algorithm is provided and justified by thorough numerical experiments.

math.NA↗

arXiv2022

Reconfigurable Refractive Surfaces: An Energy-Efficient Way to Holographic MIMO

Holographic Multiple Input Multiple Output (HMIMO), which integrates massive antenna elements into a compact space to achieve a spatially continuous aperture, plays an important role in future wireless networks. With numerous antenna elements, it is hard to implement the HMIMO via phased arrays due to unacceptable power consumption. To address this issue, reconfigurable refractive surface (RRS) is an energy efficient enabler of HMIMO since the surface is free of expensive phase shifters. Unlike traditional metasurfaces working as passive relays, the RRS is used as transmit antennas, where the far-field approximation does not hold anymore, urging a new performance analysis framework. In this letter, we first derive the data rate of an RRS-based single-user downlink system, and then compare its power consumption with the phased array. Simulation results verify our analysis and show that the RRS is an energy-efficient way to HMIMO.

cs.IT↗

arXiv2022

System-level Simulation of Reconfigurable Intelligent Surface assisted Wireless Communications System

Reconfigurable intelligent surface (RIS) is an emerging technique employing metasurface to reflect the signal from the source node to the destination node. By smartly reconfiguring the electromagnetic (EM) properties of the metasurface and adjusting the EM parameters of the reflected radio waves, RIS can turn the uncontrollable propagation environment into an artificially reconfigurable space, and thus, can significantly increase the communications capacity and improve the coverage of the system. In this paper, we investigate the far field channel in which the line-of-sight (LOS) propagation is dominant. We propose an antenna model that can characterize the radiation patterns of realistic RIS elements, and consider the signal power received from the two-hop path through RIS. System-level simulations of network performance under various scenarios and parameter.

cs.IT↗

arXiv2022

Nonlinear dissipation induced photon blockade

We theoretically propose a scheme for photon blockade in a cavity quantum electrodynamical system consisting of an N-type atomic medium interacting with a single-mode Fabry-Perot cavity. In contrast to inefficient nonlinear-dispersion-induced photon blockade suppressed by a large detuning, the photon blockade in our scheme is induced by a large nonlinear dissipation of the cavity created by the N-type atomic system. A deep photon blockade is manifested with a vanishing equal-time second-order correlation function within the cavity linewidth. This work provides an efficient photon blockade because it work in the near-resonance case.

quant-ph↗

arXiv2021

Nonreciprocal single-photon band structure

We study single-photon band structure in a one-dimensional (1D) coupled-resonator optical waveguide (CROW) which chirally couples to an array of two-level quantum emitters (QEs). The chiral interaction between the resonator mode and the QE can break the time-reversal symmetry without the magneto-optical effect. As a result, a nonreciprocal single-photon edge state, band gap and flat band appear. By using such a chiral QE-CROW system, including a finite number of unit cells and working in the nonreciprocal band gap, we achieve frequency-multiplex single-photon circulators with high fidelity and low insertion loss. The chiral QE-light interaction can also protect one-way propagation of single photons against backscattering. Our work opens a new door for studying nonreciprocal photonic band structure and exploring its applications in the quantum regime.

quant-ph↗

arXiv2021

A Multiscale Method for the Heterogeneous Signorini Problem

In this paper, we develop a multiscale method for solving the Signorini problem with a heterogeneous field. The Signorini problem is encountered in many applications, such as hydrostatics, thermics, and solid mechanics. It is well-known that numerically solving this problem requires a fine computational mesh, which can lead to a large number of degrees of freedom. The aim of this work is to develop a new hybrid multiscale method based on the framework of the generalized multiscale finite element method (GMsFEM). The construction of multiscale basis functions requires local spectral decomposition. Additional multiscale basis functions related to the contact boundary are required so that our method can handle the unilateral condition of the Signorini type naturally. A complete analysis of the proposed method is provided and a result of the spectral convergence is shown. Numerical results are provided to validate our theoretical findings.

math.NA↗

arXiv2021

Classifying Long Clinical Documents with Pre-trained Transformers

Automatic phenotyping is a task of identifying cohorts of patients that match a predefined set of criteria. Phenotyping typically involves classifying long clinical documents that contain thousands of tokens. At the same time, recent state-of-art transformer-based pre-trained language models limit the input to a few hundred tokens (e.g. 512 tokens for BERT). We evaluate several strategies for incorporating pre-trained sentence encoders into document-level representations of clinical text, and find that hierarchical transformers without pre-training are competitive with task pre-trained models.

cs.CL↗

arXiv2021

Spectrum Congruency of Multiscale Local Patches for Edge Detection

This paper proposes a novel feature called spectrum congruency for describing edges in images. The spectrum congruency is a generalization of the phase congruency, which depicts how much each Fourier components of the image are congruent in phase. Instead of using fixed bases in phase congruency, the spectrum congruency measures the congruency of the energy distribution of multiscale patches in a data-driven transform domain, which is more adaptable to the input images. Multiscale image patches are used to acquire different frequency components for modeling the local energy and amplitude. The spectrum congruency coincides nicely with human visions of perceiving features and provides a more reliable way of detecting edges. Unlike most existing differential-based multiscale edge detectors which simply combine the multiscale information, our method focuses on exploiting the correlation of the multiscale patches based on their local energy. We test our proposed method on synthetic and real images, and the results demonstrate that our approach is practical and highly robust to noise.

eess.IV↗

arXiv2021

Performance Comparison between Reconfigurable Intelligent Surface and Relays: Theoretical Methods and a Perspective from Operator

Reconfigurable intelligent surface (RIS) is an emerging technique employing metasurface to reflect the signal from the source node to the destination node without consuming any energy. Not only the spectral efficiency but also the energy efficiency can be improved through RIS. Essentially, RIS can be considered as a passive relay between the source and destination node. On the other hand, a relay node in a traditional relay network has to be active, which indicates that it will consume energy when it is relaying the signal or information between the source and destination nodes. In this paper, we compare the performances between RIS and active relay for a general multiple-input multiple-output (MIMO) system. To make the comparison fair and comprehensive, both the performances of RIS and active relay are optimized with best-effort. In terms of the RIS, transmit beamforming and reflecting coefficient at the RIS are jointly optimized so as to maximize the end-to-end throughput. Although the optimization problem is non-convex, it is transformed equivalently to a weighted mean-square error (MSE) minimization problem and an alternating optimization problem is proposed, which can ensure the convergence to a stationary point. In terms of active relay, both half duplex relay (HDR) and full duplex relay (FDR) are considered. End-to-end throughput is maximized via an alternating optimization method. Numerical results are presented to demonstrate the effectiveness of the proposed algorithm. Finally, comparisons between RIS and relays are investigated from the perspective of system model, performance, deployment and controlling method.

cs.IT↗

arXiv2020

Object Detection based on OcSaFPN in Aerial Images with Noise

Taking the deep learning-based algorithms into account has become a crucial way to boost object detection performance in aerial images. While various neural network representations have been developed, previous works are still inefficient to investigate the noise-resilient performance, especially on aerial images with noise taken by the cameras with telephoto lenses, and most of the research is concentrated in the field of denoising. Of course, denoising usually requires an additional computational burden to obtain higher quality images, while noise-resilient is more of a description of the robustness of the network itself to different noises, which is an attribute of the algorithm itself. For this reason, the work will be started by analyzing the noise-resilient performance of the neural network, and then propose two hypotheses to build a noise-resilient structure. Based on these hypotheses, we compare the noise-resilient ability of the Oct-ResNet with frequency division processing and the commonly used ResNet. In addition, previous feature pyramid networks used for aerial object detection tasks are not specifically designed for the frequency division feature maps of the Oct-ResNet, and they usually lack attention to bridging the semantic gap between diverse feature maps from different depths. On the basis of this, a novel octave convolution-based semantic attention feature pyramid network (OcSaFPN) is proposed to get higher accuracy in object detection with noise. The proposed algorithm tested on three datasets demonstrates that the proposed OcSaFPN achieves a state-of-the-art detection performance with Gaussian noise or multiplicative noise. In addition, more experiments have proved that the OcSaFPN structure can be easily added to existing algorithms, and the noise-resilient ability can be effectively improved.

cs.CV↗

arXiv2020

DymSLAM:4D Dynamic Scene Reconstruction Based on Geometrical Motion Segmentation

Most SLAM algorithms are based on the assumption that the scene is static. However, in practice, most scenes are dynamic which usually contains moving objects, these methods are not suitable. In this paper, we introduce DymSLAM, a dynamic stereo visual SLAM system being capable of reconstructing a 4D (3D + time) dynamic scene with rigid moving objects. The only input of DymSLAM is stereo video, and its output includes a dense map of the static environment, 3D model of the moving objects and the trajectories of the camera and the moving objects. We at first detect and match the interesting points between successive frames by using traditional SLAM methods. Then the interesting points belonging to different motion models (including ego-motion and motion models of rigid moving objects) are segmented by a multi-model fitting approach. Based on the interesting points belonging to the ego-motion, we are able to estimate the trajectory of the camera and reconstruct the static background. The interesting points belonging to the motion models of rigid moving objects are then used to estimate their relative motion models to the camera and reconstruct the 3D models of the objects. We then transform the relative motion to the trajectories of the moving objects in the global reference frame. Finally, we then fuse the 3D models of the moving objects into the 3D map of the environment by considering their motion trajectories to obtain a 4D (3D+time) sequence. DymSLAM obtains information about the dynamic objects instead of ignoring them and is suitable for unknown rigid objects. Hence, the proposed system allows the robot to be employed for high-level tasks, such as obstacle avoidance for dynamic objects. We conducted experiments in a real-world environment where both the camera and the objects were moving in a wide range.

cs.CV↗

arXiv2020

Beam-space Multiplexing: Practice, Theory, and Trends-From 4G TD-LTE, 5G, to 6G and Beyond

In this article, the new term, namely beam-space multiplexing, is proposed for the former multi-layer beamforming for 4G TD-LTE in 3GPP releases. We provide a systematic overview of beam-space multiplexing from engineering and theoretical perspectives. Firstly, we clarify the fundamental theory of beam-space multiplexing. Specifically, we provide a comprehensive comparison with the antenna-space multiplexing in terms of theoretical analysis, channel state information acquisition, and engineering implementation constraints. Then, we summarize the key technologies and 3GPP standardization of beam-space multiplexing in 4G TD-LTE and 5G new radio (NR) in terms of multi-layer beamforming and massive beamforming, respectively. We also provide system-level performance evaluation of beam-space multiplexing schemes and field results from current commercial TD-LTE networks and field trial of 5G. The practical deployments of 4G TD-LTE and 5G cellular networks demonstrate the superiority of beam-space multiplexing within the limitations of implementation complexity and practical deployment scenarios. Finally, the future trends of beam-space multiplexing in 6G and beyond are discussed, including massive beamforming for extremely large-scale MIMO (XL-MIMO), low earth orbit (LEO) satellites communication, data-driven intelligent massive beamforming, and multi-target spatial signal processing, i.e., joint communication and sensing, positioning, etc.

eess.SP↗

arXiv2019

Subjectivity Learning Theory towards Artificial General Intelligence

The construction of artificial general intelligence (AGI) was a long-term goal of AI research aiming to deal with the complex data in the real world and make reasonable judgments in various cases like a human. However, the current AI creations, referred to as "Narrow AI", are limited to a specific problem. The constraints come from two basic assumptions of data, which are independent and identical distributed samples and single-valued mapping between inputs and outputs. We completely break these constraints and develop the subjectivity learning theory for general intelligence. We assign the mathematical meaning for the philosophical concept of subjectivity and build the data representation of general intelligence. Under the subjectivity representation, then the global risk is constructed as the new learning goal. We prove that subjectivity learning holds a lower risk bound than traditional machine learning. Moreover, we propose the principle of empirical global risk minimization (EGRM) as the subjectivity learning process in practice, establish the condition of consistency, and present triple variables for controlling the total risk bound. The subjectivity learning is a novel learning theory for unconstrained real data and provides a path to develop AGI.

cs.AI↗

arXiv2019

Geometry-Aware Graph Transforms for Light Field Compact Representation

The paper addresses the problem of energy compaction of dense 4D light fields by designing geometry-aware local graph-based transforms. Local graphs are constructed on super-rays that can be seen as a grouping of spatially and geometry-dependent angularly correlated pixels. Both non separable and separable transforms are considered. Despite the local support of limited size defined by the super-rays, the Laplacian matrix of the non separable graph remains of high dimension and its diagonalization to compute the transform eigen vectors remains computationally expensive. To solve this problem, we then perform the local spatio-angular transform in a separable manner. We show that when the shape of corresponding super-pixels in the different views is not isometric, the basis functions of the spatial transforms are not coherent, resulting in decreased correlation between spatial transform coefficients. We hence propose a novel transform optimization method that aims at preserving angular correlation even when the shapes of the super-pixels are not isometric. Experimental results show the benefit of the approach in terms of energy compaction. A coding scheme is also described to assess the rate-distortion perfomances of the proposed transforms and is compared to state of the art encoders namely HEVC and JPEG Pleno VM 1.1.

cs.CV↗

arXiv2016

Channel Reconstruction for SVD-ZF Precoding in Massive 3D-MIMO Systems Low-Complexity Algorithm

In this paper, we study the low-complexity channel reconstruction methods for downlink precoding in massive MIMO systems. When the user is allocated less streams than the number of its antennas, the BS or user usually utilizes the singular value decomposition (SVD) factorizations to get the effective channels, whose dimension is equal to the num of streams. This process is called channel reconstruction in BS for TDD mode. However, with the increasing of antennas in BS, the computation burden of SVD is becoming incredibly high. As a countermeasure, we propose a series of novel low-complexity channel reconstruction methods for downlink zero-forcing precoding (ZF). We adopt randomized algorithms to construct an approximate SVD, which could reduce the dimensions of the matrix, especially when approximating an input matrix with a low-rank element. Besides, this method could automatically modify the parameters to adapt arbitrary number demand of streams from users. The simulation results show that the proposed methods only cost less than 30% float computation than the traditional SVD-ZF method, while keeping nearly the same performance of 1Gbps with 128 BS antennas.

cs.IT↗

arXiv2015

Low-Complexity Channel Reconstruction Methods Based on SVD-ZF Precoding in Massive 3D-MIMO Systems

In this paper, we study the low-complexity channel reconstruction methods for downlink precoding in massive multiple-Input multiple-Output (MIMO) systems. When the user is allocated less streams than the number of its antennas, the base station (BS) or user usually utilizes the singular value decomposition (SVD) to get the effective channels, whose dimension is equal to the number of streams. This process is called channel reconstruction and done in BS for time division duplex (TDD) mode. However, with the increasing of antennas in BS, the computation burden of SVD is getting incredible. Here, we propose a series of novel low-complexity channel reconstruction methods for downlink precoding in 3D spatial channel model. We consider different correlations between elevation and azimuth antennas, and divide the large dimensional matrix SVD into two kinds of small-size matrix SVD. The simulation results show that the proposed methods only produce less than 10% float computation than the traditional SVD zero-forcing (SVD-ZF) precoding method, while keeping nearly the same performance of 1Gbps.

cs.IT↗

arXiv2014

Interference Alignment Improves the Capacity of OFDM Systems

Multi-user Orthogonal Frequency Division Multiplexing (OFDM) and Multiple Output Multiple Output (MIMO) have been widely adopted to enhance the system throughput and combat the detrimental effects of wireless channels. Recently, interference alignment was proposed to exploit interference to enable concurrent transmissions of multiple signals. In this paper, we investigate how to combine these techniques to further enhance the system throughput. We first reveal the unique characteristics and challenges brought about by using interference alignment in diagonal channels. We then derive a performance bound for the multi-user (MIMO) OFDM/interference alignment system under practical constraints, and show how to achieve this bound with a decomposition approach. The superior performance of the proposed scheme is validated with simulations.

cs.IT↗

arXiv2014

Low-Complexity Soft-Output Signal Detection Based on Gauss-Seidel Method for Uplink Multi-User Large-Scale MIMO Systems

For uplink large-scale MIMO systems, minimum mean square error (MMSE) algorithm is near-optimal but involves matrix inversion with high complexity. In this paper, we propose to exploit the Gauss-Seidel (GS) method to iteratively realize the MMSE algorithm without the complicated matrix inversion. To further accelerate the convergence rate and reduce the complexity, we propose a diagonal-approximate initial solution to the GS method, which is much closer to the final solution than the traditional zero-vector initial solution. We also propose a approximated method to compute log-likelihood ratios (LLRs) for soft channel decoding with a negligible performance loss. The analysis shows that the proposed GS-based algorithm can reduce the computational complexity from O(K^3) to O(K^2), where K is the number of users. Simulation results verify that the proposed algorithm outperforms the recently proposed Neumann series approximation algorithm, and achieves the near-optimal performance of the classical MMSE algorithm with a small number of iterations.

cs.IT↗