Adaptive multiuser detector for synchronous code division multiple access applications

Author(s):  
Zoran Siveski ◽  
Yeheskel Bar-Ness ◽  
David W. Chen
Author(s):  
SAMER L. HIJAZI ◽  
BALASUBRAMANIAM NATARAJAN

In this paper, we present a novel multiuser detection (MUD) technique based on ant colony optimisation (ACO), for synchronous direct sequence code division multiple access systems. ACO algorithms are based on the cooperative foraging strategy of real ants. While an optimal MUD design using an exhaustive search method is prohibitively complex, we show that the ACO-based MUD converges to the optimal bit-error-rate performance in relatively few iterations providing 95% savings in computational complexity. This reduction in complexity is retained even when considering users with unequal received powers.


2021 ◽  
pp. 76-81
Author(s):  
Xingming Li ◽  
◽  
Zhiliang Qin ◽  
Yuanhao Sun ◽  
Qidong Lu ◽  
...  

In this paper, we propose a low-complexity soft-input/soft-output (SISO) Chase multiuser detector that has a polynomial computational complexity in terms of the number of the least reliable bit positions for low-density parity-check (LDPC) coded code-division multiple-access (CDMA) systems, which is a potentially competitive technology for underwater acoustic networks (UWAN). Simulation results over highly correlated channels show that the proposed detector can afford searching over a larger number of the least reliable bit positions and achieve better bit-error-rate (BER) performance as compared with the Chase-II detector at much lower complexity.


Sign in / Sign up

Export Citation Format

Share Document