2013
DOI: 10.1109/wcl.2012.120312.120601
|View full text |Cite
|
Sign up to set email alerts
|

A New Low-Complexity Near-ML Detection Algorithm for Spatial Modulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
52
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 74 publications
(52 citation statements)
references
References 12 publications
0
52
0
Order By: Relevance
“…(9). Hence, the error performance of the QBSD algorithm is inferior to that of Max-Log-LLR algorithm.…”
Section: Iqbsd Algorithmmentioning
confidence: 98%
See 3 more Smart Citations
“…(9). Hence, the error performance of the QBSD algorithm is inferior to that of Max-Log-LLR algorithm.…”
Section: Iqbsd Algorithmmentioning
confidence: 98%
“…(8), while only one of the minimum term in Eq. (9). Hence, in this step, we need to find the signal points that result in another minimum term of Eq.…”
Section: Lemma 2 For the Binary-reflected Gray Psk G K J → S K J Wmentioning
confidence: 99%
See 2 more Smart Citations
“…Several reduced-complexity detectors were proposed for SM in [9]- [12] that achieve near-ML performance. Furthermore, the robustness of the SM system to channel imperfections was studied in comparison to conventional MIMO (C-MIMO) systems in [13], [14].…”
mentioning
confidence: 99%