Complexity-reduced iterative MAP receiver with partial sphere decoding in spatial multiplexing system

Hyung Ho Park, Tae Young Min, Dong S. Kwon, Chung Gu Kang

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

Abstract

In this paper, a partial sphere decoding approach is proposed to reduce the computational complexity of implementing the iterative MAP receiver for spatial multiplexing system, in which the complexity prohibitively increases with the number of transmit antennas and modulation order. The proposed approach considers only a subset of symbols with high a priori probabilities, i.e., more reliable ones, which allows for reducing the dimension of detection space. We design a novel reliability estimator which is used for dividing two subvectors according to reliability of individual symbol in the initial stage. Furthermore, a cost function-based partial MAP rule is applied to those subvectors so as to correct the initial estimation error in the course of iterative detection and decoding process. We have shown that the overall complexity of sphere decoding can be reduced by almost order of 2 in terms of floating point operations while maintaining the BER performance as close as 0.7dB to the conventional approach.

Original languageEnglish
Title of host publicationIEEE Vehicular Technology Conference
Pages2023-2027
Number of pages5
DOIs
Publication statusPublished - 2006 Dec 1
Event2006 IEEE 64th Vehicular Technology Conference, VTC-2006 Fall - Montreal, QC, Canada
Duration: 2006 Sep 252006 Sep 28

Other

Other2006 IEEE 64th Vehicular Technology Conference, VTC-2006 Fall
CountryCanada
CityMontreal, QC
Period06/9/2506/9/28

Fingerprint

Multiplexing
Decoding
Set theory
Cost functions
Error analysis
Computational complexity
Modulation
Antennas

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Park, H. H., Min, T. Y., Kwon, D. S., & Kang, C. G. (2006). Complexity-reduced iterative MAP receiver with partial sphere decoding in spatial multiplexing system. In IEEE Vehicular Technology Conference (pp. 2023-2027). [4109685] https://doi.org/10.1109/VTCF.2006.420

Complexity-reduced iterative MAP receiver with partial sphere decoding in spatial multiplexing system. / Park, Hyung Ho; Min, Tae Young; Kwon, Dong S.; Kang, Chung Gu.

IEEE Vehicular Technology Conference. 2006. p. 2023-2027 4109685.

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

Park, HH, Min, TY, Kwon, DS & Kang, CG 2006, Complexity-reduced iterative MAP receiver with partial sphere decoding in spatial multiplexing system. in IEEE Vehicular Technology Conference., 4109685, pp. 2023-2027, 2006 IEEE 64th Vehicular Technology Conference, VTC-2006 Fall, Montreal, QC, Canada, 06/9/25. https://doi.org/10.1109/VTCF.2006.420
Park, Hyung Ho ; Min, Tae Young ; Kwon, Dong S. ; Kang, Chung Gu. / Complexity-reduced iterative MAP receiver with partial sphere decoding in spatial multiplexing system. IEEE Vehicular Technology Conference. 2006. pp. 2023-2027
@inproceedings{65709b41a94348328fd510995b031320,
title = "Complexity-reduced iterative MAP receiver with partial sphere decoding in spatial multiplexing system",
abstract = "In this paper, a partial sphere decoding approach is proposed to reduce the computational complexity of implementing the iterative MAP receiver for spatial multiplexing system, in which the complexity prohibitively increases with the number of transmit antennas and modulation order. The proposed approach considers only a subset of symbols with high a priori probabilities, i.e., more reliable ones, which allows for reducing the dimension of detection space. We design a novel reliability estimator which is used for dividing two subvectors according to reliability of individual symbol in the initial stage. Furthermore, a cost function-based partial MAP rule is applied to those subvectors so as to correct the initial estimation error in the course of iterative detection and decoding process. We have shown that the overall complexity of sphere decoding can be reduced by almost order of 2 in terms of floating point operations while maintaining the BER performance as close as 0.7dB to the conventional approach.",
author = "Park, {Hyung Ho} and Min, {Tae Young} and Kwon, {Dong S.} and Kang, {Chung Gu}",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/VTCF.2006.420",
language = "English",
isbn = "1424400635",
pages = "2023--2027",
booktitle = "IEEE Vehicular Technology Conference",

}

TY - GEN

T1 - Complexity-reduced iterative MAP receiver with partial sphere decoding in spatial multiplexing system

AU - Park, Hyung Ho

AU - Min, Tae Young

AU - Kwon, Dong S.

AU - Kang, Chung Gu

PY - 2006/12/1

Y1 - 2006/12/1

N2 - In this paper, a partial sphere decoding approach is proposed to reduce the computational complexity of implementing the iterative MAP receiver for spatial multiplexing system, in which the complexity prohibitively increases with the number of transmit antennas and modulation order. The proposed approach considers only a subset of symbols with high a priori probabilities, i.e., more reliable ones, which allows for reducing the dimension of detection space. We design a novel reliability estimator which is used for dividing two subvectors according to reliability of individual symbol in the initial stage. Furthermore, a cost function-based partial MAP rule is applied to those subvectors so as to correct the initial estimation error in the course of iterative detection and decoding process. We have shown that the overall complexity of sphere decoding can be reduced by almost order of 2 in terms of floating point operations while maintaining the BER performance as close as 0.7dB to the conventional approach.

AB - In this paper, a partial sphere decoding approach is proposed to reduce the computational complexity of implementing the iterative MAP receiver for spatial multiplexing system, in which the complexity prohibitively increases with the number of transmit antennas and modulation order. The proposed approach considers only a subset of symbols with high a priori probabilities, i.e., more reliable ones, which allows for reducing the dimension of detection space. We design a novel reliability estimator which is used for dividing two subvectors according to reliability of individual symbol in the initial stage. Furthermore, a cost function-based partial MAP rule is applied to those subvectors so as to correct the initial estimation error in the course of iterative detection and decoding process. We have shown that the overall complexity of sphere decoding can be reduced by almost order of 2 in terms of floating point operations while maintaining the BER performance as close as 0.7dB to the conventional approach.

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

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

U2 - 10.1109/VTCF.2006.420

DO - 10.1109/VTCF.2006.420

M3 - Conference contribution

SN - 1424400635

SN - 9781424400638

SP - 2023

EP - 2027

BT - IEEE Vehicular Technology Conference

ER -