Cart (Loading....) | Create Account
Close category search window
 

MC CDMA multiuser detection using random set theory and multi-value particle swarm optimization algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhao Zhijin ; Telecommun. Sch. Telecommun. Sch., Hangzhou Dianzi Univ., Hangzhou ; Wang Baichuan

In real uplink multicarrier CDMA (MC CDMA) communication system, the asynchrony of active userspsila signature is a key factor of multiple access interference(MAI). Considering users access randomly, not only the location of active users, but also their number varies with time. In typical analysis, multi-user detection theory for MC CDMA has been developed under the assumption that the number of active users is constant and known at the receiver, and coincides with the maximum number of users entitled to access the system. Since many users might be inactive at any given time, detection under the assumption of the number of users larger than the real one may impair performance. The main goal of this paper is to introduce a general approach to the problem of identifying active users and estimating their data in a MC CDMA random-access system where users are continuously and independently entering and leaving the system. The tool we advocate is random-set theory (RST) and we propose a new particle swarm optimization (PSO) algorithm for discrete multi-values with the similar properties of BPSO to reduce the computation, the simulation result prove the efficiency of the new algorithm.

Published in:

Communication Technology, 2008. ICCT 2008. 11th IEEE International Conference on

Date of Conference:

10-12 Nov. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.