Yuanyuan Dong
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
Research Subjects
Yuanyuan Dong has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoming Dai
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China
13 shared publications Xiyuan Wang
School of Information and Communication Engineering, Beijing Information Science and Technology University, Beijing, China
12 shared publications- Hua Li
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China
9 shared publications - Zhenyu Zhang
Industry Standardization and Research Department, Xiaomi Corporation, Beijing, China
8 shared publications - Caihong Gong
Zhongyuan University of Technology
7 shared publications - Keping Long
University of Science and Technology Beijing
3 shared publications
Latest Publications
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 7581-7598
Joint Power Control and Beamforming Design for NOMA-Based CF-ISAC Systems
Integrated sensing and communication (ISAC) frameworks leverage shared electromagnetic signals and spectrum resources to enable concurrent data transmission and target sensing within wireless networks. Moreover, ISAC is evolving alongside advancements in technologies such as massive multiple-input multiple-output (M-MIMO) architectures, cell-free (CF) networking, and non-orthogonal multiple access (NOMA) schemes. This convergence is creating more efficient and reliable solutions for next-generation systems. This paper introduces a novel NOMA-based CF-ISAC framework to enhance system performance in terms of connectivity density, spectrum efficiency, and service consistency, thereby effectively addressing the demands of ultra-dense user scenarios. We consider a system model featuring downlink communication and single-target sensing with decoupled transceiver units. A joint optimization framework coordinating power control and beamforming design is constructed to maximize sensing signal-to-noise ratio (SNR) while guaranteeing the communication rate requirements. To resolve the inherent non-convexity, we propose two iterative optimization frameworks: 1) a joint optimization architecture utilizing the semidefinite relaxation (SDR), successive convex approximation (SCA), and arithmetic-geometric mean inequality methods to convert the original NP-hard problem into a mathematically tractable convex program, and 2) an alternating optimization architecture leveraging the iterative block coordinate descent (IBCD) algorithm to decompose the original non-convex problem into two convex sub-problems. To avoid infeasibility traps induced by naive stochastic initialization, we develop a reliable initialization algorithm for the joint optimization procedure. Simulation results validate the effectiveness of the proposed methods, which show significant performance improvements over existing approaches, especially in resource-constrained scenarios.
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 7581-7598
Joint Power Control and Beamforming Design for NOMA-Based CF-ISAC Systems
Integrated sensing and communication (ISAC) frameworks leverage shared electromagnetic signals and spectrum resources to enable concurrent data transmission and target sensing within wireless networks. Moreover, ISAC is evolving alongside advancements in technologies such as massive multiple-input multiple-output (M-MIMO) architectures, cell-free (CF) networking, and non-orthogonal multiple access (NOMA) schemes. This convergence is creating more efficient and reliable solutions for next-generation systems. This paper introduces a novel NOMA-based CF-ISAC framework to enhance system performance in terms of connectivity density, spectrum efficiency, and service consistency, thereby effectively addressing the demands of ultra-dense user scenarios. We consider a system model featuring downlink communication and single-target sensing with decoupled transceiver units. A joint optimization framework coordinating power control and beamforming design is constructed to maximize sensing signal-to-noise ratio (SNR) while guaranteeing the communication rate requirements. To resolve the inherent non-convexity, we propose two iterative optimization frameworks: 1) a joint optimization architecture utilizing the semidefinite relaxation (SDR), successive convex approximation (SCA), and arithmetic-geometric mean inequality methods to convert the original NP-hard problem into a mathematically tractable convex program, and 2) an alternating optimization architecture leveraging the iterative block coordinate descent (IBCD) algorithm to decompose the original non-convex problem into two convex sub-problems. To avoid infeasibility traps induced by naive stochastic initialization, we develop a reliable initialization algorithm for the joint optimization procedure. Simulation results validate the effectiveness of the proposed methods, which show significant performance improvements over existing approaches, especially in resource-constrained scenarios.
- 5 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (6) , 6749-6763
Joint User Pairing and Beamforming Design for NOMA-Aided CFMM-ISAC Systems
Integrated sensing and communication (ISAC) systems with cell-free massive multiple-input-multiple-output (CFMM) frameworks can offer significant performance improvements for both sensing and communication functions. However, there is an obstacle to the system supporting an extremely large number of users in explosive terminal access scenarios. In this article, we propose a novel nonorthogonal multiple access (NOMA)-aided CFMM-ISAC architecture to enhance the connectivity and efficiency of the system. First, we consider a commonly used single-radar sensing scenario and jointly design user pairing and beamforming to maximize the minimum achievable communication rate while ensuring the sensing requirement. To solve the nonconvexity of the formulated optimization problem, the binary variables denoting the feasible pairing of users are first relaxed into continuous variables. An iterative optimization programming algorithm is then developed using the semidefinite relaxation (SDR), rank-one constraint omission (RCO), and successive convex approximation (SCA) approaches. To obtain feasible initial points of the iterative algorithm, we propose an initial point construction algorithm. Based on the obtained user pairing strategy, a corrective beamforming scheme is devised. We further extend our proposed algorithms to a generalized multiradar sensing scenario. Simulation results validate that the proposed joint user pairing and beamforming design achieves noticeable performance improvements compared to the existing methods.
- 5 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (6) , 6749-6763
Joint User Pairing and Beamforming Design for NOMA-Aided CFMM-ISAC Systems
Integrated sensing and communication (ISAC) systems with cell-free massive multiple-input-multiple-output (CFMM) frameworks can offer significant performance improvements for both sensing and communication functions. However, there is an obstacle to the system supporting an extremely large number of users in explosive terminal access scenarios. In this article, we propose a novel nonorthogonal multiple access (NOMA)-aided CFMM-ISAC architecture to enhance the connectivity and efficiency of the system. First, we consider a commonly used single-radar sensing scenario and jointly design user pairing and beamforming to maximize the minimum achievable communication rate while ensuring the sensing requirement. To solve the nonconvexity of the formulated optimization problem, the binary variables denoting the feasible pairing of users are first relaxed into continuous variables. An iterative optimization programming algorithm is then developed using the semidefinite relaxation (SDR), rank-one constraint omission (RCO), and successive convex approximation (SCA) approaches. To obtain feasible initial points of the iterative algorithm, we propose an initial point construction algorithm. Based on the obtained user pairing strategy, a corrective beamforming scheme is devised. We further extend our proposed algorithms to a generalized multiradar sensing scenario. Simulation results validate that the proposed joint user pairing and beamforming design achieves noticeable performance improvements compared to the existing methods.
- 5 December 2023
- Published by Elsevier in Digital Signal Processing
- Vol. 145
Cell-free ISAC massive MIMO systems with capacity-constrained fronthaul links
- 5 December 2023
- Published by Elsevier in Digital Signal Processing
- Vol. 145
Cell-free ISAC massive MIMO systems with capacity-constrained fronthaul links
- 22 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 10 (3) , 1612-1622
Residual Transceiver Impairments Aware Expectation Propagation Algorithm Receiver for PDMA Systems
Pattern division multiple access (PDMA) is a promising non-orthogonal multiple access technology for the next generation wireless communication systems. In PDMA systems, the inherent residual transceiver impairments introduced by nonideal hardwares incur significant performance degradation. In this paper, we propose a residual-transceiver-impairments-aware (RTIA) expectation propagation algorithm (EPA) receiver to mitigate the detrimental influences of the nonideal hardware imperfections for uplink PDMA systems. The user-specific transmitter distortion powers are considered in the message passing procedure of the EPA detection. The parallel interference cancellation (PIC) scheme is incorporated into the proposed RTIA-EPA receiver to further improve the system performance and reduce the computational complexity. Simulation results illustrate that the proposed RTIA-EPA and RTIA-EPA-PIC receivers achieve significant performance gains over the conventional residual-transceiver-impairments-agnostic counterparts with negligible computational complexity overhead.
- 22 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 10 (3) , 1612-1622
Residual Transceiver Impairments Aware Expectation Propagation Algorithm Receiver for PDMA Systems
Pattern division multiple access (PDMA) is a promising non-orthogonal multiple access technology for the next generation wireless communication systems. In PDMA systems, the inherent residual transceiver impairments introduced by nonideal hardwares incur significant performance degradation. In this paper, we propose a residual-transceiver-impairments-aware (RTIA) expectation propagation algorithm (EPA) receiver to mitigate the detrimental influences of the nonideal hardware imperfections for uplink PDMA systems. The user-specific transmitter distortion powers are considered in the message passing procedure of the EPA detection. The parallel interference cancellation (PIC) scheme is incorporated into the proposed RTIA-EPA receiver to further improve the system performance and reduce the computational complexity. Simulation results illustrate that the proposed RTIA-EPA and RTIA-EPA-PIC receivers achieve significant performance gains over the conventional residual-transceiver-impairments-agnostic counterparts with negligible computational complexity overhead.
- 23 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (4) , 5395-5400
Gaussian Message Passing Detection With Constant Front-Haul Signaling for Cell-Free Massive MIMO
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.
- 23 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (4) , 5395-5400
Gaussian Message Passing Detection With Constant Front-Haul Signaling for Cell-Free Massive MIMO
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.
- 15 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (6) , 5393-5405
Decentralized Groupwise Expectation Propagation Detector for Uplink Massive MU-MIMO Systems
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.
- 15 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (6) , 5393-5405
Decentralized Groupwise Expectation Propagation Detector for Uplink Massive MU-MIMO Systems
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.
- 12 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (2) , 2049-2052
Robust Expectation Propagation Detector in Impulsive Noise Channel
In this work, we propose a robust expectation propagation (REP) detector for a system contaminated with impulsive noise. The core idea of the REP is to apply a disperse transformation to the received signal and an associated channel sparsification operation. The proposed disperse transformation distributes the impulsive noise component to multiple physical resource elements. The transformed impulsive noise exhibits greater Gaussianity and better matches the Gaussian assumption of the EP algorithm. The associated channel sparsification can alleviate the adverse effects of deleterious message propagation caused by impulsive noise during the iterative process. Simulation results demonstrate that the proposed REP detector exhibits greater resilience to impulsive noise than the classical EP detector, especially for systems with a high probability of impulsive noise occurrence and/or high-order modulation.
- 12 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (2) , 2049-2052
Robust Expectation Propagation Detector in Impulsive Noise Channel
In this work, we propose a robust expectation propagation (REP) detector for a system contaminated with impulsive noise. The core idea of the REP is to apply a disperse transformation to the received signal and an associated channel sparsification operation. The proposed disperse transformation distributes the impulsive noise component to multiple physical resource elements. The transformed impulsive noise exhibits greater Gaussianity and better matches the Gaussian assumption of the EP algorithm. The associated channel sparsification can alleviate the adverse effects of deleterious message propagation caused by impulsive noise during the iterative process. Simulation results demonstrate that the proposed REP detector exhibits greater resilience to impulsive noise than the classical EP detector, especially for systems with a high probability of impulsive noise occurrence and/or high-order modulation.
- 18 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (12) , 13030-13042
An Enhanced Fully Decentralized Detector for the Uplink M-MIMO System
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.
- 18 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (12) , 13030-13042
An Enhanced Fully Decentralized Detector for the Uplink M-MIMO System
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.
- 7 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (2) , 2152-2157
Decentralized Baseband Processing With Gaussian Message Passing Detection for Uplink Massive MU-MIMO Systems
Decentralized baseband processing (DBP) architecture, which partitions the base station antennas into multiple antenna clusters, has been recently proposed to alleviate the excessively high interconnect bandwidth, chip input/output data rates, and detection complexity for massive multi-user multiple-input multiple-output (MU-MIMO) systems. In this paper, we propose a novel decentralized Gaussian message passing (GMP) detection for the DBP architecture. Based on the message passing rule, each antenna cluster iteratively calculated the local means and variances which are fused to generate the global symbol beliefs for demodulation. The state evolution framework of the decentralized GMP algorithm is presented under the assumptions of large-system limit and Gaussian sources. Analytical results corroborated by simulations demonstrate that the nonuniform antenna cluster partition scheme exhibits a higher convergence rate than the uniform counterpart. Simulation results illustrate that the proposed decentralized GMP detection outperforms the recently proposed decentralized algorithms.
- 7 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (2) , 2152-2157
Decentralized Baseband Processing With Gaussian Message Passing Detection for Uplink Massive MU-MIMO Systems
Decentralized baseband processing (DBP) architecture, which partitions the base station antennas into multiple antenna clusters, has been recently proposed to alleviate the excessively high interconnect bandwidth, chip input/output data rates, and detection complexity for massive multi-user multiple-input multiple-output (MU-MIMO) systems. In this paper, we propose a novel decentralized Gaussian message passing (GMP) detection for the DBP architecture. Based on the message passing rule, each antenna cluster iteratively calculated the local means and variances which are fused to generate the global symbol beliefs for demodulation. The state evolution framework of the decentralized GMP algorithm is presented under the assumptions of large-system limit and Gaussian sources. Analytical results corroborated by simulations demonstrate that the nonuniform antenna cluster partition scheme exhibits a higher convergence rate than the uniform counterpart. Simulation results illustrate that the proposed decentralized GMP detection outperforms the recently proposed decentralized algorithms.
- 8 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 21 (3) , 2006-2018
Expectation Propagation Aided Signal Detection for Uplink Massive Generalized Spatial Modulation MIMO Systems
In this paper, we propose a joint signal detection algorithm under the framework of the expectation propagation (EP) algorithm for uplink massive multiuser multiple-input multiple-output (MIMO) systems with generalized spatial modulation (GSM). By projecting the discrete probability distribution into a multivariate complex Gaussian function, the symbol beliefs of the tridimensional GSM constellation are calculated via the iterative propagation of the mean vectors and covariance matrices. To reduce the computational complexity, an efficient separate signal detection called two-stage EP (TS-EP) algorithm is designed. In the first stage, the active transmit antenna indices are determined via the EP. Each vector-valued variable node (VN) in the factor graph is decomposed into multiple sub-VNs, and the invalid sub-VNs of the determined silent transmit antennas are pruned from the factor graph. In the second stage, since the modulation symbols are independent conditioned on the active transmit antennas, the symbols are independently detected by adopting the EP with univariate complex Gaussian approximations, and the number of probability calculations for each symbol belief is significantly reduced in the subsequent EP update. Simulation results illustrate that the proposed EP and TS-EP signal detection schemes outperform the recently proposed counterparts. Moreover, the proposed TS-EP algorithm strikes a desirable and flexible performance-complexity tradeoff.
- 8 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 21 (3) , 2006-2018
Expectation Propagation Aided Signal Detection for Uplink Massive Generalized Spatial Modulation MIMO Systems
In this paper, we propose a joint signal detection algorithm under the framework of the expectation propagation (EP) algorithm for uplink massive multiuser multiple-input multiple-output (MIMO) systems with generalized spatial modulation (GSM). By projecting the discrete probability distribution into a multivariate complex Gaussian function, the symbol beliefs of the tridimensional GSM constellation are calculated via the iterative propagation of the mean vectors and covariance matrices. To reduce the computational complexity, an efficient separate signal detection called two-stage EP (TS-EP) algorithm is designed. In the first stage, the active transmit antenna indices are determined via the EP. Each vector-valued variable node (VN) in the factor graph is decomposed into multiple sub-VNs, and the invalid sub-VNs of the determined silent transmit antennas are pruned from the factor graph. In the second stage, since the modulation symbols are independent conditioned on the active transmit antennas, the symbols are independently detected by adopting the EP with univariate complex Gaussian approximations, and the number of probability calculations for each symbol belief is significantly reduced in the subsequent EP update. Simulation results illustrate that the proposed EP and TS-EP signal detection schemes outperform the recently proposed counterparts. Moreover, the proposed TS-EP algorithm strikes a desirable and flexible performance-complexity tradeoff.