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

List detection for the K-symmetric 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

3 Author(s)
Reid, A.B. ; Centre for Telecommun. & Micro-Electron., Victoria Univ., Melbourne, Vic., Australia ; Grant, A.J. ; Alexander, P.D.

A K-symmetric channel is a K-user linear multiple-access channel in which the cross correlations between each pair of users are identical. The main contribution of this correspondence is an algorithm which finds the P sequences with highest a posteriori probability (APP) in the case of binary transmission over a K-symmetric channel with additive white Gaussian noise. This list detector is applied to the problem of iterative multiple-user decoding, approximating the APP computation by marginalization over these P sequences, rather than all possible 2K sequences. Simulation results indicate that using only small values of P, very good performance may be obtained. It is also demonstrated how to incorporate prior probabilities (a requirement for iterative decoding). The overall per-bit computational complexity of the approach is O(K2+PlogP). It is also shown that for any multiuser system possessing a polynomial complexity optimal detection algorithm it is possible to obtain the P most probable sequences with polynomial complexity.

Published in:

Information Theory, IEEE Transactions on  (Volume:51 ,  Issue: 8 )

Date of Publication:

Aug. 2005

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.