SciELO - Scientific Electronic Library Online

 
vol.109 número3 índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Artigo

Indicadores

Links relacionados

  • Em processo de indexaçãoCitado por Google
  • Em processo de indexaçãoSimilares em Google

Compartilhar


SAIEE Africa Research Journal

versão On-line ISSN 1991-1696
versão impressa ISSN 0038-2221

Resumo

PILLAY, R.; XU, H.  e  PILLAY, N.. Low-complexity near-ML detection algorithms for NR-STAR-MQAM spatial modulation. SAIEE ARJ [online]. 2018, vol.109, n.3, pp.192-202. ISSN 1991-1696.

In this study, the authors propose two low-complexity near-maximum-likelihood (ML) detection algorithms for spatial modulation (SM) systems, employing the new multiple-ring star-M-ary quadrature amplitude modulation (MR-STAR-MQAM) constellation. The proposed detectors exploit the specific orientation of MR-STAR-MQAM, in order to avoid searching across all constellation points. As a result, the computational complexity is independent of both the constellation size and the number of rings presented in MR-STAR-MQAM. In addition, these detectors are generalized and can be applied to the entire star-MQAM family. The Monte Carlo simulation results demonstrate that the proposed detection algorithms achieve the same average bit error rate (ABER) as ML detection for SM but at a much lower computational complexity. For example, in a 4x4, 2R-STAR-16QAM aided SM system, the proposed optimal and sub-optimal detectors achieve an 88.8% and 90.5% reduction in computational complexity, respectively, compared to the ML detector. Furthermore, the simulation results are supported by a closed-form union-bound theoretical ABER expression.

Palavras-chave : Low-complexity near-maximum-likelihood detection; multiple-input multiple-output; M-rings star-M-ary quadrature amplitude modulation; spatial modulation.

        · texto em Inglês     · Inglês ( pdf )

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons