DI-UMONS : Dépôt institutionnel de l’université de Mons

Recherche transversale
(titres de publication, de périodique et noms de colloque inclus)
2022-02-01 - Article/Dans un journal avec peer-review - Anglais - 12 page(s)

Honfoga Anne-Carole , Dossou M., Moeyaert Véronique , "Low complexity demapping algorithms survey in DVB-T2: Rotated constellation case study" in International Journal of Information Science and Technology , 6, 1, 26-37

  • Codes CREF : Technologie des télécommunications [transmission] (DI2556), Technologie des télécommunications [télécommunications] (DI2550)
  • Unités de recherche UMONS : Electromagnétisme et Télécommunications (F108)
  • Instituts UMONS : Institut de Recherche en Technologies de l’Information et Sciences de l’Informatique (InforTech)
  • Centres UMONS : Centre de Recherche en Technologie de l’Information (CRTI)
Texte intégral :

Abstract(s) :

(Anglais) Signal Space Diversity (SSD) technique was adopted in Digital Video Broadcasting-Terrestrial, second generation (DVB-T2) standard ten years ago to increase system performance over fading channels. This technique consists of rotated and cyclic Q-delayed M-Quadrature Amplitude Modulation (QAM) and has been proposed without considering the complexity induced by the demapper. "Genie Aided" demapping algorithm based on iterative demapping has been presented in DVB-T2 and lets this system approach the Shannon limit. Furthermore, this algorithm is not suitable for hardware implementation. Due to the complexity of the hardware implementation algorithms, the advantages of this rotated constellation have not been effectively exploited for network deployment. Moreover, receivers provided by manufacturers do not include suitable demappers when this technique is applied. Therefore, several low complexity algorithms have been proposed during the last decade in the scientific literature to reduce the number of metrics and operators used in the demapping process. This paper presents an exhaustive review of demappers proposed for DVB-T2 and all the low complexity demapping algorithms existing up to now in the literature that is suitable for hardware implementation. Details about these algorithms are given in terms of reduction, parameters, performance and percentage of reduction obtained.