Low-complexity near-MAP decoding of large non-orthogonal STBCs using PDA

Mohammed, Saif K. ; Chockalingam, A. ; Sundar Rajan, B. (2009) Low-complexity near-MAP decoding of large non-orthogonal STBCs using PDA In: 2009 IEEE International Symposium on Information Theory, 28 June-3 July 2009, Seoul, South Korea.

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/document/5205683/

Related URL: http://dx.doi.org/10.1109/ISIT.2009.5205683

Abstract

Non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) are attractive because they can simultaneously achieve both high spectral efficiencies (same spectral efficiency as in V-BLAST for a given number of transmit antennas) as well as full transmit diversity. Decoding of non-orthogonal STBCs with hundreds of dimensions has been a challenge. In this paper, we present a probabilistic data association (PDA) based algorithm for decoding non-orthogonal STBCs with large dimensions. Our simulation results show that the proposed PDA-based algorithm achieves near SISO AWGN uncoded BER as well as near-capacity coded BER (within 5 dB of the theoretical capacity) for large non-orthogonal STBCs from CDA.We study the effect of spatial correlation on the BER, and show that the performance loss due to spatial correlation can be alleviated by providing more receive spatial dimensions. We report good BER performance when a training-based iterative decoding/channel estimation is used (instead of assuming perfect channel knowledge) in channels with large coherence times. A comparison of the performances of the PDA algorithm and the likelihood ascent search (LAS) algorithm (reported in our recent work) is also presented.

Item Type:Conference or Workshop Item (Paper)
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
ID Code:102310
Deposited On:26 Mar 2017 14:42
Last Modified:26 Mar 2017 14:42

Repository Staff Only: item control page