CCChangrun Chen

Changrun Chen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Changrun Chen has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Robust LoRa Preamble Detection in Colored Impulsive Noise Using Rank Correlation Coefficients

    by Guanna Huang, Haishen Huang, Changrun Chen, Jisheng Dai, Jiangzhou Wang, Weichao Xu

  • Power and Resource Allocation for Downlink Pilot-Based Cell-Free Integrated Sensing and Communication Systems

    by Jiangwei Liao, Huiling Zhu, Fangyuan Chen, Jiangzhou Wang, Changrun Chen

    In this paper, an integrated sensing and communication (ISAC) system was proposed under cell-free architecture with different power allocation schemes for both communication and sensing functions. In addition to using uplink (UL) pilot transmission for channel estimation, a group of pre-designed orthogonal downlink (DL) pilot sequences are inserted and transmitted from each cooperative access point (AP) towards the user equipments (UEs). The inserted DL pilots in cell-free ISAC are utilized for both channel estimation in communication and cooperative localization in radar sensing. Based on the ISAC strategy, a power allocation scheme is proposed with the objective of minimizing the maximum channel estimation error for each user, under the power constraints of APs and minimum mean square error constraints of the localization. The full-power scheme which APs consume all the available power during the DL phase is also studied and analyzed. The performance of the proposed ISAC strategy is evaluated under a realistic highway scenario, and compared to the existing non-DL strategies. Additionally, we investigate the impact of the pilot ratio under a constrained signal length, as well as the impact of the pilot proportion that the pilot length to the entire signal frame length. Simulation results show that the performances of both channel estimation and localization can be significantly improved at a relatively low cost of extra power needed for APs. Moreover, the analysis provides insights into optimizing the DL/UL pilot ratio and pilot proportion which can significantly enhance both channel estimation and localization accuracy, while ensuring sufficient resources remain available for data payload.


  • Novel Deep Reinforcement Learning for User Association in Fog Radio Access Networks

    by Ignas Laurinavicius, Huiling Zhu, Yijin Pan, Changrun Chen, Jiangzhou Wang

    As an evolution of cloud radio access network (C-RAN), fog radio access network (F-RAN) becomes promising for future mobile communications by enabling processing and caching at fog access points (FAPs). Different from the centralised C-RAN, F-RAN has a semi-distributed architecture, aiming to alleviate traffic load on the fronthaul links in C-RAN. Under the semi-distributed architecture in F-RAN, which employs a cell-free multiple input multiple output (MIMO) access technique, decisions on the joint user-FAP association and transmit power allocation are made at individual FAPs. To mitigate strong interference, FAPs will need to exchange cooperative status information, such as CSI, user association details or transmission power levels. However, this can lead to significant communication overhead within the network and introduce high complexity in the decision-making process. In this paper, accounting for the semi-distributed nature of the F-RAN architecture, reinforcement learning is leveraged as a potential solution to this kind of problem, and a novel multi-agent dual deep Q-network (MA-DDQN) algorithm is proposed by introducing experience exchange in partially observable Markov decision process environments. The simulation results show that the proposed reinforcement learning based algorithm outperforms the DDQN algorithm as well as the existing low-complexity algorithms.


  • Latency Minimization for MEC-V2X Assisted Autonomous Vehicles Task Offloading

    by Yilun Zhang, Changrun Chen, Huiling Zhu, Yijin Pan, Jiangzhou Wang

    Delay-sensitive applications for autonomous vehicles (AVs) require a substantial amount of computational resources. However, the onboard computation resources may be insufficient, resulting in long processing latencies. To deal with this critical issue, we jointly consider roadside unit (RSU) and assistant vehicle offloading, along with resource allocation, to minimize latency for vehicular tasks. This approach also takes into account frequency reuse among sub-areas for assistant vehicle offloading. The latency minimization problem can be formulated as a mixedinteger non-linear programming (MINLP) problem. Given the inherent complexity of the MINLP problem, we propose a twostep solution. The first step focuses on the combined decision of assistant vehicle offloading and transmit power allocation. To solve this problem, we propose a particle swarm optimization (PSO) algorithm with low complexity and low average transmit power. The second step deals with RSU offloading/local computation decision, bandwidth allocation, and computation resource allocation. An iterative algorithm is proposed to achieve the optimal solution. Without adding additional computation resources, simulation results demonstrate that the proposed vehicular task offloading approach improves overall delay performance than the adaptive MEC offloading scheme and the pure MEC computing scheme


  • Improved Weighted Covariance-Based Detector for Spectrum Sensing in Rayleigh Fading Channel

    by Huadong Lai, Mingxing Liu, Jinqiang Xu, Peng Luo, Changrun Chen, Weichao Xu

    In this letter, we propose an improved weighted covariance based detector (IWCD) for spatially correlated time-varying Rayleigh fading channel. The proposed method uses adaptive weights that are tailored to the dynamic nature of the channels. These weights can be chosen manually to meet practical requirements or derived theoretically by optimizing some performance index, such that the IWCD outperforms traditional weighted covariance-based detectors (WCDs), which rely heavily on data-aided weights determined by the sample covariance matrix (SCM). Performance merits in terms of the probabilities of false alarm and detection are analyzed in the low signal-to-noise-ratio (SNR) regime. Besides, the optimal weights are derived via maximizing the modified deflection coefficient (MDC). A reasonable estimator of the optimal weights is also constructed armed with the available samples at hand. Theoretical analyses and experimental results demonstrate the superiority of our proposed method over existing works in various scenarios.


  • A Nonparametric Approach to Signal Detection in Non-Gaussian Noise

    by Changrun Chen, Weichao Xu, Yijin Pan, Huiling Zhu, Jiangzhou Wang

    This letter proposes a nonparametric detector, termed as Gini Correlation (GC), to solve the classical problem of detecting deterministic signals buried in impulsive noise. With the help of the popular Middleton’s Class-A impulsive noise (MCAN) model, we derive the expectation and variance of GC under alternative hypothesis and null hypothesis, which, along with the central limit theorem, are further employed for determining the detection probability and the detection threshold. The results show that the proposed detector possesses a constant false alarm rate property. Monte Carlo simulations verify not only the correctness of our theoretical findings but also the superiority of GC to other state-of-the-art methods in terms of receiver operating characteristic (ROC) curves and asymptotic relative efficiency (ARE) curves.


  • Rank Correlation Based Detection of Known Signals in Middleton's Class-A Noise

    by Changrun Chen, Weichao Xu, Yijin Pan, Huiling Zhu, Jiangzhou Wang

    This letter proposes to apply two rank correlations, namely, Kendall's tau (KT) and Spearman's rho (SR), to the fundamental problem of detecting known signals in impulsive noise. Under the popular Middleton's Class-A impulsive noise model, we derived the expectations and variances of KT and SR, which, along with the central limit theorem, are further employed to determing the detection threshold and the detection probability. Monte Carlo simulations not only verified the correctness of our theoretical findings, but also demonstrated the superiority of KT and SR to other five state-of-the-art methods in terms of detection probability.


  • Open Access

    Change Point Detection with Mean Shift Based on AUC from Symmetric Sliding Windows

    by Yanguang Wang, Guanna Huang, Junjie Yang, Huadong Lai, Shun Liu, Changrun Chen, Weichao Xu

    Change point detection is widely used in signal detection, industrial engineering, economy, finance, biomedicine and many other fields. The widely used parametric methods require prior knowledge of the noise signal distribution, which are seldom realistic. In practice, when the distribution of noise is not known, it is desirable to design algorithms based on non-parametric statistics, which, in the null case (no change point), are completely distribution free. To this end, we propose to use two symmetric sliding windows to compute the Area Under the receiver operating characteristic Curve (AUC) as a test statistic to measure the difference between the distribution of two samples. In the stage of change point detection, a threshold is designed according to hypothesis test which is based on the null distribution of the test statistics. This threshold is used to detect the potential change points in the signal. To reduce the probability of false alarm detection, a key parameter K is set to distinguish and delete the false alarms in potential change points. Comparative studies showed that our proposed method outperforms the classical Relative unconstrained Least-Squares Importance Fitting (RuLSIF) algorithm and is also better than the Hawkins, Qiu, and Kang (HQK) algorithm when the noise follows non-normal distributions.