Fuzzy step size least mean square algorithm tuned linearly constrained constant modulus algorithm for multi-carrier code division multiple access blind multiuser detector

2013 ◽  
Vol 27 (12) ◽  
pp. 3640-3656 ◽  
Author(s):  
Ho-Lung Hung ◽  
Chia-Hsin Cheng
Keyword(s):  
Code Division Multiple Access ◽  
Multiple Access ◽  
Least Mean Square ◽  
Constant Modulus ◽  
Constant Modulus Algorithm ◽  
Step Size ◽  
Multiuser Detector ◽  
Linearly Constrained ◽  
Least Mean Square Algorithm ◽  
Code Division Multiple

NOVEL LOW-COMPLEXITY ANT COLONY BASED MULTIUSER DETECTOR FOR DIRECT SEQUENCE CODE DIVISION MULTIPLE ACCESS

2005 ◽  
Vol 05 (02) ◽  
pp. 201-214 ◽  
Author(s):  
SAMER L. HIJAZI ◽  
BALASUBRAMANIAM NATARAJAN
Keyword(s):  
Code Division Multiple Access ◽  
Multiple Access ◽  
Low Complexity ◽  
Foraging Strategy ◽  
Ant Colony ◽  
Direct Sequence ◽  
Multiuser Detector ◽  
Sequence Code ◽  
Cooperative Foraging ◽  
Code Division Multiple

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.

Sign in / Sign up

Export Citation Format

Share Document