• Title/Summary/Keyword: ML symbol-by-symbol detection

Search Result 14, Processing Time 0.017 seconds

Quasi-Orthogonal STBC with Iterative Decoding in Bit Interleaved Coded Modulation

  • Sung, Chang-Kyung;Kim, Ji-Hoon;Lee, In-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4A
    • /
    • pp.426-433
    • /
    • 2008
  • In this paper, we present a method to improve the performance of the four transmit antenna quasi-orthogonal space-time block code (STBC) in the coded system. For the four transmit antenna case, the quasi-orthogonal STBC consists of two symbol groups which are orthogonal to each other, but intra group symbols are not. In uncoded system with the matched filter detection, constellation rotation can improve the performance. However, in coded systems, its gain is absorbed by the coding gain especially for lower rate code. We propose an iterative decoding method to improve the performance of quasi-orthogonal codes in coded systems. With conventional quasi-orthogonal STBC detection, the joint ML detection can be improved by iterative processing between the demapper and the decoder. Simulation results shows that the performance improvement is about 2dB at 1% frame error rate.

Two New Types of Candidate Symbol Sorting Schemes for Complexity Reduction of a Sphere Decoder

  • Jeon, Eun-Sung;Kim, Yo-Han;Kim, Dong-Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.888-894
    • /
    • 2007
  • The computational complexity of a sphere decoder (SD) is conventionally reduced by decoding order scheme which sorts candidate symbols in the ascending order of the Euclidean distance from the output of a zero-forcing (ZF) receiver. However, since the ZF output may not be a reliable sorting reference, we propose two types of sorting schemes to allow faster decoding. The first is to use the newly found lattice points in the previous search round instead of the ZF output (Type I). Since these lattice points are closer to the received signal than the ZF output, they can serve as a more reliable sorting reference for finding the maximum likelihood (ML) solution. The second sorting scheme is to sort candidate symbols in descending order according to the number of candidate symbols in the following layer, which are called child symbols (Type II). These two proposed sorting schemes can be combined with layer sorting for more complexity reduction. Through simulation, the Type I and Type II sorting schemes were found to provide 12% and 20% complexity reduction respectively over conventional sorting schemes. When they are combined with layer sorting, Type I and Type II provide an additional 10-15% complexity reduction while maintaining detection performance.

Statistical Precoder Design for Spatial Multiplexing Systems in Correlated MIMO Fading Channels (높은 안테나 상관도를 갖는 다중입출력 공간 다중화 시스템을 위한 통계적 프리코딩 기법)

  • Moon, Sung-Hyun;Kim, Jin-Sung;Lee, In-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.3A
    • /
    • pp.223-231
    • /
    • 2011
  • It has been shown that the performance of multiple-input multiple-output (MIMO) spatial multiplexing systems is significantly degraded when spatial correlation exists between transmit and receive antenna pairs. In this paper, we investigate designs of a new statistical precoder for spatial multiplexing systems with maximum likelihood (ML) receiver which requires only correlation statistics at the transmitter. Two kinds of closed-form solution precoders based on rotation and power allocation are proposed by means of maximizing the minimum E tlidean distance of joint symbol constellations. In addition, we extend our results to linear receivers for correlated channels. We provide a method which yields the same profits from the proposed precoders based on a simple zero-forcing (ZF) receiver. The simulation shows that 2dB and 8dB gains are achieved for ML and ZF systems with two transmit antennas, respectively, compared to the conventional systems.

A New Efficient Group-wise Spatial Multiplexing Design for Closed-Loop MIMO Systems (폐루프 다중입출력 시스템을 위한 효율적인 그룹별 공간 다중화 기법 설계)

  • Moon, Sung-Myun;Lee, Heun-Chul;Kim, Young-Tae;Lee, In-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4A
    • /
    • pp.322-331
    • /
    • 2010
  • This paper introduces a new efficient design scheme for spatial multiplexing (SM) systems over closed loop multiple-input multiple-output (MIMO) wireless channels. Extending the orthogonalized spatial multiplexing (OSM) scheme which was developed recently for transmitting two data streams, we propose a new SM scheme where a larger number of data streams can be supported. To achieve this goal, we partition the data streams into several subblocks and execute the block-diagonalization process at the receiver. The proposed scheme still guarantees single-symbol maximum likelihood (ML) detection with small feedback information. Simulation results verify that the proposed scheme achieves a huge performance gain at a bit error rate (BER) of $10^{-4}$ over conventional closed-loop schemes based on minimum mean-square error (MSE) or bit error rate (BER) criterion. We also show that an additional 2.5dB gain can be obtained by optimizing the group selection with extra feedback information.