A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Reduced-complexity Soft STBC detection
2012
2012 IEEE Global Communications Conference (GLOBECOM)
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
doi:10.1109/glocom.2012.6503779
dblp:conf/globecom/XuLSNH12
fatcat:cbwj42jwcrbtxdhr6l5yqw6noq