Low complexity two-stage soft demapper for rotated constellation in DVB-T2

Bae, Kwang‐Hak; Kim, Kyeongyeon; Yang, Ho

doi:10.1109/icce.2012.6162044

Cited by 5 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Various algorithms for the demapping of rotated constellations have been discussed in [1,3,10,11,16]. In addition to the maximum likelihood (ML) demapper as well as its max-log simplification [3,11], the algorithms based on minimum mean squared error (MMSE) decorrelation and interference cancellation (IC) described in [10], will also be implemented and measured on the GPU.…”

Section: Introductionmentioning

confidence: 99%

Implementation and performance analysis of DVB-T2 rotated constellation demappers on a GPU

Grönroos

Nybom

Björkqvist

2013

Analog Integr Circ Sig Process

View full text Add to dashboard Cite

The DVB-T2 standard for digital terrestrial broadcasting supports the use of quadrature amplitude modulation constellations where the constellation points are rotated in the I-Q plane. This combined with a cyclic delay of the Q component provides improved performance in some fading channels. The complexity of the optimal demapping process for rotated constellations is however significantly higher than for non-rotated constellations. This makes the DVB-T2 demapper one of the most computationally complex parts of a receiver. In this article, we examine possible simplifications of the demapping process suitable for implementation on a general purpose computer containing a modern graphics processing unit (GPU). Furthermore, we measure the performance in terms of throughput, as well as accuracy, of the implemented algorithms. The implementations are designed to interface efficiently to a previously implemented real-time capable GPU-based low-density parity-check channel decoder.

show abstract