• DocumentCode
    2806958
  • Title

    Low-complexity and high-performance soft MIMO detection based on distributed M-algorithm through trellis-diagram

  • Author

    Sun, Yang ; Cavallaro, Joseph R.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA
  • fYear
    2010
  • fDate
    14-19 March 2010
  • Firstpage
    3398
  • Lastpage
    3401
  • Abstract
    This paper presents a novel low-complexity multiple-input multiple-output (MIMO) detection scheme using a distributed M-algorithm (DM) to achieve high performance soft MIMO detection. To reduce the searching complexity, we build a MIMO trellis graph and split the searching operations among different nodes, where each node will apply the M-algorithm. Instead of keeping a global candidate list as the traditional detector does, this algorithm keeps multiple small candidate lists to generate soft information. Since the DM algorithm can achieve good BER performance with a small M, the sorting cost of the DM algorithm is lower than that of the conventional K-best MIMO algorithm. The proposed algorithm is very suitable for high speed parallel processing.
  • Keywords
    MIMO communication; graph theory; parallel processing; trellis codes; MIMO trellis graph; distributed M-algorithm; high speed parallel processing; soft MIMO detection; trellis-diagram; Bit error rate; Costs; Decoding; Delta modulation; Detectors; Greedy algorithms; MIMO; Receiving antennas; Sorting; Throughput; M-Algorithm; MIMO; Soft Detection;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on
  • Conference_Location
    Dallas, TX
  • ISSN
    1520-6149
  • Print_ISBN
    978-1-4244-4295-9
  • Electronic_ISBN
    1520-6149
  • Type

    conf

  • DOI
    10.1109/ICASSP.2010.5495990
  • Filename
    5495990