.png){kind=icon}
.png){kind=icon}
Return
DVB-S2 LDPC decoding using robust check node update approximations
.png){kind=icon}
PRE
AI
DOI：10.1109/TBC.2007.911365.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Broadband satellite services to fixed terminals are currently offered in the forward link by the 2nd Generation (2G) Digital Video Broadcasting Satellite (DVB-S2) standard. For this standard the use of powerful Low-Density Parity-Check (LDPC) error correcting codes has been adopted performing within approximately I dB from the Shannon capacity limit. This paper studies and compares for the first time in a systematic manner different approximation methods used in check node update computation of DVB-S2 LDPC decoding with the aim of reducing computational complexity. Various performance evaluation results are presented for a wide range of DVB-S2 parameters, such as LDPC codeword size, coding rate, modulation format and including several decoding algorithms. It is shown that the proposed check node update approximations have a robust behavior, i.e. the resulting performance is quite independent of the DVB-S2 modulation and coding parameters. It is further shown that these approximations perform very close to the optimal Sum-Product Algorithm (SPA) in degradation, which is less than 0.2 dB. Despite this small degradation, the reduction in computational complexity compared to the optimal SPA is significant and can be as high as 40% in computational time savings.
Keywords:
broadcasting
iterative decoding
low-density parity-check (LDPC) codes
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