By Topic

A fast method of examining the feasibility of the successive interference cancellation algorithm in a DS-CDMA system

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

4 Author(s)
Zhaorong Zhou ; Sch. of Commun. & Inf. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu ; Yide Zhang ; Gang Feng ; Lemin Li

On the uplink of a DS-CDMA system with the imperfect successive interference cancellation (SIC) technique, K active users correspond to K! decoding orders. Due to the constraint of the received power, not all the possible decoding orders may be feasible, rendering the failure of SIC algorithm. Meanwhile, examining the feasibility of the system among all these decoding orders directly by the exhaustive search method (ESM) is prohibitively time-consuming. In this paper, we investigate the fast method of examining the feasibility of the SIC algorithm in a DS-CDMA system. The computational complexity involved in examining the feasibility of the SIC algorithm by the proposed method is significantly less than that of ESM. Subsequently, the greatly reduced examining time will be beneficial to the quick decision of admission control or scheduling schemes. Extensive numerical results valid our analysis.

Published in:

Communications, Circuits and Systems, 2008. ICCCAS 2008. International Conference on

Date of Conference:

25-27 May 2008