Sphere decoding-based iterative MAP receiver for spatial multiplexing systems

Seung Young Park, Soo K. Choi, Chung Gu Kang, Ki H. Kim

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

2 Citations (Scopus)

Abstract

In this paper, we present a complexity-reduced iterative algorithm for joint maximum a posteriori (MAP) detection and channel estimation in spatial multiplexing systems. To reduce the complexity associated with the MAP detection, which increases exponentially as the number of transmit antennas and the modulation order increase, we propose a modified sphere decoder (SD) algorithm for the MAP detection. It enumerates the symbol sequences with the high extrinsic probabilities, which fall inside a sphere centered at the received signal point at the same time. Extensive simulations demonstrate that the proposed scheme dramatically reduces the complexity as compared to that of the original SD algorithm with moderate performance degradation. Since a degree of the complexity reduction depends on the sphere radius, we also discuss a suitable distance to warrant the good performance/complexity tradeoffs.

Original languageEnglish
Title of host publicationIEEE Vehicular Technology Conference
Pages2324-2328
Number of pages5
Volume57
Edition4
Publication statusPublished - 2003
Event57th IEEE Semiannual Vehicular Technology Conference (VTC2003) - Jeju, Korea, Republic of
Duration: 2003 Apr 222003 Apr 25

Other

Other57th IEEE Semiannual Vehicular Technology Conference (VTC2003)
CountryKorea, Republic of
CityJeju
Period03/4/2203/4/25

Fingerprint

Multiplexing
Decoding
Channel estimation
Modulation
Antennas
Degradation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Park, S. Y., Choi, S. K., Kang, C. G., & Kim, K. H. (2003). Sphere decoding-based iterative MAP receiver for spatial multiplexing systems. In IEEE Vehicular Technology Conference (4 ed., Vol. 57, pp. 2324-2328)

Sphere decoding-based iterative MAP receiver for spatial multiplexing systems. / Park, Seung Young; Choi, Soo K.; Kang, Chung Gu; Kim, Ki H.

IEEE Vehicular Technology Conference. Vol. 57 4. ed. 2003. p. 2324-2328.

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

Park, SY, Choi, SK, Kang, CG & Kim, KH 2003, Sphere decoding-based iterative MAP receiver for spatial multiplexing systems. in IEEE Vehicular Technology Conference. 4 edn, vol. 57, pp. 2324-2328, 57th IEEE Semiannual Vehicular Technology Conference (VTC2003), Jeju, Korea, Republic of, 03/4/22.
Park SY, Choi SK, Kang CG, Kim KH. Sphere decoding-based iterative MAP receiver for spatial multiplexing systems. In IEEE Vehicular Technology Conference. 4 ed. Vol. 57. 2003. p. 2324-2328
Park, Seung Young ; Choi, Soo K. ; Kang, Chung Gu ; Kim, Ki H. / Sphere decoding-based iterative MAP receiver for spatial multiplexing systems. IEEE Vehicular Technology Conference. Vol. 57 4. ed. 2003. pp. 2324-2328
@inproceedings{b2a951d1cd934ceb921aba8f7638d952,
title = "Sphere decoding-based iterative MAP receiver for spatial multiplexing systems",
abstract = "In this paper, we present a complexity-reduced iterative algorithm for joint maximum a posteriori (MAP) detection and channel estimation in spatial multiplexing systems. To reduce the complexity associated with the MAP detection, which increases exponentially as the number of transmit antennas and the modulation order increase, we propose a modified sphere decoder (SD) algorithm for the MAP detection. It enumerates the symbol sequences with the high extrinsic probabilities, which fall inside a sphere centered at the received signal point at the same time. Extensive simulations demonstrate that the proposed scheme dramatically reduces the complexity as compared to that of the original SD algorithm with moderate performance degradation. Since a degree of the complexity reduction depends on the sphere radius, we also discuss a suitable distance to warrant the good performance/complexity tradeoffs.",
author = "Park, {Seung Young} and Choi, {Soo K.} and Kang, {Chung Gu} and Kim, {Ki H.}",
year = "2003",
language = "English",
volume = "57",
pages = "2324--2328",
booktitle = "IEEE Vehicular Technology Conference",
edition = "4",

}

TY - GEN

T1 - Sphere decoding-based iterative MAP receiver for spatial multiplexing systems

AU - Park, Seung Young

AU - Choi, Soo K.

AU - Kang, Chung Gu

AU - Kim, Ki H.

PY - 2003

Y1 - 2003

N2 - In this paper, we present a complexity-reduced iterative algorithm for joint maximum a posteriori (MAP) detection and channel estimation in spatial multiplexing systems. To reduce the complexity associated with the MAP detection, which increases exponentially as the number of transmit antennas and the modulation order increase, we propose a modified sphere decoder (SD) algorithm for the MAP detection. It enumerates the symbol sequences with the high extrinsic probabilities, which fall inside a sphere centered at the received signal point at the same time. Extensive simulations demonstrate that the proposed scheme dramatically reduces the complexity as compared to that of the original SD algorithm with moderate performance degradation. Since a degree of the complexity reduction depends on the sphere radius, we also discuss a suitable distance to warrant the good performance/complexity tradeoffs.

AB - In this paper, we present a complexity-reduced iterative algorithm for joint maximum a posteriori (MAP) detection and channel estimation in spatial multiplexing systems. To reduce the complexity associated with the MAP detection, which increases exponentially as the number of transmit antennas and the modulation order increase, we propose a modified sphere decoder (SD) algorithm for the MAP detection. It enumerates the symbol sequences with the high extrinsic probabilities, which fall inside a sphere centered at the received signal point at the same time. Extensive simulations demonstrate that the proposed scheme dramatically reduces the complexity as compared to that of the original SD algorithm with moderate performance degradation. Since a degree of the complexity reduction depends on the sphere radius, we also discuss a suitable distance to warrant the good performance/complexity tradeoffs.

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

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

M3 - Conference contribution

AN - SCOPUS:0041968624

VL - 57

SP - 2324

EP - 2328

BT - IEEE Vehicular Technology Conference

ER -