空分多址系統(tǒng)中的快速PDA算法
Fast PDA Multiuser-Detection Algorithm in SDMA System
-
摘要: 空分多址系統(tǒng)中(SDMA)的多用戶檢測(cè)技術(shù)(MUD)是決定系統(tǒng)性能的關(guān)鍵。由于最優(yōu)算法的不可實(shí)現(xiàn)性,尋找次最優(yōu)的簡(jiǎn)單實(shí)用的算法是人們研究的熱點(diǎn)。迭代式概率數(shù)據(jù)輔助(PDA)算法的性能接近于最優(yōu)算法,但其運(yùn)算量降低了一半。該文分析了迭代式PDA算法錯(cuò)誤判決的分布,提出了快速PDA算法,引入最大似然因子,將迭代式轉(zhuǎn)化為一次判決方式,進(jìn)一步減小了運(yùn)算量。仿真結(jié)果表明快速PDA算法與迭代式PDA算法的性能十分接近。
-
關(guān)鍵詞:
- SDMA; MUD; PDA
Abstract: Compared with optimal maximum-likelihood multiuser detection algorithm (MUD) in Space Division Multiuser Access (SDMA) system, probabilistic data association (PDA) algorithm is a near-optimal MUD with low complexity. This paper analyzes the relation between error judging and estimated likely-probability in the 1st iteration of PDA, then proposed the fast PDA which correcting the judging output in the 1st iteration of PDA with Euclidean distance factor. Fast PDA reduces complexity of PDA through eliminating its iterations. Simulation results show that BER of fast PDA is very close to PDA with iterations. -
Foschini J G, Gans M J. On limits of wireless communications in a fading environment when using multiple antennas[J].Wireless Personal Communications.1998, 6(3):311-335[2]Verdu S. Multiuser Detection. Cambridge, UK: Cambridge University Press, 1998, 第四章.[3]X. Wang, Poor H V. Iterative (Turbo) soft interference cancellation and decoding for coded CDMA. IEEE Trans. on Communications, 1999, 47(7): 1046-1061.[4]Reynolds D, X. Wang. Turbo multiuser detection with unknown interferers. IEEE Trans. on Communications, 2002, 50(4): 616-622.[5]J. Luo, Pattipati K R, Willett P K, Hasegawa F. Near-optimal multiuser detection in synchronous CDMA using probabilistic data association. Electronics Letters, 2001, 5(9): 361-363.[6]陳江.衰落信道中的空分多址系統(tǒng).[博士論文],北京:北京大學(xué)電子學(xué)系,2002-9-9. -
計(jì)量
- 文章訪問數(shù): 2280
- HTML全文瀏覽量: 119
- PDF下載量: 476
- 被引次數(shù): 0
下載:
