2017 14th IEEE Annual Consumer Communications &Amp; Networking Conference (CCNC) 2017
DOI: 10.1109/ccnc.2017.7983203
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive sphere decoder for 1-bit ADC MIMO-constant envelope modulation detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 2 publications
0
2
0
Order By: Relevance
“…In their solution, a kernel sparse selector based on the correntropy maximization is used to nominate number of candidates from the space of linear baseband maximum likelihood decoder. The proposed decoder can achieve a complexity reduction by 91% compared to the recently decoder algorithms in [146], [147].…”
Section: Data Detection and Receiver Designmentioning
confidence: 94%
See 1 more Smart Citation
“…In their solution, a kernel sparse selector based on the correntropy maximization is used to nominate number of candidates from the space of linear baseband maximum likelihood decoder. The proposed decoder can achieve a complexity reduction by 91% compared to the recently decoder algorithms in [146], [147].…”
Section: Data Detection and Receiver Designmentioning
confidence: 94%
“…Then, the maximum likelihood decoder is used to pick up the candidate that most likely to be transmitted. In [147], Doaa et al (2017) further constructed an adaptive sphere decoder based on an affine linear transformation model. Compared with the method in [146], the biggest difference of the proposed decoder is that the initial spherical radius can be adaptively adjusted based on the SNR condition.…”
Section: Data Detection and Receiver Designmentioning
confidence: 99%