Low-Complexity Decoding Algorithms for the LDM Core Layer at Fixed Receivers in ATSC 3.0
| Autor: | Youngjun Hwang, Seho Myung, Kyeongcheol Yang, Sunghye Cho |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Computational complexity theory
Computer science Binary number 020206 networking & telecommunications 02 engineering and technology Communications system Multiplexing 020202 computer hardware & architecture Robustness (computer science) 0202 electrical engineering electronic engineering information engineering Media Technology Radio frequency Forward error correction Electrical and Electronic Engineering Algorithm Decoding methods |
| Zdroj: | IEEE Transactions on Broadcasting. 63:293-303 |
| ISSN: | 1557-9611 0018-9316 |
| DOI: | 10.1109/tbc.2016.2606879 |
| Popis: | Gallager’s decoding algorithms ${B}$ (GDB) and ${E}$ (GDE) for low-density parity-check codes have much lower computational complexity and much less required memory size than the sum-product algorithm (SPA). This is because GDB and GDE only use binary or integer operations, while the SPA requires real operations and a look-up table. However, they are hardly used in commercial communication systems since they have a worse performance than the SPA. Layered-division multiplexing (LDM) is considered in ATSC 3.0 in order to deliver multiple broadcasting streams with distinct robustness in a single radio frequency channel. Due to the unique characteristic of the LDM, we propose to use GDB or GDE rather than the SPA for decoding the core layer signal at fixed receivers. Numerical results show that the computational complexity and the required memory size can be reduced without any performance loss by about 50 percent and 80 percent, respectively, when GDB and GDE are employed. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|