Yaxi Liu

Dr. Yaxi Liu

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 May 2019 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YLYaxi Liu
Yaxi Liu
WHWei Huangfu
Wei Huangfu
HZHaijun Zhang
Haijun Zhang
KLKeping Long
Keping Long
Network coverage and capacity optimization is an important operational task in cellular networks. The network coverage maximization by adjusting azimuths and tilts of antennas is focused and the existing approaches are mainly gradient-free methods. A standard gradient descent algorithm and its improved version, namely a Stochastic Gradient Descent (SGD) algorithm are proposed on the basis of a novel coverage indicator, named as the soft coverage indicator, to approximate the hard version of the original coverage indicator. We prove that the gradient vector is sparse, which accelerates gradient calculation, due to the number limitation of base stations within a specific distance from a given sampling point even if there are many decision variables of azimuths and tilts. Also, the SGD algorithm only requires a small amount of computation based on cheap estimates of the gradients, and thus is applicable to large-scale networks in an efficient manner. Experiments show that the proposed approaches perform well both in their near-optimal solutions and in their computation efficiency compared with the meta-heuristic algorithms. The extensibility and practicality of the proposed algorithms are also discussed.

26 April 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
YLYaxi Liu
Yaxi Liu
WHWei Huangfu
Wei Huangfu
Huan ZhouHuan Zhou
Huan Zhou
HZHaijun Zhang
Haijun Zhang
JLJiangchuan Liu
Jiangchuan Liu
KLKeping Long
Keping Long
Unmanned Aerial Vehicle (UAV) Base Station (BS) placement optimization is an essential operational task to improve the Quality of Service (QoS) in UAV-aided wireless cellular networks. The existing approaches are almost zeroth order methods, and the few first order methods mainly ignore the allocation fairness, computational efficiency, and backhaul constraints. In this paper, we formulate the UAV placement problem as a constrained optimization problem, with the objective of maximizing the fair coverage versus energy consumption while satisfying the backhaul constraints at different time nodes. To guarantee fair QoS allocation, we introduce a novel fairness index to ensure fair communication opportunity and the novel region coverage ratio to avoid excess QoS on covered spots. An accurate and efficient proximal stochastic gradient descent based alternating algorithm that iteratively executes two optimization steps is proposed to optimize the UAV locations, which enables the fast single point-based first order methods to solve the complex problems with constraints. Experiment results manifest that the proposed algorithm performs well both in synthetic data scenario and in real city scenario. Furthermore, the proposed first order algorithm is more efficient than the existing zeroth order algorithm, typically referring to the meta-heuristic method.

4 September 2024 in Proceedings of the IEEE
Verified
Journal Article
Closed access
YLYaxi Liu
Yaxi Liu
THTianyao Huang
Tianyao Huang
FLFan Liu
Fan Liu
DMDingyou Ma
Dingyou Ma
WHWei Huangfu
Wei Huangfu
YEYonina C. Eldar
Yonina C. Eldar
Integrated sensing and communications (ISAC) has received considerable attention from both industry and academia. By sharing the spectrum and hardware platform, ISAC significantly reduces costs and improves spectral, energy, and hardware efficiencies. To support the large number of communication users (CUs) and sensing targets (STs), the design of multiple access (MA) is a fundamental issue in ISAC. MA techniques in ISAC are expected to avoid mutual interference between sensing and communicating functions under the critical constraints of both functions. In this article, we present an overview on approaches of MA for ISAC, from orthogonal transmission strategies to nonorthogonal ones, realized in time, frequency, code, spatial, delay–Doppler, power, and/or multiple domains. We discuss their individual implementation schemes and corresponding resource allocation strategies, as well as highlight future research opportunities.

27 November 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
YLYaxi Liu
Yaxi Liu
WMWencan Mao
Wencan Mao
BHBoxin He
Boxin He
WHWei Huangfu
Wei Huangfu
THTianyao Huang
Tianyao Huang
KLKeping Long
Keping Long
Unmanned aerial vehicle (UAV)-enabled massive multiple-input-multiple-output (MIMO) integrated sensing and communication (ISAC) is an emerging platform to perform communication and sensing efficiently and flexibly. However, the existing works barely consider the radar probing tasks and neglect the benefits of the dedicated sensing signal. In this paper, we focus on joint optimizations in radar probing tasks, and a novel indicator is introduced, namely radar probing error. Two optimizations in radar probing tasks are established: i) joint transmit beamforming design for large-scale regional radar probing and communication task; ii) joint transmit beamforming and UAV trajectory design for communication enhancement and radar probing task. For the former task, we adopt both communication and novel sensing precoders to further support the MIMO radar. A semidefinite relaxation is utilized to relax the original non-convex problem, which is proven to be tight. For the latter task, we adopt block coordinate descent to alternately optimize the precoders and UAV trajectory where the fractional programming approach and successive convex approximation are further adopted. Experiment results testify the validation of the proposed methods for radar probing tasks in UAV-enabled MIMO ISAC. Moreover, results show the fundamental trade-off between the dual functions and reveal the effectiveness of the introduced sensing precoder.

1 August 2019 in IEEE Access
Verified
Journal Article
Open access
QWQiqige Wuniri
Qiqige Wuniri
WHWei Huangfu
Wei Huangfu
YLYaxi Liu
Yaxi Liu
XLXiaoli Lin
Xiaoli Lin
LLLiyuan Liu
Liyuan Liu
ZYZhigang Yu
Zhigang Yu
Breast cancer is one of the most common cancers diagnosed in women. For preventive diagnosis, feature selection is an essential step to construct the breast cancer classifier. The features of a real breast cancer dataset are usually composed of discrete and continuous ones. Also, the Area Under the Curve (AUC) of the receiver operating characteristic receives more attention in such a medical field. The existing research work is insufficient to take into account both the hybrid trait of the features and the specific classification objective. We have proposed a wrapper method, i.e., a integrated framework in which Bayesian classifiers are embedded for the feature selection of breast cancer datasets. To deal with both the discrete features and the continuous features, we adopt the naive approach for the discrete features but the kernel probability density estimation for the continuous ones, respectively, which leads to feature-type-aware hybrid Bayesian classifiers. All the classifiers are fed with different feature subsets and evaluated by their AUC metrics as the fitness indexes. Thus, with the genetic algorithm, we can obtain a near optimal feature subset, which yields a good AUC metric with its corresponding classifiers. Moreover, the one-class F-score is used to help enhance the convergence of the algorithm. Experiments are done both with the continuous Wisconsin diagnostic breast cancer dataset and the real breast cancer dataset for Chinese women. The results prove that the proposed wrapper is feasible, accurate and efficient, compared with the related genetic algorithm based approaches.

19 November 2024 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YLYaxi Liu
Yaxi Liu
THTianyao Huang
Tianyao Huang
ZZZiheng Zheng
Ziheng Zheng
BHBoxin He
Boxin He
WHWei Huangfu
Wei Huangfu
KLKeping Long
Keping Long
Integrated sensing and communications (ISAC) is emerging as one of the six application scenarios for future wireless networks. Characterizing the Pareto boundary is an urgent issue in multiple-input multiple-output (MIMO) ISAC systems. The lack of unified sensing metrics and the neglect of the instantaneous worst-case sensing requirement in the existing works present challenges to this issue. In this paper, we propose a more universal and operable theoretical limit analysis framework where the high-signal-to-noise ratio (SNR) channel capacity is characterized under instantaneous covariance mismatch constraint. We use the covariance mismatch that implies the distance to optimal covariance as the sensing metric. The optimal covariance can be computed by optimizing any key sensing metric. An MIMO ISAC Pareto boundary can be obtained by computing channel capacity under fine-grained sensing thresholds, below which the mismatch must be constrained. In the experiments, three radar modes are considered, and the results show that different radar modes affect capacity performance and a trade-off exists between communication and sensing. In addition, pure communication capacity is the upper bound of the communication capacity in ISAC. Moreover, capacity under instantaneous constraint approaches that under average one in pure MIMO communications when signal length approaches infinity.