List detection for multi-access channels
作者： A.B. Reid , A.J. Grant , P.D. Alexander
DOI: 10.1109/GLOCOM.2002.1188363
关键词: Communication channel 、 Code division multiple access 、 Multiuser detection 、 Time complexity 、 Discrete mathematics 、 Multi access 、 Decoding methods 、 Computer science 、 Computational complexity theory
摘要: We propose a low complexity iterative multiuser decoder. perform the a-posteriori probability calculation based on marginalization of probabilities over subset P highest probable sequences. Given K user symmetric channel this list may be approximated closely with per-bit computational O(K + 2K log K). further show that for any system possessing polynomial optimal detection algorithm it is possible to obtain sequences complexity. highly in time and hence utilize procedure decoding.
sci-hub.se 参考文章(13)
A.B. Reid, A.J. Grant, P.D. Alexander, Direct proof of polynomial complexity optimum multiuser detection algorithm Electronics Letters. ,vol. 37, pp. 1203- 1204 ,(2001) , 10.1049/EL:20010804
Eugene L. Lawler, A Procedure for Computing theKBest Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem Management Science. ,vol. 18, pp. 401- 405 ,(1972) , 10.1287/MNSC.18.7.401
Horst Hamacher, An O(K·n4) algorithm for finding the k best cuts in a network Operations Research Letters. ,vol. 1, pp. 186- 189 ,(1982) , 10.1016/0167-6377(82)90037-2
M. Oussama Damen, K. Abed-Meraim, J.-C. Belfiore, Generalised sphere decoder for asymmetrical space-time communication architecture Electronics Letters. ,vol. 36, pp. 166- 167 ,(2000) , 10.1049/EL:20000168
Paul D. Alexander, Alex J. Grant, Mark C. Reed, Iterative detection in code‐division multiple‐access with error control coding European Transactions on Telecommunications. ,vol. 9, pp. 419- 425 ,(1998) , 10.1002/ETT.4460090504
S. Ulukus, R.D. Yates, Optimum multiuser detection is tractable for synchronous CDMA systems using m-sequences IEEE Communications Letters. ,vol. 2, pp. 89- 91 ,(1998) , 10.1109/4234.664214
C. Sankaran, A. Ephremides, Solving a class of optimum multiuser detection problems with polynomial complexity IEEE Transactions on Information Theory. ,vol. 44, pp. 1958- 1961 ,(1998) , 10.1109/18.705573
E. Viterbo, J. Bouros, A universal lattice code decoder for fading channels IEEE Transactions on Information Theory. ,vol. 45, pp. 1639- 1642 ,(1999) , 10.1109/18.771234
D. Eppstein, Finding the k shortest paths foundations of computer science. pp. 154- 165 ,(1994) , 10.1109/SFCS.1994.365697
M.L. Moher, Multiuser decoding for multibeam systems IEEE Transactions on Vehicular Technology. ,vol. 49, pp. 1226- 1234 ,(2000) , 10.1109/25.875232