.png){kind=icon}
.png){kind=icon}
Return
A Low-Complexity Decoding Algorithm for Coded Hierarchical Modulation in Single Frequency Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TBC.2014.2318554.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, the hierarchical modulation (HM) technique is adopted in a single frequency network (SFN) to provide both global and local information. In order to mitigate the interlayer interference and intercell interference, we develop a low-complexity successive interference cancellation (SIC) algorithm for the coded HM signals in the SFN. The proposed decoding algorithm can be applied to different soft-decision channel coding schemes (e. g., Turbo codes, LDPC codes) under various channel profiles. We analyzed the decoding complexity of the proposed algorithm, and evaluated the bit error rate performance. The simulations show that the new decoding algorithm can offer up to 0.7 dB carrier to noise ratio (C/N) gain compared with the traditional SIC approach under different channel models, while providing the comparable performance (up to 95% decoding complexity savings) with the multilayer iterative decoding approach. The performance evaluation and decoding complexity comparisons indicate that the proposed structured SIC approach offers a good performance-complexity trade-off, especially for the HM-based SFN scenarios.
Keywords:
Hierarchical modulation
single frequency network
structured SIC
low decoding complexity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
2.1K
Citations:
3.0K
View more organizations