DVB-S2: The Second Generation Standard for Satellite Broad-Band Services

Morello, A.; Mignone, V.

doi:10.1109/jproc.2005.861013

Cited by 331 publications

(186 citation statements)

References 12 publications

Supporting

Mentioning

179

Contrasting

Unclassified

Order By: Relevance

“…Similarly, DVB-S2 (Digital Video Broadcasting-2nd Generation Satellite) supports ACM to optimize data transmission for unicast commercial and professional services [47]. The transition from DVB-S to DVB-S2 brought around a 30% spectrum efficiency improvement [48].…”

Section: Prior Workmentioning

confidence: 99%

Link adaptation for mitigating Earth-to-Space propagation effects on the NASA SCaN testbed

Kilcoyne

Rowe

Headley

et al. 2016

2016 IEEE Aerospace Conference

View full text Add to dashboard Cite

In Earth-to-Space communications, well-known propagation effects such as path loss and atmospheric loss can lead to fluctuations in the strength of the communications link between a satellite and its ground station. Additionally, a less-often considered effect of shadowing due to the geometry of the satellite and its solar panels can also lead to link degradation. As a result of these anticipated channel impairments, NASA communication links have been traditionally designed to handle the worst-case impact of these effects through high link margins and static, lower rate, modulation formats. This thesis first characterizes the propagation environment experienced by a software-defined radio on the NASA SCaN Testbed through a full link-budget analysis. Then, the following chapters propose, design, and model a link adaptation algorithm to provide an improved trade-off between data rate and link margin through varying the modulation format as the received signal-to-noise operate at the most robust transmitting configuration, ensuring a low error-rate. However, with this worst-case method, the trade-off manifests in the very constrained data rate-although the data is transmitted with minimal errors, the throughput also remains low. This thesis first outlines the propagation environment experienced by a communications signal originating in Cleveland, OH and traveling to a software-defined radio on the NASA SCaN Testbed. Then, a link adaptation algorithm is designed and simulated to provide an improved trade-off between data rate and bit error rate. This flexibility between transmitting configurations allows for communications to be more efficient, as the transmitter can adapt as the signal strength improves.

show abstract

Section: Prior Workmentioning

confidence: 99%

Link adaptation for mitigating Earth-to-Space propagation effects on the NASA SCaN testbed

Kilcoyne

Rowe

Headley

et al. 2016

2016 IEEE Aerospace Conference

View full text Add to dashboard Cite

show abstract

“…기존의 비트-직렬 최소값 생성기 [7] 는 , 10 Gbps 이더넷 [4] , DVB-S2 [5] , 10 Gbps 이더넷 [4] , DVB-S2 [5] 표준 등 저면적 /고속 LDPC 복호기의 두 최소값 생성기로 적합하다.…”

Section: 제안하는 두 최소값 생성기의 하드웨어 구조unclassified

“…서 론 LDPC(low-density parity-check) 부호 [1] 는 뛰어난 오류정정 능력과 병렬구조를 통한 고속 동작의 특징을 가진다. 때문에, LDPC 부호는 플래시 메모리의 ECC(error correction code) [2～3] , 10 Gbps 이더넷 표준 (IEEE 802.3an) [4] , 디지털 방송 표준(DVB-S2) [5] 호 알고리즘인 sum-product 알고리즘을 사용하면 행연 산을 위해 초월함수인 Gallager 함수 연산이 필요하다.…”

unclassified

Efficient AT-Complexity Generator Finding First Two Minimum Values for Bit-Serial LDPC Decoding

Lee¹,

Sunwoo²

2016

Journal of the Institute of Electronics and Information Enginee

View full text Add to dashboard Cite

This paper proposes a low-complexity generator which finds the first two minimum values using bit-serial scheme. A low-complexity generator is an important part for low-area LDPC decoders based on the min-sum decoding algorithm because the hardware complexity of generators utilizes a significant portion of LDPC decoders. To reduce hardware complexity, bit-serial LDPC decoders has been studied. The generator of the existing bit-serial LDPC decoders can find only the first minimum value, and thus it leads to a BER performance degradation. The proposed generator using bit-serial scheme finds the first two minimum values. Hence, it can improve the BER performance. In addition, the area-time complexity of the proposed generator is lower than those of the existing generators finding the first two minima.

show abstract

“…N usually reaches several hundreds in tests, as the Tanner code of length N = 155, and several thousands in practice, as DVB-S2 codes of length N = 64800 [26]. BP algorithm is a tractable and practical solution to (1) by approximating all marginal distributions, or marginals, on variable nodes with beliefs {b i } 1≤i≤N s.t.…”

Section: B Belief Propagationmentioning

confidence: 99%

Generalized Belief Propagation to break trapping sets in LDPC codes

Sibel

Reynal

Declercq

2014

2014 Australian Communications Theory Workshop (AusCTW)

View full text Add to dashboard Cite

Abstract-In this paper, we focus on the Generalized Belief Propagation (GBP) algorithm to solve trapping sets in LowDensity Parity-Check (LDPC) codes. Trapping sets are topological structures in Tanner graphs of LDPC codes that are not correctly decoded by Belief Propagation (BP), leading to exhibit an error-floor in the Bit-Error Rate (BER). Stemming from statistical physics of spin glasses, GBP consists in passing messages between clusters of Tanner graph nodes in another graph called the region-graph. Here, we introduce a specific clustering of nodes, based on a novel local loopfree principle, that breaks trapping sets such that the resulting region-graph is locally loopfree. We then construct a hybrid decoder made of BP and GBP that proves to be a powerful decoder as it clearly improves the BER and defeats the error-floor.

show abstract

DVB-S2: The Second Generation Standard for Satellite Broad-Band Services

Cited by 331 publications

References 12 publications

Link adaptation for mitigating Earth-to-Space propagation effects on the NASA SCaN testbed

Link adaptation for mitigating Earth-to-Space propagation effects on the NASA SCaN testbed

Efficient AT-Complexity Generator Finding First Two Minimum Values for Bit-Serial LDPC Decoding

Generalized Belief Propagation to break trapping sets in LDPC codes

Contact Info

Product

Resources

About