• DocumentCode
    1235988
  • Title

    Quasi-maximum-likelihood detector based on geometrical diversification greedy intensification

  • Author

    Nafkha, Amor ; Boutillon, Emmanuel ; Roland, Christian

  • Author_Institution
    CNRS, SUPELEC/IETR, Cesson-Sevigne
  • Volume
    57
  • Issue
    4
  • fYear
    2009
  • fDate
    4/1/2009 12:00:00 AM
  • Firstpage
    926
  • Lastpage
    929
  • Abstract
    This letter proposes a quasi optimum maximum likelihood detection technique based on Geometrical Diversification and Greedy Intensification (GDGI). The presented detector scheme is shown to achieve almost optimal performance for all signal-to-noise ratio (SNR) values and a cubic computation complexity in the problem dimension. It possesses a regular structure well suited for hardware implementation. Simulation results show that for a system with a high dimension of n = 60, the loss is approximately 0.35 dB at BER=10-5 compared to an optimal decoding.
  • Keywords
    error statistics; greedy algorithms; maximum likelihood detection; BER; GDGI method; bit error rate; cubic computation complexity; geometrical diversification; greedy intensification; quasioptimum maximum likelihood detection technique; Detectors; Face detection; Greedy algorithms; Hardware; Hypercubes; Iterative decoding; Lattices; Maximum likelihood decoding; Maximum likelihood detection; Search methods; Maximum likelihood detection, MIMO systems, singular value decomposition, greedy algorithm;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOMM.2009.04.060603
  • Filename
    4814357