Runhe Qiu

Runhe Qiu


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
27 September 2020 in Entropy
Verified
Journal Article
Open access
PDF file
KZKun Zhang
Kun Zhang
Xue-qin JiangXue-qin Jiang
Xue-qin Jiang
YFYan Feng
Yan Feng
RQRunhe Qiu
Runhe Qiu
Enjian BaiEnjian Bai
Enjian Bai
Due to the rapid development of quantum computing technology, encryption systems based on computational complexity are facing serious threats. Based on the fundamental theorem of quantum mechanics, continuous-variable quantum key distribution (CVQKD) has the property of physical absolute security and can effectively overcome the dependence of the current encryption system on the computational complexity. In this paper, we construct the spatially coupled (SC)-low-density parity-check (LDPC) codes and quasi-cyclic (QC)-LDPC codes by adopting the parity-check matrices of LDPC codes in the Advanced Television Systems Committee (ATSC) 3.0 standard as base matrices and introduce these codes for information reconciliation in the CVQKD system in order to improve the performance of reconciliation efficiency, and then make further improvements to final secret key rate and transmission distance. Simulation results show that the proposed LDPC codes can achieve reconciliation efficiency of higher than 0.96. Moreover, we can obtain a high final secret key rate and a long transmission distance through using our proposed LDPC codes for information reconciliation.

14 October 2021 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
KZKai Zhang
Kai Zhang
HHHan Hai
Han Hai
Miaowen WenMiaowen Wen
Miaowen Wen
Xue-qin JiangXue-qin Jiang
Xue-qin Jiang
RQRunhe Qiu
Runhe Qiu
In this paper, we propose a novel generalized space-code index modulation (GSCIM) scheme for spectrum-efficient and energy-saving transmission. In our proposed scheme, the input information bits are transmitted not only by modulated symbols, but also by the activated transmit antennas pattern and the selected spreading code patterns for the in-phase and quadrature components. Due to the increase of the index dimension, more information bits can be implicitly transmitted, which can improve energy efficiency and have a higher data rate compared with spatial modulation (SM), generalized SM (GSM), generalized CIM-aided SM (GCIM-SM) and CIM-aided quadrature spatial modulation (CIM-QSM). In order to further reduce the complexity of despreading-based maximum likelihood (ML) detection, we propose an enhanced low-complexity detector that can achieve near-ML error performance. An analytical upper bound on the average bit error probability associated with the optimal ML detection is derived, which is verified by simulation results. Simulation results also show that the proposed GSCIM scheme outperforms SM, GSM, GCIM-SM and CIM-QSM schemes in terms of error performance.

5 July 2023 in Science China Information Sciences
Verified
Journal Article
Closed access
PDF file
YFYan Feng
Yan Feng
RQRunhe Qiu
Runhe Qiu
KZKun Zhang
Kun Zhang
Xue-qin JiangXue-qin Jiang
Xue-qin Jiang
MZMeixiang Zhang
Meixiang Zhang
GZGuihua Zeng
Guihua Zeng

7 March 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
KZKai Zhang
Kai Zhang
Xue-qin JiangXue-qin Jiang
Xue-qin Jiang
HHHan Hai
Han Hai
RQRunhe Qiu
Runhe Qiu
Shahid MumtazShahid Mumtaz
Shahid Mumtaz
Present orthogonal time frequency space modulation with index modulation (OTFS-IM) techniques activate a given number of grids in the delay-Doppler (DD) domain and employ fixed constellation as changing them would result in ambiguous detection. Motivated by this, we propose a novel enhanced OTFS with index modulation (E-OTFS-IM) scheme which permits changing the number of active grids conveying modulation symbols from any constellation. The proposed E-OTFS-IM scheme alleviates ambiguous detection by jointly mapping information to grid activation pattern in DD domain and 2D modulation symbols. We also propose an efficient encoding method for E-OTFS-IM. In addition, an updated message passing (MP) detection suitable for E-OTFS-IM as well as its low-complexity improvement are developed. We derive a average bit error probability (ABEP) upper bound for our proposed E-OTFS-IM scheme employing the maximum likelihood detector. Additionally, we also propose an enhanced scheme named E-OTFS-IM with in-phase/quadrature (E-OTFS-IM-IQ) to further improve the spectral efficiency and reliability. In E-OTFS-IM-IQ, the principle of E-OTFS-IM is extended to in-phase and quadrature branches independently. The efficient encoding method and MP detector for this modified scheme is also introduced. Simulation results confirm that the derived ABEP upper bound is tight in the high signal-to-noise ratio region, and show that our proposed E-OTFS-IM improves the performance of conventional OTFS and OTFS-IM. The results also indicate the proposed E-OTFS-IM-IQ achieves better bit error rate performance than E-OTFS-IM.

20 January 2021 in IEEE Access
Verified
Journal Article
Open access
MCMengjie Chu
Mengjie Chu
RQRunhe Qiu
Runhe Qiu
Xue-qin JiangXue-qin Jiang
Xue-qin Jiang
Owing to its high spectrum efficiency (SE), two-way relaying has aroused tremendous research interests. In this paper, the spectrum-energy efficiency (SE-EE) trade-off in decode-and-forward (DF) two-way multi-relay networks is studied by considering non-ideal power amplifiers and non-negligible circuit. Firstly, we consider the scenario of several relay nodes. To achieve better performance, the relay node with the highest energy efficiency (EE) is selected as the optimal one. Secondly, we design the optimal power allocation method to allocate each node with the optimal transmission power to enhance EE and SE. Finally, we evaluate the performance of our method and additionally analyze how the change of relay nodes’ relative position influences the EE and SE. Simulation results show that: 1) the proposed method can achieve higher SE than optimal relay equal power allocation, random relay equal power allocation, and optimal power allocation only; 2) the proposed method can achieve higher EE than optimal relay equal power allocation, random relay equal power allocation, and optimal power allocation only; and 3) EE and SE increase at first and then decrease when relay nodes move from the middle of the source node and destination node to both ends.

6 August 2020 in IEEE Access
Verified
Journal Article
Open access
STShaohua Tao
Shaohua Tao
RQRunhe Qiu
Runhe Qiu
YPYuan Ping
Yuan Ping
WXWoping Xu
Woping Xu
HMHui Ma
Hui Ma
Studying the similarities between the concepts in a knowledge graph can be useful in making friend recommendations on various microblogging platforms. Most existing approaches that only focus on accurate friend recommendation and can not give a reasoning explaining. In addition, existing similarity measurements are too costly and ineffective to be used in practical applications. To solve these problems, we purposed the shortest path-guide reasoning path, we perform explicit reasoning with knowledge for decision making so that the friend recommendation are supported by an interpretable causal inference. Then we designed a novel Weighted Euclidean-Shortest Path (WESP) method for measuring concept similarity in a knowledge graph and applied it to friend recommendations on a microblogging platform. First we took the shortest path as an example to measure concepts similarity. Although it was easy to use the shortest path to measure the similarity between concept pairs, the results of the measurements via the shortest path were affected by local structural imbalance in the knowledge graph. The imbalance had a significant impact on measuring concepts similarity; the more balanced the local structure, the greater similarity between the concept pairs. Then, we applied the WESP method to friend recommendations on the microblogging platform. We use the optimization similarity measurement (OSM) model that calculated the similarity between corresponding concept pairs. Our experimental results showed that the OSM method achieved better performance than the baseline methods in making friend recommendations.