Review of DVB-S2 System and its LDPC Coding
Keywords:
DVB-S, DVB-S2, CCM, ACM, VCM, BS, FEC, LDPC, IP Unicast, DSNG, Coding GainAbstract
Satellite networks are lucrative because of their wide coverage, rapid deployment of user terminals, and the virtual nonexistence of wired networks in difficult terrains. DVB-S2 is the new standard for digital video broadcast for fixed users, offering a 30% capacity increase over DVB-S. It also supports interactive services, including IP unicast and digital satellite news gathering. As satellite networks are characterized by low received power, they require the most powerful coding techniques for significant coding gains. This study provides a broad view of DVB-S2, its services, the channel coding requirements for satellite fixed broadcast services, the justification for using LDPC codes, a description of LDPC codes, and the expected performance of broadcast systems using these codes. This study will serve as the basis for software simulation of the LDPC encoding and decoding algorithms used in DVB-S2, as well as others available in literature, and will compare their performances for the simulated broadcast scenarios. The comparison metrics will include coding gains, encoding and decoding complexity, encoding and decoding time, and the resource requirements for encoding and decoding.
References
Digital Video Broadcasting (DVB); Framing, structure, channel coding and modulation for 11/12 GHz satellite services, EN 300 421 V1.1.2 (1997-08), European Telecommunications Standard Institute (ETSI).
Digital Video Broadcasting (DVB); Second generation framing structure, channel coding and modulation system for broadcasting, interactive services, news gathering and other broadband satellite applications (DVB-S2), EN 302 307 V1.3.1 (2013-03), European Telecommunications Standard Institute (ETSI).
R. G. Gallager, "Low-Density Parity-Check Codes," 1963.
V. Coralli, G. E. Corazza, G. K. Karagiannidis, P. T. Mathiopoulos, D. S. Michalopoulos, C. Mosquera, S. Papaharalabos, and S. Scaise, "Satellite Communications: Research trends and open issues," International Workshop on Satellite and Space Communications (IWSSC), 2007.
R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, no. 5, pp. 533–547, Sept. 1981.
M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 585–598, Feb. 2001.
T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619–637, Feb. 2001.
M. G. Luby, M. Mitzenmacher, and M. A. Shokrollahi, "Analysis of random processes via and-or tree evaluation," Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 364–373, 1998.
C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1570–1579, Jun. 2002.
R. L. Townsend and E. J. Weldon, "Self-orthogonal quasi-cyclic codes," IEEE Trans. Inform. Theory, vol. IT-13, no. 2, pp. 183–195, Apr. 1967.
G. A. Margulis, "Explicit constructions for graphs without short cycles and low density codes," Combinatorica, vol. 2, no. 1, pp. 71–78, 1982.
K. Karplus and H. Krit, "A semi-systolic decoder for the PDSC-73 error-correcting code," Discrete Applied Math., vol. 33, no. 1–3, pp. 109–128, 1988.
Downloads
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
