一種新的CMA盲多用戶檢測(cè)算法
A new CMA-based blind adaptive multiuser detection
-
摘要: 該文提出了一種新的盲自適應(yīng)多用戶檢測(cè)算法,這種算法的計(jì)算復(fù)雜度為O(NL),其中N為擴(kuò)頻因子,L為取樣數(shù)據(jù)窗長(zhǎng)度。仿真分析表明,該文提出的算法穩(wěn)態(tài)性能好,收斂速度特別快,且能適應(yīng)環(huán)境的變化,是一種較好的多用戶檢測(cè)算法。
-
關(guān)鍵詞:
- 碼分多址; 多用戶檢測(cè); 恒模算法; 盲自適應(yīng)
Abstract: In this paper, a novel blind adaptive multiuser detection is proposed, the computing complex of this algorithm is O(NL), where N is the spread grain, and L is the window length. The simulation shows that this algorithm has good steady state performance and it converges very fast, and can be used when the environment varies, so it is a very good multiuser detection. -
S. Verdu, Multiuser Detection, Cambridge Univer, Press, 1998, Ch. 5-7.[2]U. Madhow, Blind adaptive interference suppresion for direct-sequence CDMA, IEEE Proc, 1995,41(4), 944-960.M. Honig, U. Madhow, S. Verdu, Blind adaptive multiuser detection, IEEE Trans. on IT, 1995,41(4), 944-960.[3]X. Wang, H. V. Poor, Blind multiuser detection: A subspace approach, IEEE Trans. on IT, 1998,44(2), 677-690.[4]M.L. Honig, Orthogonally anchored blind interference suppression using the sato cost criterion,Proc. of 1995 IEEE International Symposium on Information Theory, Chicago, 1995, 314-318. -
計(jì)量
- 文章訪問數(shù): 1934
- HTML全文瀏覽量: 134
- PDF下載量: 754
- 被引次數(shù): 0
下載:
