Low-Complexity Decoding Algorithms for the LDM Core Layer at Fixed Receivers in ATSC 3.0

Gallager's decoding algorithms <inline-formula> <tex-math notation="LaTeX">{B} </tex-math></inline-formula> (GDB) and <inline-formula> <tex-math notation="LaTeX">{E} </tex-math></inline-formula> (GDE) for low-density parity-che...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on broadcasting Ročník 63; číslo 1; s. 293 - 303
Hlavní autori: Cho, Sunghye, Hwang, Youngjun, Myung, Seho, Yang, Kyeongcheol
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 01.03.2017
Predmet:
ISSN:0018-9316, 1557-9611
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Gallager's decoding algorithms <inline-formula> <tex-math notation="LaTeX">{B} </tex-math></inline-formula> (GDB) and <inline-formula> <tex-math notation="LaTeX">{E} </tex-math></inline-formula> (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.
ISSN:0018-9316
1557-9611
DOI:10.1109/TBC.2016.2606879