z-logo
open-access-imgOpen Access
Low‐complexity demapping algorithm for two‐dimensional non‐uniform constellations in ATSC 3.0
Author(s) -
Liu YuSun,
Chien ChihHao,
You Shingchern D.
Publication year - 2021
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/cmu2.12123
Subject(s) - computer science , reduction (mathematics) , algorithm , logarithm , computational complexity theory , constellation , spectral efficiency , broadcasting (networking) , mathematics , telecommunications , computer network , beamforming , mathematical analysis , physics , geometry , astronomy
The Advanced Television Systems Committee (ATSC) finalized its next‐generation digital terrestrial broadcast standard in 2016, known as ATSC 3.0. In order to enhance spectral efficiency, the standard employs two‐dimensional non‐uniform constellations (2D‐NUCs) for signal mapping. As a result, a 2D demapper, with computational complexity much higher than one‐dimensional (1D) demappers, has to be designed for the receiver. In this paper, a suboptimal low‐complexity 2D‐demapping method is proposed for ATSC 3.0. The proposed method takes advantage of the 2D‐NUC's feature that constellation points with same most significant bits tend to locate in the same subregion. Simulation results show that compared with the conventional Max‐Log‐MAP 2D demapping, the proposed method achieves at least 74 % complexity reduction with negligible performance loss. Moreover, compared with another 2D demapper specially designed for ATSC 3.0, the proposed method dispenses with high‐complexity exponential and logarithmic operations at a small performance cost of at most 0.14 dB.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here