Branch-and-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA
暂无分享,去创建一个
Krishna R. Pattipati | Loïc Brunel | Peter Willett | Jie Luo | P. Willett | K. Pattipati | L. Brunel | Jie Luo
[1] Christian Schlegel,et al. A simple way to compute the minimum distance in multiuser CDMA systems , 1997, IEEE Trans. Commun..
[2] Dimitri P. Bertsekas,et al. Network optimization : continuous and discrete models , 1998 .
[3] Bernard Fino,et al. Multiuser detection: , 1999, Ann. des Télécommunications.
[4] Mahesh K. Varanasi,et al. Decision Feedback Multiuser Detection: A Systematic Approach , 1999, IEEE Trans. Inf. Theory.
[5] Krishna R. Pattipati,et al. Fast optimal and suboptimal any-time algorithms for CWMA multiuser detection , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
[6] Babak Hassibi,et al. On the expected complexity of integer least-squares problems , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[7] Loïc Brunel,et al. Lattice decoding for joint detection in direct-sequence CDMA systems , 2003, IEEE Trans. Inf. Theory.
[8] Krishna R. Pattipati,et al. Optimal grouping algorithm for a group decision feedback detector in synchronous CDMA communications , 2003, IEEE Trans. Commun..
[9] Krishna R. Pattipati,et al. Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound , 2004, IEEE Transactions on Communications.