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

Low Complexity Adaptive Demapper for 2-D Non-Uniform Constellations

Abstract: In this paper, a novel demapper for two-dimensional non-uniform constellations (2D-NUC) is proposed, exploiting the characteristics of these constellations. It represents the combination of two underlying demapping techniques targeting ATSC 3.0 compliant OFDM transceiver. On the one hand, for low code rates, we define a metric to perform condensed demapping. On the other hand, for high code rates, adaptive sub-region demapping is proposed. In this work, a combination of both demapping methods is designed showi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 38 publications
0
4
0
Order By: Relevance
“…However, the improvement comes at a price of BER performance degradation induced by distance approximation. Barrueco et al showed that to achieve a balance between demapping complexity and BER performance, the distance between any two points in a cluster is better limited to less than 0.1 [19]. In this paper, we adopt 0.05 as the distance limit.…”
Section: Proposed Demapping Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…However, the improvement comes at a price of BER performance degradation induced by distance approximation. Barrueco et al showed that to achieve a balance between demapping complexity and BER performance, the distance between any two points in a cluster is better limited to less than 0.1 [19]. In this paper, we adopt 0.05 as the distance limit.…”
Section: Proposed Demapping Methodsmentioning
confidence: 99%
“…Compared with the Log‐MAP algorithm, the Max‐Log‐MAP algorithm [20, 21], and Fuentes' method, the proposed 2D‐demapping method is shown to have a significantly lower complexity. Moreover, the subsets in the proposed method, unlike those in the adaptive‐subregion demapping algorithm [19], are determined beforehand. Therefore, the proposed method has fixed complexity and is suitable for hardware implementation.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…As mentioned above, using a set of non-equally spaced constellations can enhance the performance of a given system in different aspects but it comes with some implementation complexity. Specifically, it was shown in [10], [11] that employing non-uniform constellations introduces a bottleneck in real receiver implementations where demappers are supposed to calculate the distance to all constellation points. In addition to the demapping complexity, the use of multiple constellations requires look-up table (LUT)-based structures where the constellation points are stored in them along with suitable labels.…”
Section: Introductionmentioning
confidence: 99%