List detection for multi-access channels

Conference Record / IEEE Global Telecommunications Conference

Volumn 2, Issue , 2002, Pages 1083-1087

  Reid, Aaron B ^a   Grant, Alex J ^a   Alexander, Paul D ^b  

^a UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

^b Southern Poro Communications   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CODE DIVISION MULTIPLE ACCESS; COMPUTATIONAL COMPLEXITY; DECODING; PROBABILITY;

MILTI-ACCESS CHANNELS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0036966508     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. P. D. Alexander, A. J. Grant, and M. C. Reed, "Iterative detection in Code-Division Multiple-Access with error control coding," European Trans. Telecomm., vol. 9, no. 5, pp. 419-425, Sep./Oct. 1998.
2. M. C. Reed, C. B. Schlegel, P. D. Alexander, and J. A. Asenstorfer, " IEEE Trans. Inform. Theory, vol. 46, no. 12, pp. 1693-1699, Dec. 1998.
3. H. El Gamal and E. Geraniotis, "Iterative multiuser detection for coded CDMA signals in AWGN and fading channels," IEEE Sel. Areas in Comm., vol. 18, no. 1, pp. 30-41, Jan. 2000.
4. D. Eppstein, "Finding the k shortest paths," Tech. Rep., Dep. of Info. and Comp. Sci., University of California, 1994.
5. S. Verdú, Multiuser Detection, Cambridge University Press, 1998.
6. M. Moher, "Multiuser decoding for multibeam systems," IEEE Trans. Veh. Technol., vol. 49, no. 4, pp. 1226-1234, July 2000.
7. C. Schlegel and A. J. Grant, "Polynomial complexity optimal detection of certain multiple access systems," IEEE Trans. Inform. Theory, vol. 46, no. 6, pp. 2246-2248, Sep. 2000.
8. A. B. Reid, A. J. Grant, and P. D. Alexander, "Direct proof of a polynomial complexity optimum detection algorithm," IEE Electron. Lett., vol. 37, no. 19, pp. 1203-1205, Sep. 2001.
9. E. L. Lawler, "A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem," Management Science, vol. 18, no. 7, pp. 401-405, Mar. 1972.
10. S. Ulukus and R. Yates, "Optimum multiuser detection is tractable for synchronous CDMA systems using m-sequences," IEEE Comm. Lett., vol. 2, no. 4, pp. 89-91, Apr. 1998.
11. C. Sankaran and A. Ephremides, "Solving a class of optimum multiuser detection problems with polynomial complexity," IEEE Trans. Inform. Theory, vol. 44, no. 5, pp. 1958-1961, Sep. 1998.
12. 4) algorithm for finding the K best cuts in a network," Operations Research Letters, vol. 1, no. 5, pp. 186-189, Nov. 1982.
13. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inform. Theory, vol. 45, no. 5, pp. 1639-1642, Jul. 1999.
14. M. O. Damen, K. Abed-Meraim, and J. C. Belfiore, "A generalized sphere decoder for asymmetrical space-time communication architecture," IEEE Electron. Lett., vol. 36, no. 2, pp. 166, Jan. 2000.
15. C. Schlegel, Trellis Coding, IEEE Press, 1997.