From nominal to true a posteriori probabilities: an exact Bayesian theorem based probabilistic data association approach for iterative MIMO detection and decoding

摘要

It was conventionally regarded that the existing probabilistic data association (PDA) algorithms output the estimated symbol-wise a posteriori probabilities (APPs) as soft information. In this paper, however, we demonstrate that these probabilities are not the true APPs in the rigorous mathematicasense, but a type of nominal APPs, which are unsuitable for the classic architecture of iterative detection and decoding (IDD) aided receivers. To circumvent this predicament, we propose an exact Bayesian theorem based logarithmic domain PDA (EB-Log-PDA) method, whose output has similar characteristics to the true APPs, and hence it is readily applicable to the classic IDD architecture of multiple-input multiple-output (MIMO) systems using the general M-ary modulation. Furthermore, we investigate the impact of the PDA algorithms' inner iteration on the design of PDA-aided IDD receivers. We demonstrate that introducing inner iterations into PDAs, which is common practice in PDA-aided uncoded MIMO systems, would actually degrade the IDD receiver's performance, despite significantly increasing the overall computational complexity of the IDD receiver. Finally, we investigate the relationship between the extrinsic log-likelihood ratio (LLRs) of the proposed EB-Log-PDA and of the approximate Bayesian theorem based logarithmic domain PDA (AB-Log-PDA) reported in our previous work. We also show that the IDD scheme employing the EB-Log-PDA without incorporating any inner PDA iterations has an achievable performance close to that of the optimal maximum a posteriori (MAP) detector based IDD receiver, while imposing a significantly lower computational complexity in the scenarios considered.