2016
DOI: 10.1109/tbc.2015.2492477
|View full text |Cite
|
Sign up to set email alerts
|

Low-Complexity Demapping Algorithm for Two-Dimensional Non-Uniform Constellations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
31
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 33 publications
(32 citation statements)
references
References 18 publications
1
31
0
Order By: Relevance
“…In [13], high-order NUCs with constellation sizes of up to 4k-QAM are investigated. A sub-optimal demapper that reduces the total number of distances to be computed when using 2D-NUCs has also been proposed in [14].…”
Section: Introductionmentioning
confidence: 99%
“…In [13], high-order NUCs with constellation sizes of up to 4k-QAM are investigated. A sub-optimal demapper that reduces the total number of distances to be computed when using 2D-NUCs has also been proposed in [14].…”
Section: Introductionmentioning
confidence: 99%
“…low order constellations and high code rates, as reference [104] shows. However, RCs may become especially effective when using multi-RF techniques, such as Channel Bonding (CB) [62], providing very high performance gains.…”
Section: Non-uniform Rotated Constellationsmentioning
confidence: 94%
“…With NUCs, optimum demappers calculate the distances from the received signal to all constellation symbols in a different manner, since the shape of the constellation changes. In that sense, Section 4.1 analyzes the demapping complexity, while in Section 4.2 we propose a new low-complexity demapping algorithm that reduces the amount of distances to calculate the LLRs [104]. As an example of application, we provide the results for NUCs optimized in Chapter 3.…”
Section: Low-complexity Demapping and Quantization Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations