arXiv subjects

Fan Liu

Publications and source records attributed to Fan Liu.

At least 253 records · Page 14Linked to original sources

arXiv2023

Rethinking Estimation Rate for Wireless Sensing: A Rate-Distortion Perspective

Wireless sensing has been recognized as a key enabling technology for numerous emerging applications. For decades, the sensing performance was mostly evaluated from a reliability perspective, with the efficiency aspect widely unexplored. Motivated from both backgrounds of rate-distortion theory and optimal sensing waveform design, a novel efficiency metric, namely, the sensing estimation rate (SER), is defined to unify the information- and estimation- theoretic perspectives of wireless sensing. Specifically, the active sensing process is characterized as a virtual lossy data transmission through non-cooperative joint source-channel coding. The bounds of SER are analyzed based on the data processing inequality, followed by a detailed derivation of achievable bounds under the special cases of the Gaussian linear model (GLM) and semi-controllable GLM. As for the intractable non-linear model, a computable upper bound is also given in terms of the Bayesian Cramér-Rao bound (BCRB). Finally, we show the rationality and effectiveness of the SER defined by comparing to the related works.

eess.SP↗

arXiv2023

On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels

ISAC is recognized as a promising technology for the next-generation wireless networks, which provides significant performance gains over individual S&C systems via the shared use of wireless resources. The characterization of the S&C performance tradeoff is at the core of the theoretical foundation of ISAC. In this paper, we consider a point-to-point ISAC model under vector Gaussian channels, and propose to use the CRB-rate region as a basic tool for depicting the fundamental S&C tradeoff. In particular, we consider the scenario where a unified ISAC waveform is emitted from a dual-functional ISAC Tx, which simultaneously performs S&C tasks with a communication Rx and a sensing Rx. In order to perform both S&C tasks, the ISAC waveform is required to be random to convey communication information, with realizations being perfectly known at both the ISAC Tx and the sensing Rx as a reference sensing signal as in typical radar systems. As the main contribution of this paper, we characterize the S&C performance at the two corner points of the CRB-rate region, namely, $P_{SC}$ indicating the max. achievable rate constrained by the min. CRB, and $P_{CS}$ indicating the min. achievable CRB constrained by the max. rate. In particular, we derive the high-SNR capacity at $P_{SC}$, and provide lower and upper bounds for the sensing CRB at $P_{CS}$. We show that these two points can be achieved by the conventional Gaussian signaling and a novel strategy relying on the uniform distribution over the Stiefel manifold, respectively. Based on the above-mentioned analysis, we provide an outer bound and various inner bounds for the achievable CRB-rate regions. Our main results reveal a two-fold tradeoff in ISAC systems, consisting of the subspace tradeoff (ST) and the deterministic-random tradeoff (DRT) that depend on the resource allocation and data modulation schemes employed for S&C, respectively.

cs.IT↗

arXiv2023

Integrated Sensing, Navigation, and Communication for Secure UAV Networks with a Mobile Eavesdropper

This paper proposes an integrated sensing, navigation, and communication (ISNC) framework for safeguarding unmanned aerial vehicle (UAV)-enabled wireless networks against a mobile eavesdropping UAV (E-UAV). To cope with the mobility of the E-UAV, the proposed framework advocates the dual use of artificial noise transmitted by the information UAV (I-UAV) for simultaneous jamming and sensing to facilitate navigation and secure communication. In particular, the I-UAV communicates with legitimate downlink ground users, while avoiding potential information leakage by emitting jamming signals, and estimates the state of the E-UAV with an extended Kalman filter based on the backscattered jamming signals. Exploiting the estimated state of the E-UAV in the previous time slot, the I-UAV determines its flight planning strategy, predicts the wiretap channel, and designs its communication resource allocation policy for the next time slot. To circumvent the severe coupling between these three tasks, a divide-and-conquer approach is adopted. The online navigation design has the objective to minimize the distance between the I-UAV and a pre-defined destination point considering kinematic and geometric constraints. Subsequently, given the predicted wiretap channel, the robust resource allocation design is formulated as an optimization problem to achieve the optimal trade-off between sensing and communication in the next time slot, while taking into account the wiretap channel prediction error and the quality-of-service (QoS) requirements of secure communication. Simulation results demonstrate the superior performance of the proposed design compared with baseline schemes and validate the benefits of integrating sensing and navigation into secure UAV communication systems.

cs.IT↗

arXiv2023

Joint Beam Scheduling and Power Allocation for SWIPT in Mixed Near- and Far-Field Channels

Extremely large-scale array (XL-array) has emerged as a promising technology to enhance the spectrum efficiency and spatial resolution in future wireless networks, leading to a fundamental paradigm shift from conventional far-field communications towards the new near-field communications. Different from the existing works that mostly considered simultaneous wireless information and power transfer (SWIPT) in the far field, we consider in this paper a new and practical scenario, called mixed near- and far-field SWIPT, in which energy harvesting (EH) and information decoding (ID) receivers are located in the near- and far-field regions of the XL-array base station (BS), respectively. Specifically, we formulate an optimization problem to maximize the weighted sum-power harvested at all EH receivers by jointly designing the BS beam scheduling and power allocation, under the constraints on the ID sum-rate and BS transmit power. To solve this nonconvex optimization problem, an efficient algorithm is proposed to obtain a suboptimal solution by leveraging the binary variable elimination and successive convex approximation methods. Numerical results demonstrate that our proposed joint design achieves substantial performance gain over other benchmark schemes.

eess.SP↗

arXiv2023

The odd bunch: chrono-chemo-dynamics of sixteen unusual stars from Kepler

In this study we combine asteroseismic, spectroscopic and kinematic information to perform a detailed analysis of a sample of 16 stars from the Kepler field. Our selection focuses on stars that appear to contradict Galactic chemical evolution models: young and $α$-rich, old and metal-rich, as well as other targets with unclear classification in past surveys. Kinematics are derived from Gaia DR3 parallaxes and proper motions, and high-resolution spectra from HIRES/Keck are used to calculate chemical abundances for over 20 elements. This information is used to perform careful checks on asteroseismic masses and ages derived via grid-based modelling. Among the seven stars previously classified as young and $α$-rich, only one seems to be an unambiguously older object masking its true age. We confirm the existence of two very old ($\geq$11 Gyr), super metal rich ($\geq$0.1 dex) giants. These two stars have regular thin disc chemistry and in-plane solar circle orbits which fit well in the picture of radial migration via the churning mechanism. The alternative explanation that these stars have younger ages would require mass-loss rates which strongly increases with increasing metallicity. Finally, we suggest further investigations to explore the suitability of Zn as a chemical clock in red giants.

astro-ph.SR↗

arXiv2023

Joint Receiver Design for Integrated Sensing and Communications

In this letter, we investigate the joint receiver design for integrated sensing and communication (ISAC) systems, where the communication signal and the target echo signal are simultaneously received and processed to achieve a balanced performance between both functionalities. In particular, we proposed two design schemes to solve the joint sensing and communication problem of receive signal processing. {\color{black} The first is based on maximum likelihood (ML) detection, minimum mean squared error (MMSE) estimation and interference cancellation (IC), and the other formulates a tailored MMSE estimator for target estimation that is independent to the detector, which form a Non-IC design. We show that with the structural information of the communication signal taken into account, the Non-IC approach outperforms the IC method and achieves optimal performance.} Numerical results are provided to validate the effectiveness of the proposed optimal designs.

eess.SP↗

arXiv2023

Towards ISAC-Empowered Vehicular Networks: Framework, Advances, and Opportunities

Connected and autonomous vehicle (CAV) networks face several challenges, such as low throughput, high latency, and poor localization accuracy. These challenges severely impede the implementation of CAV networks for immersive metaverse applications and driving safety in future 6G wireless networks. To alleviate these issues, integrated sensing and communications (ISAC) is envisioned as a game-changing technology for future CAV networks. This article presents a comprehensive overview on the application of ISAC techniques in vehicle-to-infrastructure (V2I) networks. We cover the general system framework, representative advances, and a detailed case study on using the 5G New Radio (NR) waveform for sensing-assisted communications in V2I networks. Finally, we highlight open problems and opportunities in the field.

eess.SP↗

arXiv2023

Few-shot Classification via Ensemble Learning with Multi-Order Statistics

Transfer learning has been widely adopted for few-shot classification. Recent studies reveal that obtaining good generalization representation of images on novel classes is the key to improving the few-shot classification accuracy. To address this need, we prove theoretically that leveraging ensemble learning on the base classes can correspondingly reduce the true error in the novel classes. Following this principle, a novel method named Ensemble Learning with Multi-Order Statistics (ELMOS) is proposed in this paper. In this method, after the backbone network, we use multiple branches to create the individual learners in the ensemble learning, with the goal to reduce the storage cost. We then introduce different order statistics pooling in each branch to increase the diversity of the individual learners. The learners are optimized with supervised losses during the pre-training phase. After pre-training, features from different branches are concatenated for classifier evaluation. Extensive experiments demonstrate that each branch can complement the others and our method can produce a state-of-the-art performance on multiple few-shot classification benchmark datasets.

cs.CV↗

arXiv2023

Seventy Years of Radar and Communications: The Road from Separation to Integration

Radar and communications (R&C) as key utilities of electromagnetic (EM) waves have fundamentally shaped human society and triggered the modern information age. Although R&C have been historically progressing separately, in recent decades they have been converging towards integration, forming integrated sensing and communication (ISAC) systems, giving rise to new, highly desirable capabilities in next-generation wireless networks and future radars. To better understand the essence of ISAC, this paper provides a systematic overview on the historical development of R&C from a signal processing (SP) perspective. We first interpret the duality between R&C as signals and systems, followed by an introduction of their fundamental principles. We then elaborate on the two main trends in their technological evolution, namely, the increase of frequencies and bandwidths, and the expansion of antenna arrays. We then show how the intertwined narratives of R&C evolved into ISAC, and discuss the resultant SP framework. Finally, we overview future research directions in this field.

eess.SP↗

arXiv2023

Symbol-Level Precoding for Integrated Sensing and Communications: A Faster-Than-Nyquist Approach

In this paper, we propose a novel symbol-level precoding (SLP) method for a multi-user multi-input multi-output (MU-MIMO) downlink Integrated Sensing and Communications (ISAC) system based on faster-than-Nyquist (FTN) signaling. Our method minimizes the minimum mean squared error (MMSE) for target parameter estimation while guaranteeing per-user quality-of-service by exploiting constructive interference (CI) techniques. We tackle the non-convex problem using an efficient successive convex approximation (SCA) method. Numerical results demonstrate that our FTN-ISAC-SLP design significantly outperforms conventional benchmarks in both communication and sensing performance.

eess.SP↗

arXiv2023

Multi-Behavior Recommendation with Cascading Graph Convolution Networks

Multi-behavior recommendation, which exploits auxiliary behaviors (e.g., click and cart) to help predict users' potential interactions on the target behavior (e.g., buy), is regarded as an effective way to alleviate the data sparsity or cold-start issues in recommendation. Multi-behaviors are often taken in certain orders in real-world applications (e.g., click>cart>buy). In a behavior chain, a latter behavior usually exhibits a stronger signal of user preference than the former one does. Most existing multi-behavior models fail to capture such dependencies in a behavior chain for embedding learning. In this work, we propose a novel multi-behavior recommendation model with cascading graph convolution networks (named MB-CGCN). In MB-CGCN, the embeddings learned from one behavior are used as the input features for the next behavior's embedding learning after a feature transformation operation. In this way, our model explicitly utilizes the behavior dependencies in embedding learning. Experiments on two benchmark datasets demonstrate the effectiveness of our model on exploiting multi-behavior data. It outperforms the best baseline by 33.7% and 35.9% on average over the two datasets in terms of Recall@10 and NDCG@10, respectively.

cs.IR↗

arXiv2023

ISAC-Enabled V2I Networks Based on 5G NR: How Much Can the Overhead Be Reduced?

The emergence of the fifth-generation (5G) New Radio (NR) brings additional possibilities to vehicle-to-everything (V2X) network with improved quality of services. In order to obtain accurate channel state information (CSI) in high-mobility V2X networks, pilot signals and frequent handover between vehicles and infrastructures are required to establish and maintain the communication link, which increases the overheads and reduces the communication throughput. To address this issue, integrated sensing and communications (ISAC) was employed at the base station (BS) in the vehicle-to-infrastructure (V2I) network to reduce a certain amount of overheads, thus improve the spectral efficiency. Nevertheless, the exact amount of overheads reduction remains unclear, particularly for practical NR based V2X networks. In this paper, we study a link-level NR based V2I system employing ISAC signaling to facilitate the communication beam management, where the Extended Kalman filtering (EKF) algorithm is performed to realize the functions of tracking and predicting the motion of the vehicle. We provide detailed analysis on the overheads reduction with the aid of ISAC, and show that up to 43.24% overheads can be reduced under assigned NR frame structure. In addition, numerical results are provided to validate the improved performance on the beam tracking and communication throughput.

eess.SP↗

arXiv2023

Learning to Agree on Vision Attention for Visual Commonsense Reasoning

Visual Commonsense Reasoning (VCR) remains a significant yet challenging research problem in the realm of visual reasoning. A VCR model generally aims at answering a textual question regarding an image, followed by the rationale prediction for the preceding answering process. Though these two processes are sequential and intertwined, existing methods always consider them as two independent matching-based instances. They, therefore, ignore the pivotal relationship between the two processes, leading to sub-optimal model performance. This paper presents a novel visual attention alignment method to efficaciously handle these two processes in a unified framework. To achieve this, we first design a re-attention module for aggregating the vision attention map produced in each process. Thereafter, the resultant two sets of attention maps are carefully aligned to guide the two processes to make decisions based on the same image regions. We apply this method to both conventional attention and the recent Transformer models and carry out extensive experiments on the VCR benchmark dataset. The results demonstrate that with the attention alignment module, our method achieves a considerable improvement over the baseline methods, evidently revealing the feasibility of the coupling of the two processes as well as the effectiveness of the proposed method.

cs.CV↗

arXiv2023

Integrated Sensing and Communication from Learning Perspective: An SDP3 Approach

Characterizing the sensing and communication performance tradeoff in integrated sensing and communication (ISAC) systems is challenging in the applications of learning-based human motion recognition. This is because of the large experimental datasets and the black-box nature of deep neural networks. This paper presents SDP3, a Simulation-Driven Performance Predictor and oPtimizer, which consists of SDP3 data simulator, SDP3 performance predictor and SDP3 performance optimizer. Specifically, the SDP3 data simulator generates vivid wireless sensing datasets in a virtual environment, the SDP3 performance predictor predicts the sensing performance based on the function regression method, and the SDP3 performance optimizer investigates the sensing and communication performance tradeoff analytically. It is shown that the simulated sensing dataset matches the experimental dataset very well in the motion recognition accuracy. By leveraging SDP3, it is found that the achievable region of recognition accuracy and communication throughput consists of a communication saturation zone, a sensing saturation zone, and a communication-sensing adversarial zone, of which the desired balanced performance for ISAC systems lies in the third one.

cs.IT↗

arXiv2023

Towards Efficient Large-Scale Network Slicing: An LP Dynamic Rounding-and-Refinement Approach

