Polynomial complexity optimal multiuser detection for wider class of problems
暂无分享,去创建一个
Optimal multiuser detection for code division multiple access has complexity which grows exponentially with the number of users. Recently proposed algorithms enable polynomial complexity optimal detection for certain special spreading sequences. It is shown that these algorithms are applicable to a wider class of spreading sequences than initially proposed.
[1] Alex J. Grant,et al. Polynomial complexity optimal detection of certain multiple-access systems , 2000, IEEE Trans. Inf. Theory.
[2] Roy D. Yates,et al. Optimum multiuser detection is tractable for synchronous CDMA systems using m-sequences , 1998, IEEE Communications Letters.
[3] Sergio Verdu,et al. Multiuser Detection , 1998 .
[4] Anthony Ephremides,et al. Solving a Class of Optimum Multiuser Detection Problems with Polynomial Complexity , 1998, IEEE Trans. Inf. Theory.