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

Parallel group detection for synchronous CDMA communication over frequency-selective Rayleigh fading channels

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

1 Author(s)
Varanasi, M.K. ; Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO, USA

A group detector jointly detects a group of users, and a parallel group detection scheme is a bank of J independently operating group detectors, one for each group of a J group partition of the K transmitting users of a code-division multiple-access (CDMA) channel. In this paper, two group detectors are introduced for the frequency-selective Rayleigh fading (FSRF) CDMA channel. While the optimum multiuser detector has a time complexity per symbol (TCS) of O(M K/K) for M-ary signaling, each of the two group detectors has a TCS of O(M(|G|)/|G|) where |G| is the group size. Hence, there are parallel group detection schemes, based on each of the two group detectors, that satisfy a wide range of complexity constraints that result from the choice of partition. Each of the two group detectors is minimax optimal in the corresponding conditional group near-far resistance measure. Furthermore, a succinct indicator of the average BER over high SNR regions is defined via the asymptotic efficiency. A lower bound and an exact formula for the asymptotic efficiency are derived for the first and second group detectors, respectively. The group detection approach for the FSRF-CDMA channel generalizes previous approaches to the complexity-performance tradeoff problem. It yields the optimum detector when the group size is K. When the group size is equal to one, the first group detector results in a new optimum linear detector and the second reduces to a recently proposed suboptimum linear detector. All other nontrivial partitions yield new multiuser detectors whose performances are commensurate with their complexities

Published in:

Information Theory, IEEE Transactions on  (Volume:42 ,  Issue: 1 )

Date of Publication:

Jan 1996

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.