Complexity-reduced iterative MAP receiver for spatial multiplexing systems

S. Y. Park, S. K. Choi, Chung Gu Kang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

A complexity-reduced iterative algorithm for joint maximum a posteriori (MAP) detection and channel estimation for spatial multiplexing systems is presented. To reduce the complexity of the MAP detection, which increases exponentially with the number of transmit antennas and the modulation order, a modified sphere decoding (SD) algorithm is proposed. It just enumerates the symbol sequences with high a priori probabilities, which fall inside a sphere centred at the received signal point. Extensive simulations demonstrate that the proposed algorithm, combined with convolutional code, reduces the complexity as compared to that of the MAP detection with moderate performance degradation. The effects of design parameters, e.g. sphere radius and the number of symbol sequences with high a priori probabilities, on the performance/ complexity trade-offs are also discussed.

Original languageEnglish
Title of host publicationIEE Proceedings: Communications
Pages432-438
Number of pages7
Volume152
Edition4
DOIs
Publication statusPublished - 2005 Aug

Fingerprint

Multiplexing
Convolutional codes
Channel estimation
Decoding
Modulation
Antennas
Degradation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Park, S. Y., Choi, S. K., & Kang, C. G. (2005). Complexity-reduced iterative MAP receiver for spatial multiplexing systems. In IEE Proceedings: Communications (4 ed., Vol. 152, pp. 432-438) https://doi.org/10.1049/ip-com:20041140

Complexity-reduced iterative MAP receiver for spatial multiplexing systems. / Park, S. Y.; Choi, S. K.; Kang, Chung Gu.

IEE Proceedings: Communications. Vol. 152 4. ed. 2005. p. 432-438.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Park, SY, Choi, SK & Kang, CG 2005, Complexity-reduced iterative MAP receiver for spatial multiplexing systems. in IEE Proceedings: Communications. 4 edn, vol. 152, pp. 432-438. https://doi.org/10.1049/ip-com:20041140
Park SY, Choi SK, Kang CG. Complexity-reduced iterative MAP receiver for spatial multiplexing systems. In IEE Proceedings: Communications. 4 ed. Vol. 152. 2005. p. 432-438 https://doi.org/10.1049/ip-com:20041140
Park, S. Y. ; Choi, S. K. ; Kang, Chung Gu. / Complexity-reduced iterative MAP receiver for spatial multiplexing systems. IEE Proceedings: Communications. Vol. 152 4. ed. 2005. pp. 432-438
@inproceedings{1aac1439bd354ee2a3942b4af9c7a657,
title = "Complexity-reduced iterative MAP receiver for spatial multiplexing systems",
abstract = "A complexity-reduced iterative algorithm for joint maximum a posteriori (MAP) detection and channel estimation for spatial multiplexing systems is presented. To reduce the complexity of the MAP detection, which increases exponentially with the number of transmit antennas and the modulation order, a modified sphere decoding (SD) algorithm is proposed. It just enumerates the symbol sequences with high a priori probabilities, which fall inside a sphere centred at the received signal point. Extensive simulations demonstrate that the proposed algorithm, combined with convolutional code, reduces the complexity as compared to that of the MAP detection with moderate performance degradation. The effects of design parameters, e.g. sphere radius and the number of symbol sequences with high a priori probabilities, on the performance/ complexity trade-offs are also discussed.",
author = "Park, {S. Y.} and Choi, {S. K.} and Kang, {Chung Gu}",
year = "2005",
month = "8",
doi = "10.1049/ip-com:20041140",
language = "English",
volume = "152",
pages = "432--438",
booktitle = "IEE Proceedings: Communications",
edition = "4",

}

TY - GEN

T1 - Complexity-reduced iterative MAP receiver for spatial multiplexing systems

AU - Park, S. Y.

AU - Choi, S. K.

AU - Kang, Chung Gu

PY - 2005/8

Y1 - 2005/8

N2 - A complexity-reduced iterative algorithm for joint maximum a posteriori (MAP) detection and channel estimation for spatial multiplexing systems is presented. To reduce the complexity of the MAP detection, which increases exponentially with the number of transmit antennas and the modulation order, a modified sphere decoding (SD) algorithm is proposed. It just enumerates the symbol sequences with high a priori probabilities, which fall inside a sphere centred at the received signal point. Extensive simulations demonstrate that the proposed algorithm, combined with convolutional code, reduces the complexity as compared to that of the MAP detection with moderate performance degradation. The effects of design parameters, e.g. sphere radius and the number of symbol sequences with high a priori probabilities, on the performance/ complexity trade-offs are also discussed.

AB - A complexity-reduced iterative algorithm for joint maximum a posteriori (MAP) detection and channel estimation for spatial multiplexing systems is presented. To reduce the complexity of the MAP detection, which increases exponentially with the number of transmit antennas and the modulation order, a modified sphere decoding (SD) algorithm is proposed. It just enumerates the symbol sequences with high a priori probabilities, which fall inside a sphere centred at the received signal point. Extensive simulations demonstrate that the proposed algorithm, combined with convolutional code, reduces the complexity as compared to that of the MAP detection with moderate performance degradation. The effects of design parameters, e.g. sphere radius and the number of symbol sequences with high a priori probabilities, on the performance/ complexity trade-offs are also discussed.

UR - http://www.scopus.com/inward/record.url?scp=24144487696&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24144487696&partnerID=8YFLogxK

U2 - 10.1049/ip-com:20041140

DO - 10.1049/ip-com:20041140

M3 - Conference contribution

VL - 152

SP - 432

EP - 438

BT - IEE Proceedings: Communications

ER -