• DocumentCode
    2033721
  • Title

    Low complexity sphere decoding algorithms

  • Author

    Shariat-Yazdi, Ramin ; Kwasniewski, Tad

  • Author_Institution
    Dept. of Electron., Carleton Univ., Ottawa, ON, Canada
  • fYear
    2008
  • fDate
    21-24 Oct. 2008
  • Firstpage
    438
  • Lastpage
    442
  • Abstract
    The complex sphere decoding algorithm has optimal bit error ratio performance for uncoded multiple-input multiple-output (MIMO) systems. The computational and hardware complexities of this algorithm increase significantly for detection of 64-QAM modulated signal streams. In this paper two modifications to the original sphere decoding algorithm are proposed that reduce both computational complexity and required hardware resources compared to the original sphere decoding algorithm. The improvements are achieved using a new definition for sphere radius and changing the symbol search strategy. Simulation results show the new algorithms have a small bit error ratio (BER) degradation compare to the original sphere decoding algorithm.
  • Keywords
    MIMO communication; computational complexity; decoding; error statistics; 64-QAM modulated signal streams. detection; BER; MIMO systems; bit error ratio performance; complex sphere decoding algorithm; computational complexities; hardware complexities; uncoded multiple-input multiple-output systems; Computer vision; Detectors; Hardware; MIMO; Maximum likelihood decoding; OFDM modulation; Receiving antennas; Signal processing algorithms; Throughput; Transmitters;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communication Systems. 2008. ISWCS '08. IEEE International Symposium on
  • Conference_Location
    Reykjavik
  • Print_ISBN
    978-1-4244-2488-7
  • Electronic_ISBN
    978-1-4244-2489-4
  • Type

    conf

  • DOI
    10.1109/ISWCS.2008.4726094
  • Filename
    4726094