Reduced-complexity maximum a posteriori probability (MAP) signal detection is a promising technique for multiple-input multiple-output space division multiplexing (MIMO-SDM) transmission. These detectors avoid exhaustive searches for all possible transmitted symbol vectors by generating a set of candidate symbol vectors. One problem with the reduced-complexity MAP detectors when used in conjunction with soft input decoders is the inaccuracy of log likelihood ratio (LLR) values since they are computed from a handful of candidate symbol vectors, which degrades the subsequent decoding process. To rectify this weakness, this paper proposes an LLR computation scheme for reduced complexity MAP detectors. The unique feature of the proposed scheme is that it utilizes the statistical property of the MIMO channel metric to narrow down further the number of candidate symbol vectors. Toward this goal, metric selection is performed to select only a statistically "good" portion of the candidate symbol vectors. Computer simulation results show that the proposed LLR computation scheme is more effective than the existing schemes especially when the number of candidate symbol vectors becomes smaller in reduced-complexity MAP detection.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Tetsushi ABE, Hitoshi YOSHINO, "Metric Selection for Reduced-Complexity MAP Detectors in MIMO Systems" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 9, pp. 2555-2563, September 2006, doi: 10.1093/ietcom/e89-b.9.2555.
Abstract: Reduced-complexity maximum a posteriori probability (MAP) signal detection is a promising technique for multiple-input multiple-output space division multiplexing (MIMO-SDM) transmission. These detectors avoid exhaustive searches for all possible transmitted symbol vectors by generating a set of candidate symbol vectors. One problem with the reduced-complexity MAP detectors when used in conjunction with soft input decoders is the inaccuracy of log likelihood ratio (LLR) values since they are computed from a handful of candidate symbol vectors, which degrades the subsequent decoding process. To rectify this weakness, this paper proposes an LLR computation scheme for reduced complexity MAP detectors. The unique feature of the proposed scheme is that it utilizes the statistical property of the MIMO channel metric to narrow down further the number of candidate symbol vectors. Toward this goal, metric selection is performed to select only a statistically "good" portion of the candidate symbol vectors. Computer simulation results show that the proposed LLR computation scheme is more effective than the existing schemes especially when the number of candidate symbol vectors becomes smaller in reduced-complexity MAP detection.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.9.2555/_p
Copy
@ARTICLE{e89-b_9_2555,
author={Tetsushi ABE, Hitoshi YOSHINO, },
journal={IEICE TRANSACTIONS on Communications},
title={Metric Selection for Reduced-Complexity MAP Detectors in MIMO Systems},
year={2006},
volume={E89-B},
number={9},
pages={2555-2563},
abstract={Reduced-complexity maximum a posteriori probability (MAP) signal detection is a promising technique for multiple-input multiple-output space division multiplexing (MIMO-SDM) transmission. These detectors avoid exhaustive searches for all possible transmitted symbol vectors by generating a set of candidate symbol vectors. One problem with the reduced-complexity MAP detectors when used in conjunction with soft input decoders is the inaccuracy of log likelihood ratio (LLR) values since they are computed from a handful of candidate symbol vectors, which degrades the subsequent decoding process. To rectify this weakness, this paper proposes an LLR computation scheme for reduced complexity MAP detectors. The unique feature of the proposed scheme is that it utilizes the statistical property of the MIMO channel metric to narrow down further the number of candidate symbol vectors. Toward this goal, metric selection is performed to select only a statistically "good" portion of the candidate symbol vectors. Computer simulation results show that the proposed LLR computation scheme is more effective than the existing schemes especially when the number of candidate symbol vectors becomes smaller in reduced-complexity MAP detection.},
keywords={},
doi={10.1093/ietcom/e89-b.9.2555},
ISSN={1745-1345},
month={September},}
Copy
TY - JOUR
TI - Metric Selection for Reduced-Complexity MAP Detectors in MIMO Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 2555
EP - 2563
AU - Tetsushi ABE
AU - Hitoshi YOSHINO
PY - 2006
DO - 10.1093/ietcom/e89-b.9.2555
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2006
AB - Reduced-complexity maximum a posteriori probability (MAP) signal detection is a promising technique for multiple-input multiple-output space division multiplexing (MIMO-SDM) transmission. These detectors avoid exhaustive searches for all possible transmitted symbol vectors by generating a set of candidate symbol vectors. One problem with the reduced-complexity MAP detectors when used in conjunction with soft input decoders is the inaccuracy of log likelihood ratio (LLR) values since they are computed from a handful of candidate symbol vectors, which degrades the subsequent decoding process. To rectify this weakness, this paper proposes an LLR computation scheme for reduced complexity MAP detectors. The unique feature of the proposed scheme is that it utilizes the statistical property of the MIMO channel metric to narrow down further the number of candidate symbol vectors. Toward this goal, metric selection is performed to select only a statistically "good" portion of the candidate symbol vectors. Computer simulation results show that the proposed LLR computation scheme is more effective than the existing schemes especially when the number of candidate symbol vectors becomes smaller in reduced-complexity MAP detection.
ER -