Quasi-large sparse-sequence CDMA: Approach to single-user bound by linearly-complex LAS detectors
暂无分享,去创建一个
[1] Toshiyuki Tanaka,et al. Analysis of Sparsely-Spread CDMA via Statistical Mechanics , 2006, 2006 IEEE International Symposium on Information Theory.
[2] Bernard Fino,et al. Multiuser detection: , 1999, Ann. des Télécommunications.
[3] Yi Sun. A family of likelihood ascent search multiuser detectors: an upper bound of bit error rate and a lower bound of asymptotic multiuser efficiency , 2009, IEEE Transactions on Communications.
[4] Yi Sun,et al. Local Maximum Likelihood Multiuser Detection , 2003 .
[5] Yi Sun. Approach to Optimum Performance in Random Spreading CDMA by Linear-Complex LAS Detectors , 2007, 2007 41st Annual Conference on Information Sciences and Systems.
[6] Toshiyuki Tanaka,et al. A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors , 2002, IEEE Trans. Inf. Theory.
[7] Sergio Verdú,et al. Optimum asymptotic multiuser efficiency of randomly spread CDMA , 2000, IEEE Trans. Inf. Theory.
[8] S. Verdú,et al. Multiuser Detection and Statistical Mechanics , 2003 .
[9] Yi Sun. A Family of Likelihood Ascent Search Multiuser Detectors: Approach to Single-User Performance via Quasi-Large Random Sequence CDMA , 2007, ArXiv.
[10] Andrea Montanari,et al. Analysis of Belief Propagation for Non-Linear Problems: The Example of CDMA (or: How to Prove Tanaka's Formula) , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.
[11] Chih-Chun Wang,et al. Multiuser Detection of Sparsely Spread CDMA , 2008, IEEE Journal on Selected Areas in Communications.