By Topic

Group sequence detection for the asynchronous Gaussian code-division multiple-access channel

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

The problem of coherently detecting S out of K simultaneously transmitting users of an asynchronous Gaussian CDMA channel is considered under the constraint that the signal amplitudes of the interfering users are unknown. A maximum generalized likelihood detector (MGLD) that achieves optimum values of group near-far resistance (the worst-case asymptotic efficiency over the unknown signal amplitudes) is obtained. Unfortunately, the MGLD is practically unimplementable because, for M-ary signalling, it has a time complexity per symbol (TCS) of O(MSN/SN), N being the packet length. A group sequence detector (GSD) is proposed as an alternative, and it consists of a bank of K matched filters for a front-end, followed by a cascade of a K-input S-output group decorrelating filter and a multiuser variant of the Viterbi algorithm with a TCS of O(MS/S). The high SNR performance of the GSD is characterized through its asymptotic multiuser efficiency and the conditions under which the GSD closely tracks the performance of the MGLD are discussed. When S=1, the GSD reduces to the decorrelating detector with optimum near-far resistance, and when S=K, the GSD coincides with the maximum likelihood sequence detector with optimum asymptotic efficiency. A parallel bank of GSDs can also be used, one for detecting users in each group of a partition of all users to be detected, thereby providing the designer the flexibility of trading performance for reduced implementational complexity

Published in:

Global Telecommunications Conference, 1994. Communications Theory Mini-Conference Record, 1994 IEEE GLOBECOM., IEEE

Date of Conference:

28 Nov- 2 Dec 1994