Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
The hardness of approximate optima in lattices, codes, and systems of linear equations
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Error Control Coding, Second Edition
Error Control Coding, Second Edition
The soft-output m-algorithm and its applications
The soft-output m-algorithm and its applications
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Turbo decoding as an instance of Pearl's “belief propagation” algorithm
IEEE Journal on Selected Areas in Communications
Soft-output sphere decoding: algorithms and VLSI implementation
IEEE Journal on Selected Areas in Communications
Reliability-based hybrid MMSE/subspace-max-log-APP MIMO detector
IEEE Communications Letters
Hi-index | 0.00 |
In classical non-iterative MIMO detection a soft-output MIMO detector computes likelihoods of the transmit bits being 1 or 0, given the received symbol vector. In iterative MIMO detection-decoding, detection performance is improved by exploiting apriori information about bit probabilities from the decoder. Transmit bits are viewed as random variables and the optimum detector performs Bayesian updating of transmit bit probabilities to compute the aposteriori probabilities (APP). We show that with growing apriori knowledge APP and max-log-APP MIMO detector performance increases up to the performance of maximum ratio combining (MRC) for SIMO transmission of BPSK modulation, when transmitting with the same energy per symbol. This is an upper bound for detector performance in iterative detection-decoding (Turbo MIMO receiver).