Conference Paper

Evaluation of soft detection of STBC schemes for turbo codes.

DOI: 10.1109/WIMOB.2010.5644863 Conference: IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2010, Niagara Falls, Ontario, Canada, 11-13 October, 2010
Source: DBLP

ABSTRACT In this paper, we present an efficient turbo-coded space time block coding (STBC) schemes in block fading channels. It has been reported that proper utilization of soft decision information is one of the important factors affecting the performance of turbo codes. If a STBC scheme is used with turbo codes, the output of the STBC decoder must be fed into a turbo code decoder in the form of soft decision information. In addition, the performance of a turbo code is subject to how much diverse channel information a decoder can utilize in a codeword. In this paper we evaluate the performance of turbocoded STBC schemes over block fading channels, and present an efficient STBC scheme with very simple maximum likelihood detection capability.

  • [Show abstract] [Hide abstract]
    ABSTRACT: In this letter, we propose a quasi-orthogonal spacetime block coding (QO-STBC) scheme with maximum likelihood (ML) decoding via simple linear detection. A conventional QOSTBC scheme can achieve the full rate, but at the cost of decoding complexity and diversity gain. These disadvantages of the conventional QO-STBC scheme are mainly a result of interference terms in the detection matrix. In this letter, we propose a new QO-STBC scheme which eliminates interference terms. The proposed method achieves improved diversity gain with respect to the conventional QO-STBC scheme, as well as a great reduction in decoding complexity.
    IEEE Communications Letters 01/2009; · 1.46 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a new approach to soft demodulation for MIMO channels. The proposed method is an approximation to the exact a posteriori probability-per-bit computer. The main idea is to marginalize the posterior density for the received data exactly over the subset of the transmitted bits that are received with the lower signal-to-noise-ratio (SNR), and marginalize this density approximately over the remaining bits. Unlike the exact demodulator, whose complexity is huge due to the need for enumerating all possible combinations of transmitted constellation points, the proposed method has very low complexity. The algorithm has a fully parallel structure, suitable for implementation in parallel hardware. Additionally, its complexity is fixed, which makes it suitable for pipelined implementation. We also show how the method can be extended to the situation when the receiver has only partial channel state information, and how it can be modified to take soft-input into account. Numerical examples illustrate its performance on slowly fading 4 times 4 and 6 times 6 complex MIMO channels.
    IEEE Transactions on Signal Processing 09/2008; · 3.20 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: "Supervisor, Assistant Professor Guan Yong Liang." Thesis (Ph.D.) -Nanyang Technological University, School of Electrical and Electronic Engineering, 2006.