Reduced-complexity soft STBC detection
Reduced-complexity soft STBC detection
In this paper, we propose to reduce the complexity of both the Approx-Log-MAP algorithm as well as of the Max-Log-MAP algorithm, which were designed for soft-decision-aided Space-Time Block Code (STBC) detectors. First of all, we review the STBC design, which enables regular L-PSK/QAM detectors to be invoked in order to detect STBCs on a symbol-by-symbol basis. Secondly, we propose to operate the L-PSK/QAM aided STBC detection on a bit-by-bit basis, so that the complexity may be reduced from the order of O(L) to O(BPS). Our simulation results demonstrate that a near-capacity performance may be achieved by the proposed detectors at a substantially reduced detection complexity. For example, a factor six complexity reduction was achieved by the proposed algorithms, when they were invoked for detecting Alamouti's Square 16QAM aided G2 scheme.
Xu, Chao
349b7322-fd17-4fcd-a49f-c62afe284d50
Liang, Dandan
7ec17ba1-8959-4ee0-8f58-2e51c646ae23
Sugiura, Shinya
acb6e7ea-eb0c-4b33-82c6-da8640be4233
Ng, S.X.
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Xu, Chao
349b7322-fd17-4fcd-a49f-c62afe284d50
Liang, Dandan
7ec17ba1-8959-4ee0-8f58-2e51c646ae23
Sugiura, Shinya
acb6e7ea-eb0c-4b33-82c6-da8640be4233
Ng, S.X.
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Xu, Chao, Liang, Dandan, Sugiura, Shinya, Ng, S.X. and Hanzo, Lajos
(2012)
Reduced-complexity soft STBC detection.
2012 IEEE Global Communications Conference, Anaheim, United States.
03 - 07 Dec 2012.
Record type:
Conference or Workshop Item
(Paper)
Abstract
In this paper, we propose to reduce the complexity of both the Approx-Log-MAP algorithm as well as of the Max-Log-MAP algorithm, which were designed for soft-decision-aided Space-Time Block Code (STBC) detectors. First of all, we review the STBC design, which enables regular L-PSK/QAM detectors to be invoked in order to detect STBCs on a symbol-by-symbol basis. Secondly, we propose to operate the L-PSK/QAM aided STBC detection on a bit-by-bit basis, so that the complexity may be reduced from the order of O(L) to O(BPS). Our simulation results demonstrate that a near-capacity performance may be achieved by the proposed detectors at a substantially reduced detection complexity. For example, a factor six complexity reduction was achieved by the proposed algorithms, when they were invoked for detecting Alamouti's Square 16QAM aided G2 scheme.
Text
RC_STBC_GlobeCom_v2.pdf
- Other
More information
e-pub ahead of print date: 3 December 2012
Venue - Dates:
2012 IEEE Global Communications Conference, Anaheim, United States, 2012-12-03 - 2012-12-07
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 340957
URI: http://eprints.soton.ac.uk/id/eprint/340957
PURE UUID: fb09ec32-1098-490d-916e-8a7255432126
Catalogue record
Date deposited: 11 Jul 2012 13:46
Last modified: 18 Mar 2024 02:48
Export record
Contributors
Author:
Chao Xu
Author:
Dandan Liang
Author:
Shinya Sugiura
Author:
S.X. Ng
Author:
Lajos Hanzo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics