XYXinrong Ye

Xinrong Ye

*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


Xinrong Ye has a total of 18 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Trajectory Planning for ISAC Systems: Variational Method to Minimization of Completion Time

    by Jintao Wang, Zheng Shi, Hong Wang, Yaru Fu, Xinrong Ye, Shaodan Ma, Guanghua Yang

    Integrated sensing and communication (ISAC) en ables a unified framework for high-capacity communications and accurate sensing, where trajectory optimization plays a crucial role in jointly enhancing communication quality and sensing performance. This paper explores trajectory planning for ISAC systems, aiming to minimize the completion time for a radio target (RT) to traverse between designated starting and ending points, while fulfilling a communication task with a minimum data transmission requirement. We introduce the concept of path exposure to characterize path sensitivity by capturing the cumulative sensing intensity along a trajectory. Furthermore, path capacity is proposed to measure the end-to end throughput of a given path. The trajectory planning problem is formulated as the minimization of completion time while maintaining path sensitivity and path capacity requirements. By leveraging the Lagrangian approach, the problem is converted into a framework with calculus of variations and solved using the Euler–Lagrange equation. The boundary value problem (BVP) methodology is then employed to compute the optimal trajectory. Simulation results demonstrate the effectiveness of the proposed continuous trajectory planning approach compared to discrete methods and highlight the inherent trade-off between trajectory length and the quality-of-service requirements in both sensing and communication domains.


  • BLER Analysis and Optimal Power Allocation of HARQ-IR for Mission-Critical IoT Communications

    by Fuchao He, Zheng Shi, Binggui Zhou, Guanghua Yang, Xiaofan Li, Xinrong Ye, Shaodan Ma

    This article examines the application of hybrid automatic repeat request with incremental redundancy (HARQ-IR) to reliable mission-critical Internet of Things (IoT) communications, which frequently use short packets to meet low latency of mission. We first analyze the average block error rate (BLER) of HARQ-IR-aided short packet communications. The finite-blocklength information theory and the correlated decoding events preclude the analysis of BLER. To overcome the issue, the recursive formulation of the average BLER motivates us to calculate its value through trapezoidal approximation and Gauss-Laguerre quadrature. Besides, dynamic programming is applied to implement Gauss-Laguerre quadrature to avoid redundant calculations. Moreover, the asymptotic analysis is performed to derive a simple expression for the asymptotic average BLER at high-signal-to-noise ratio (SNR). Then, we study the maximization of long-term average throughput (LTAT) via power allocation meanwhile ensuring power and BLER constraints. To tackle the fractional and nonconvex problem, the asymptotic BLER is employed to convert the original problem into a convex one through geometric programming (GP). Unfortunately, since there is a large approximation error at low SNR, the GP-based solution underestimates the LTAT performance in the circumstance. Alternatively, we develop a deep reinforcement learning (DRL)-based framework to learn the optimal power allocation policy. In particular, the optimization problem is transformed into a constrained Markov decision process problem, which is solved by integrating deep deterministic policy gradient(DDPG) and subgradient method. The numerical results demonstrate that the DRL-based method outperforms the GP-based one at low SNR, albeit at the cost of increasing computational burden.


  • Open Access

    A Novel HARQ-CC Assisted SCMA Scheme

    by Man Wang, Zheng Shi, Yunfei Li, Xianda Wu, Weiqiang Tan, Xinrong Ye

    This letter proposes a novel hybrid automatic repeat request with chase combining assisted sparse code multiple access (HARQ-CC-SCMA) scheme. Depending on whether the same superimposed packet are retransmitted, synchronous and asynchronous modes are considered for retransmissions. Moreover, factor graph aggregation (FGA) and Log-likelihood ratio combination (LLRC) are proposed for multi-user detection. Regarding FGA, a large-scale factor graph is constructed by combining all the received superimposed signals and message passing algorithm (MAP) is applied to calculate log-likelihood ratio (LLR). Whereas, owing to the same unsuccessful messages required to be retransmitted, LLRC adds up LLRs of erroneously received packets in previous HARQ rounds together with currently received packets for channel decoding and saves the LLRs for failed users. Finally, Monte Carlo simulations are preformed to show that FGA surpasses LLRC and HARQ with incremental redundancy (HARQ-IR) in synchronous mode. However, LLRC performs better than FGA at low signal-to-noise ratio (SNR) in asynchronous mode. This is because failed messages after the maximum allowable HARQ rounds in this mode can yield significant error propagation in low SNR regime.

  • Open Access

    HARQ-IR Aided Short Packet Communications: BLER Analysis and Throughput Maximization

    by Fuchao He, Zheng Shi, Guanghua Yang, Xiaofan Li, Xinrong Ye, Shaodan Ma

    This paper introduces hybrid automatic repeat request with incremental redundancy (HARQ-IR) to boost the reliability of short packet communications. The finite blocklength information theory and correlated decoding events tremendously preclude the analysis of average block error rate (BLER). Fortunately, the recursive form of average BLER motivates us to calculate its value through the trapezoidal approximation and Gauss-Laguerre quadrature. Moreover, the asymptotic analysis is performed to derive a simple expression for the average BLER at high signal-to-noise ratio (SNR). Then, we study the maximization of long term average throughput (LTAT) via power allocation meanwhile ensuring the power and the BLER constraints. For tractability, the asymptotic BLER is employed to solve the problem through geometric programming (GP). However, the GP-based solution underestimates the LTAT at low SNR due to a large approximation error in this case. Alternatively, we also develop a deep reinforcement learning (DRL)-based framework to learn power allocation policy. In particular, the optimization problem is transformed into a constrained Markov decision process, which is solved by integrating deep deterministic policy gradient (DDPG) with subgradient method. The numerical results finally demonstrate that the DRL-based method outperforms the GP-based one at low SNR, albeit at the cost of increasing computational burden.