In this paper, we propose an efficient algorithm for the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources to meet diverse service requirements. The problem has been formulated as a mixed integer linear programming (MILP) formulation in the literature. We first propose a novel linear programming (LP) relaxation of the MILP formulation. We show that compared with a natural LP relaxation of the MILP formulation, the novel LP relaxation is much more compact in terms of smaller numbers of variables and constraints, and much stronger in terms of providing a better LP bound, which makes it particularly suitable to be embedded in an LP relaxation based algorithm. Then we design an efficient two-stage LP dynamic rounding-and-refinement algorithm based on this novel LP relaxation. In the first stage, the proposed algorithm uses an LP dynamic rounding procedure to place the virtual network functions of all services into cloud nodes while taking traffic routing of all services into consideration; in the second stage, the proposed algorithm uses an iterative LP refinement procedure to obtain a solution for traffic routing of all services with their end-to-end delay constraints being satisfied. Compared with the existing algorithms which either have an exponential complexity or return a low-quality solution, our proposed algorithm achieves a better trade-off between the solution quality and the computational complexity. In particular, the worst-case complexity of our proposed algorithm is polynomial, which makes it suitable for solving large-scale problems. Numerical results demonstrate the effectiveness and efficiency of our proposed algorithm.

cs.IT↗

arXiv2023

Survey for Distant Solar Twins (SDST) -- III. Identification of new solar twin and solar analogue stars

The Survey for Distant Solar Twins (SDST) aims to find stars very similar to the Sun at distances 1-4 kpc, several times more distant than any currently known solar twins and analogues. The goal is to identify the best stars with which to test whether the fine-structure constant, alpha, varies with dark matter density in our Galaxy. Here we use EPIC, our line-by-line differential technique, to measure the stellar parameters - effective temperature Teff, surface gravity log g, metallicity [Fe/H] - from moderate resolution (R < 32,000) spectra of 877 solar twin and analogue candidates (547 at 1-4 kpc) observed with the HERMES spectrograph on the Anglo-Australian Telescope. These are consistent with expectations for Teff and log g from photometry, and for [Fe/H] from the Besancon stellar population model. EPIC provides small enough uncertainties (~90 K, 0.08 dex, 0.05 dex, respectively), even at the low signal-to-noise ratios available (S/N >~ 25 per pixel), to identify 299 new solar analogues (> 90% confidence), and 20 solar twins (>50% confidence), 206 and 12 of which are at 1-4 kpc. By extending EPIC to measure line broadening and lithium abundance from HERMES spectra, and with ages derived from isochrone fitting with our stellar parameters, we identify 174 solar analogues at 1-4 kpc which are relatively inactive, slowly rotating, and with no evidence of spectroscopic binarity. These are the preferred targets for follow-up spectroscopy to measure alpha.

astro-ph.SR↗

arXiv2023

$W$-representations for multi-character partition functions and their $β$-deformations

In this letter we continue the development of $W$-representations. We propose several generalizations of the known models, such as the hypergeometric Hurwitz $τ$-functions. We construct $W$-representations for multi-character expansions, which involve a generic number of sets of time variables. We propose integral representations for such kind of partition functions which are given by tensor models and multi-matrix models with multi-trace couplings. We further propose the $β$-deformation of the discussed $W$-representation for the Hurwitz case for two sets of times as well as for the multi-character case.

hep-th↗

arXiv2023

Deterministic-Random Tradeoff of Integrated Sensing and Communications in Gaussian Channels: A Rate-Distortion Perspective

Integrated sensing and communications (ISAC) is recognized as a key enabling technology for future wireless networks. To shed light on the fundamental performance limits of ISAC systems, this paper studies the deterministic-random tradeoff between sensing and communications (S&C) from a rate-distortion perspective under vector Gaussian channels. We model the ISAC signal as a random matrix that carries information, whose realization is perfectly known to the sensing receiver, but is unknown to the communication receiver. We characterize the sensing mutual information conditioned on the random ISAC signal, and show that it provides a universal lower bound for distortion metrics of sensing. Furthermore, we prove that the distortion lower bound is minimized if the sample covariance matrix of the ISAC signal is deterministic. We then offer our understanding of the main results by interpreting wireless sensing as non-cooperative source-channel coding, and reveal the deterministic-random tradeoff of S&C for ISAC systems. Finally, we provide sufficient conditions for the achievability of the distortion bound by analyzing a specific example of target response matrix estimation.

cs.IT↗