CGCaihong Gong

Caihong Gong

*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


Caihong Gong has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Secure Transmission for Active STARS Aided NOMA Systems

    by Caihong Gong, Jiarong Sun, Xinwei Yue

  • Online censoring diffusion augmented complex-valued subband adaptive filtering

    by Shuyuan Zhang, Pengwei Wen, Zhao Li, Caihong Gong, Fangfang Bian, Botao Jin


  • On the Design of Capacity-Achieving Distributions for Discrete-Time Poisson Channel With Low-Precision ADCs

    by Qianqian Li, Lintao Li, Lixiang Liu, Lei Yang, Caihong Gong, Hua Li, Shiya Hao, Xiaoming Dai

    This paper investigates the design of the capacity-achieving input distribution for the discrete-time Poisson channel (DTPC) under dark current effects with low-precision analog-to-digital converters (ADCs). An efficient algorithm integrating the Newton-Raphson and Blahut-Arimoto (BA) methods is proposed to jointly optimize the input distribution and amplitude levels under both peak and average power constraints. Additionally, the Karush-Kuhn-Tucker (KKT) conditions are established to provide necessary and sufficient conditions for the optimality of the obtained capacity-achieving distribution. Simulation results illustrate that the proposed algorithm attains 72% and 83% of the theoretical capacity at 5 dB for 1-bit and 2-bit quantized DTPC, respectively. Furthermore, for a DTPC with finite-precision quantization (i.e., ${\log _{2}}K$ bits), the capacity can be achieved by a non-uniform discrete input distribution with support for $K$ mass points, under the given power constraints.


  • OTFS-PDMA Scheme With EPA-Based Receivers for High-Mobility IoT Networks

    by Hua Li, Caihong Gong, Qianqian Li, Shiya Hao, Xiyuan Wang, Xiaoming Dai

    The sixth-generation (6G) network is considered a promising enabler of the Internet of Things (IoT), with potential applications spanning from terrestrial to non-terrestrial terminals. In this paper, a novel orthogonal time frequency space (OTFS)-based pattern division multiple access (PDMA) scheme, shortened as OTFS-PDMA, is proposed to meet the low-latency, high-reliability, and massive connection requirements of 6G networks in high-mobility scenarios. A combined detection approach is proposed for the OTFS-PDMA scheme based on the expectation propagation algorithm (EPA). To mitigate the detrimental effect of base station antenna correlation, we design a vector EPA (V-EPA) receiver by combining different receive antennas at each delay-Doppler domain resource element. A pattern-aware serial mechanism is proposed to facilitate the convergence of the proposed EPA and V-EPA receivers by exploiting the convergence-amenable property of the PDMA scheme. An iterative detection and decoding (IDD) structure with parallel interference cancellation (PIC) is integrated into the proposed receivers to further improve the system performance. Simulation results illustrate that the proposed OTFS-PDMA scheme with EPA-based receivers achieves significant performance gains over the conventional OTFS-OMA scheme. Moreover, the proposed V-EPA receiver provides a good performance-complexity trade-off, particularly in spatially correlated multiple-input multiple-output (MIMO) channels.


  • Active RIS Enabled Secure NOMA Communications With Discrete Phase Shifting

    by Caihong Gong, Hua Li, Shiya Hao, Keping Long, Xiaoming Dai

    Active reconfigurable intelligent surface (RIS) is deemed a prospective candidate to compensate the double fading attenuation caused by the passive RIS, where each element can reflect and amplify the received signals through its low power integrating amplifiers. This paper investigates the physical layer security (PLS) for a non-orthogonal multiple access (NOMA) system through a deployed active RIS to defend multiple eavesdroppers (Eves), where the practical discrete RIS phase shift designs are taken into account. To characterize the secrecy performance, analytical expressions of secrecy outage probability (SOP) and effective secrecy throughput (EST) for an active RIS assisted NOMA (RIS-NOMA) system are derived based on heuristic approximations, which is in consideration of two scenarios with and without direct links. Furthermore, secrecy diversity orders are attained based on theoretical results, of which the convergence rates and gaps between the discrete and continuous phase shifting are further evaluated. The results reveal that a 4-bit quantization can achieve the secrecy diversity order of continuous phase shifts. Numerical results are furnished to corroborate the analyses, and illustrate that the security performance for active RIS-NOMA outperforms the passive RIS-NOMA and conventional cooperation communications under the same total power consumption. The impacts of phase quantization bit, amplification factor and the number of Eves as well as reflective elements on security performance are also substantiated by simulations.


  • Gaussian Message Passing Detection With Constant Front-Haul Signaling for Cell-Free Massive MIMO

    by Hua Li, Yuanyuan Dong, Caihong Gong, Xiyuan Wang, Xiaoming Dai

    The cell-free concept has garnered great attention in the industry and academia and is envisaged to be a promising technology for beyond fifth generation (5 G) networks. However, the extremely high front-haul and computational overhead of the original cell-free network with centralized or star topologies limits its practical adoption. In this work, we propose a novel non-linear sequential detection method based on the Gaussian message passing algorithm (GMP) for the sequential topology, i.e., radio stripe network, which requires constant front-haul signaling as the number of access points (APs) increases. Specifically, each AP iteratively calculates means and variances locally and fuses them with the received messages from the preceding AP based on the product principle of the multivariate Gaussian probability density function. The fused messages are forwarded to the next AP to calculate the a priori probability with constant front-haul signaling, which is independent of the number of APs. Simulation results demonstrate that the proposed sequential GMP detector achieves an attractive trade-off between bit error rate (BER) performance, computational complexity, and front-haul requirements.


  • Decentralized Groupwise Expectation Propagation Detector for Uplink Massive MU-MIMO Systems

    by Hua Li, Yuanyuan Dong, Caihong Gong, Xiyuan Wang, Xiaoming Dai

    With the proliferation of emerging Internet-of-Things (IoT) applications, massive multi-user multiple-input multiple-output (MU-MIMO) is a promising technology to support the massive connectivity requirement with limited spectral resources. The existing detection algorithms are mainly designed based on a centralized baseband processing architecture, which requires extremely high raw baseband data rates transferred between base-station antennas and the central processing unit (CPU). Decentralized baseband processing (DBP) architecture has recently been proposed to alleviate high interconnect data rates and chip input/output bandwidth bottlenecks. Since the information is not fully shared among each antenna cluster, conventional decentralized detectors suffer from significant performance loss, especially for systems with high overload ratios and/or spatially correlated channels. In this work, we first propose a decentralized group-wise detection paradigm for the star architecture by dividing users into multiple user groups, which can be effectively exploited by factor graph-based message passing algorithms, such as the expectation propagation (EP) algorithm. Then, an efficient message fusion rule is devised based on the product principle of multivariate Gaussian probability density function at the CPU. To reduce the computational complexity, an approximate group-wise EP (AGW-EP) method is proposed by judiciously selecting reliable constellation vectors during the symbol belief calculation phase. In addition, we extend the proposed methods to the daisy-chain architecture, which requires constant interconnect data rates. Simulation results demonstrate that the proposed group-wise paradigm greatly enhances the performance of the conventional EP detector. Moreover, the proposed decentralized GW-EP and AGW-EP detection schemes outperform their counterparts, particularly in correlated MIMO channels.


  • An Enhanced Fully Decentralized Detector for the Uplink M-MIMO System

    by Yuanyuan Dong, Hua Li, Caihong Gong, Xiyuan Wang, Xiaoming Dai

    Decentralized baseband processing (DBP) architectures can alleviate the extremely high interconnect data rates and chip input/output (I/O) bandwidth bottlenecks of the conventional centralized massive multiple-input multiple-output (M-MIMO) system. Nonetheless, fully decentralized (FD) detectors suffer significant performance loss compared with the centralized counterparts due to the constrained information-sharing between antenna clusters, especially for systems with a large number of antenna clusters and/or high-order modulation. In this work, we propose an enhanced message-passing-based FD detection method by utilizing an information-lossless factor graph (FG) transformation scheme. As an illustrative example, the expectation propagation (EP) algorithm is considered in this work. In each antenna cluster, the FG is transformed to a less-loopy one and the effective interference of users is suppressed. Based on the message-passing principle of the EP algorithm, we devise an efficient non-linear fusion scheme in the central processing unit (CPU). In addition, a compensation factor accounting for the cluster profile is introduced to mitigate the inaccuracy of message-passing caused by DBP, thus further enhancing the detection performance. Numerical results demonstrate that the proposed enhanced FD detector obtains significantly better performance than the counterpart with even lower computational complexity, especially in a large number of antenna clusters and/or high-order modulation scenarios.


  • Intelligent Reflecting Surface Aided Secure Communications for NOMA Networks

    by Caihong Gong, Xinwei Yue, Xiyuan Wang, Xiaoming Dai, Runmin Zou, Mohamed Essaaidi

    Intelligent reflecting surface (IRS) is deemed a promising technique for future wireless and mobile technologies due to its ability to reconfigure the radio propagation environment. In this paper, we analyze the physical layer security (PLS) of a downlink non-orthogonal multiple access (NOMA) network through an IRS intended for assisting the wireless transmission, taking into account the external and internal eavesdropping scenarios. Considering the hardware limitations, a 1-bit coding scheme is utilized to investigate the secrecy performance of the IRS-aided NOMA (IRS-NOMA) network. Exact and asymptotic expressions in terms of the secrecy outage probability (SOP) and the effective secrecy throughput (EST) are presented, which are in consideration of the imperfect successive interference cancellation (ipSIC) and perfect SIC (pSIC). Based on the analytical results, the secrecy diversity orders are related to the number of reflecting elements and EST ceilings are observed in the high SNR regime. Monte Carlo simulations are presented to corroborate the correctness of the analyses and illustrate that the IRS-NOMA scheme is superior in the secrecy outage performance to the IRS-aided orthogonal multiple access scheme. In addition, the SOP performance enhancement through the increased number of reflecting elements and the improvement of EST through proper target secrecy rate are also evidenced by the simulations.