Fast PDA Multiuser-Detection Algorithm in SDMA System
空分多址系统中的快速PDA算法

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.