arXiv subjects

Pan Cao

Publications and source records attributed to Pan Cao.

8 recordsLinked to original sources

arXiv2026

Multi-Periodogram Velocity Estimation with Irregular Reference Signals for Robot-Aided ISAC

This paper addresses velocity estimation within robot-aided integrated sensing and communications (ISAC), where mobile robots act as sensing nodes but can only opportunistically reuse irregular 5G/6G reference signals (RSs). We show that the velocity profile induced by such irregular time-domain patterns can be decomposed into a periodic-peak component and an amplitude-shaping (weighting) component. Leveraging this structure, we propose a multi-periodogram velocity estimation algorithm that is standard-compliant and does not require new sensing-dedicated RSs or 3GPP modifications. Simulation results demonstrate that, compared with conventional periodogram processing, the proposed method improves low-SNR robustness by achieving a 3 dB SNR gain at the 10% missed-detection rate and reducing false alarms by 51%.

cs.RO↗

arXiv2026

Grouped Pattern and Multi-Periodogram Algorithm for Range Estimation in ISAC Systems

This paper proposes a grouped pattern (GP) for sensing signals and a corresponding multi-periodogram algorithm for range estimation in integrated sensing and communications (ISAC) systems. GP partitions subcarriers into groups with an identical intra-group configuration replicated across groups, producing range profiles with periodic peaks and a structured multi-peak signature that improves low-SNR target detection. By identifying targets via cross-pattern peak validation, the proposed approach reduces missed detections and false alarms while requiring fewer dedicated sensing resources. Extensive simulations demonstrate a 16.5% extended detection range and a 61% reduced false alarm rate compared to conventional methods.

cs.IT↗

arXiv2018

DELMU: A Deep Learning Approach to Maximising the Utility of Virtualised Millimetre-Wave Backhauls

Advances in network programmability enable operators to 'slice' the physical infrastructure into independent logical networks. By this approach, each network slice aims to accommodate the demands of increasingly diverse services. However, precise allocation of resources to slices across future 5G millimetre-wave backhaul networks, to optimise the total network utility, is challenging. This is because the performance of different services often depends on conflicting requirements, including bandwidth, sensitivity to delay, or the monetary value of the traffic incurred. In this paper, we put forward a general rate utility framework for slicing mm-wave backhaul links, encompassing all known types of service utilities, i.e. logarithmic, sigmoid, polynomial, and linear. We then introduce DELMU, a deep learning solution that tackles the complexity of optimising non-convex objective functions built upon arbitrary combinations of such utilities. Specifically, by employing a stack of convolutional blocks, DELMU can learn correlations between traffic demands and achievable optimal rate assignments. We further regulate the inferences made by the neural network through a simple 'sanity check' routine, which guarantees both flow rate admissibility within the network's capacity region and minimum service levels. The proposed method can be trained within minutes, following which it computes rate allocations that match those obtained with state-of-the-art global optimisation algorithms, yet orders of magnitude faster. This confirms the applicability of DELMU to highly dynamic traffic regimes and we demonstrate up to 62% network utility gains over a baseline greedy approach.

cs.NI↗

arXiv2015

Grouping-based Interference Alignment with IA-Cell Assignment in Multi-Cell MIMO MAC under Limited Feedback

Interference alignment (IA) is a promising technique to efficiently mitigate interference and to enhance the capacity of a wireless communication network. This paper proposes a grouping-based interference alignment (GIA) with optimized IA-Cell assignment for the multiple cells interfering multiple-input and multiple-output (MIMO) multiple access channel (MAC) network under limited feedback. This work consists of three main parts: 1) a complete study (including some new improvements) of the GIA with respect to the degrees of freedom (DoF) and optimal linear transceiver design is performed, which allows for low-complexity and distributed implementation; 2) based on the GIA, the concept of IA-Cell assignment is introduced. Three IA-Cell assignment algorithms are proposed for the setup with different backhaul overhead and their DoF and rate performance is investigated; 3) the performance of the proposed GIA algorithms is studied under limited feedback of IA precoders. To enable efficient feedback, a dynamic feedback bit allocation (DBA) problem is formulated and solved in closed-form. The practical implementation, the required backhaul overhead, and the complexity of the proposed algorithms are analyzed. Numerical results show that our proposed algorithms greatly outperform the traditional GIA under both unlimited and limited feedback.

cs.IT↗

arXiv2015

Semi-dynamic Green Resource Management in Downlink Heterogeneous Networks by Group Sparse Power Control

This paper addresses the energy-saving problem for the downlink of heterogeneous networks, which aims at minimizing the total base stations (BSs) power consumption while each user's rate requirement is supported. The basic idea of this work is to make use of the flexibility and scalability of the system such that more benefits can be gained by efficient resource management. This motivates us to propose a flexible BS power consumption model, which can control system resources, such as antennas, frequency carriers and transmit power allocation in an energy efficient manner rather than the "on/off" binary sleep mode for BSs. To denote these power-saving modes, we employ the group sparsity of the transmit power vector instead of the {0, 1} variables. Based on this power model, a semi-dynamic green resource management mechanism is proposed, which can jointly solve a series of resource management problems, including BS association, frequency carriers (FCs) assignment, and the transmit power allocation, by group sparse power control based on the large scale fading values. In particular, the successive convex approximation (SCA)-based algorithm is applied to solve a stationary solution to the original non-convex problem. Simulation results also verify the proposed BS power model and the green resource management mechanism.

cs.IT↗

arXiv2014

Energy Efficiency Optimization in Relay-Assisted MIMO Systems with Perfect and Statistical CSI

A framework for energy-efficient resource allocation in a single-user, amplify-and-forward relay-assisted MIMO system is devised in this paper. Previous results in this area have focused on rate maximization or sum power minimization problems, whereas fewer results are available when bits/Joule energy efficiency (EE) optimization is the goal. The performance metric to optimize is the ratio between the system's achievable rate and the total consumed power. The optimization is carried out with respect to the source and relay precoding matrices, subject to QoS and power constraints. Such a challenging non-convex problem is tackled by means of fractional programming and and alternating maximization algorithms, for various CSI assumptions at the source and relay. In particular the scenarios of perfect CSI and those of statistical CSI for either the source-relay or the relay-destination channel are addressed. Moreover, sufficient conditions for beamforming optimality are derived, which is useful in simplifying the system design. Numerical results are provided to corroborate the validity of the theoretical findings.

cs.IT↗

arXiv2013

Pareto Boundary of the Rate Region for Single-Stream MIMO Interference Channels: Linear Transceiver Design

We consider a multiple-input multiple-output (MIMO) interference channel (IC), where a single data stream per user is transmitted and each receiver treats interference as noise. The paper focuses on the open problem of computing the outermost boundary (so-called Pareto boundary-PB) of the achievable rate region under linear transceiver design. The Pareto boundary consists of the strict PB and non-strict PB. For the two user case, we compute the non-strict PB and the two ending points of the strict PB exactly. For the strict PB, we formulate the problem to maximize one rate while the other rate is fixed such that a strict PB point is reached. To solve this non-convex optimization problem which results from the hard-coupled two transmit beamformers, we propose an alternating optimization algorithm. Furthermore, we extend the algorithm to the multi-user scenario and show convergence. Numerical simulations illustrate that the proposed algorithm computes a sequence of well-distributed operating points that serve as a reasonable and complete inner bound of the strict PB compared with existing methods.

cs.IT↗

arXiv2013

Alternating Rate Profile Optimization in Single Stream MIMO Interference Channels

The multiple-input multiple-output interference channel is considered with perfect channel information at the transmitters and single-user decoding receivers. With all transmissions restricted to single stream beamforming, we consider the problem of finding all Pareto optimal rate-tuples in the achievable rate region. The problem is cast as a rate profile optimization problem. Due to its nonconvexity, we resort to an alternating approach: For fixed receivers, optimal transmission is known. For fixed transmitters, we show that optimal receive beamforming is a solution to an inverse field of values problem. We prove the solution's stationarity and compare it with existing approaches.

cs.IT↗