2016 23rd International Conference on Telecommunications (ICT) 2016
DOI: 10.1109/ict.2016.7500482
|View full text |Cite
|
Sign up to set email alerts
|

Affine linear transformation based sphere decoder for 1-bit ADC MIMO-constant envelope modulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 14 publications
0
5
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 3 more Smart Citations
“…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%
“…The results demonstrated that the proposed method significantly outperforms the other MIMO detectors with hard-decision outputs. In addition, the signal decoding techniques for low-resolution ADCs MIMO-CEM are reported in [146]- [148]. Doaa et al (2016) [146] designed a low complexity sphere decoder.…”
Section: Data Detection and Receiver Designmentioning
confidence: 99%
See 2 more Smart Citations
“…The aim of this paper is to consider the affine transform modulation (ATM) to represent a sequence of Quadrature Amplitude Modulation (QAM) symbols as the affine transform (AT) of its bit labels. Further, we propose a reduced complexity SD algorithm based on the ATM concept, representing the received vector as a linear transformation of the transmitted binary information plus the receiver noise 5. The complexity reduction relies on a subtle simplification in the cost dominant inner function of every SD algorithm, the Euclidean distance (ED) computation at each visited node of the tree search structure.…”
Section: Introductionmentioning
confidence: 99%