TY - GEN
T1 - Variable-Length XP-HARQ for URLLC
AU - Feng, Jiahui
AU - Shi, Zheng
AU - Fu, Yaru
AU - Wang, Hong
AU - Yang, Guanghua
AU - Ma, Shaodan
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - A variable-length cross-packet hybrid automatic repeat request (VL-XP-HARQ) is proposed to accommodate ultrareliable low-latency communications (URLLC). The spectral efficiency (SE) is firstly derived in terms of the outage probabilities, with which the SE is proved to be upper bounded by the ergodic capacity (EC). Moreover, to facilitate the maximization of the SE, the asymptotic outage probability is obtained at high signal-to-noise ratio (SNR), with which the SE is maximized by properly choosing the number of new information bits while guaranteeing outage requirement. By applying Dinkelbach's transform, the fractional objective function is transformed into a subtraction form, which can be decomposed into multiple sub-problems through alternating optimization. By noticing that the asymptotic outage probability is a convex function, each sub-problem can be easily relaxed to a convex problem by adopting successive convex approximation (SCA). Finally, numerical results are presented for verification.
AB - A variable-length cross-packet hybrid automatic repeat request (VL-XP-HARQ) is proposed to accommodate ultrareliable low-latency communications (URLLC). The spectral efficiency (SE) is firstly derived in terms of the outage probabilities, with which the SE is proved to be upper bounded by the ergodic capacity (EC). Moreover, to facilitate the maximization of the SE, the asymptotic outage probability is obtained at high signal-to-noise ratio (SNR), with which the SE is maximized by properly choosing the number of new information bits while guaranteeing outage requirement. By applying Dinkelbach's transform, the fractional objective function is transformed into a subtraction form, which can be decomposed into multiple sub-problems through alternating optimization. By noticing that the asymptotic outage probability is a convex function, each sub-problem can be easily relaxed to a convex problem by adopting successive convex approximation (SCA). Finally, numerical results are presented for verification.
KW - Cross packet
KW - ergodic capacity
KW - hybrid automatic repeat request
KW - incremental redundancy
KW - spectral efficiency
UR - https://www.scopus.com/pages/publications/85217579424
U2 - 10.1109/WCSP62071.2024.10827626
DO - 10.1109/WCSP62071.2024.10827626
M3 - Conference contribution
AN - SCOPUS:85217579424
T3 - 16th International Conference on Wireless Communications and Signal Processing, WCSP 2024
SP - 419
EP - 424
BT - 16th International Conference on Wireless Communications and Signal Processing, WCSP 2024
T2 - 16th International Conference on Wireless Communications and Signal Processing, WCSP 2024
Y2 - 24 October 2024 through 26 October 2024
ER -