Block length of LDPC codes in fading channels
Block length of LDPC codes in fading channels
复制标题
衰落信道中 LDPC 码的块长度
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
Do
中科院分区：
文献类型：
--
作者：
Wei Wu;Sangjin Hong;Do
本文从编码效率、抗信道衰落能力、译码复杂度和实现复杂度等方面研究了衰落信道下LDPC码的块长度，证明了当LDPC码的块长度足够长时，其信道容量接近Shannon极限。当考虑到编码效率时，期望具有非常长的块长度。同样由于固有的“交织器”效应，长码在深度衰落中不太可能完全损坏，因此可以避免严重的性能下降。然而，实际的块长度由LDPC解码器的实现复杂度确定，其随着块长度显著增加。我们表明，对于一个给定的信道条件下，有一个很好的块长度，具有最小的解码和实现的复杂性，而达到所需的BER。在这项研究中采用了单径瑞利衰落信道。
In this paper, we study the block length of LDPC codes on fading channels with respect to coding efficiency, immunity of channel fading, decoding complexity and implementation complexity, LDPC codes are proved to approach near-Shannon limit of channel capacity when the length is long enough. It is desirable to have very long block length when the coding efficiency is concerned. Also thanks to the inherent "interleaver" effect, long codes are less likely to be completely corrupted in deep fades and can thus avoid serious performance degradation. However, the practical block length is confirmed by the implementation complexity of LDPC decoder, which increases significantly with block length. We show that for a given channel condition, there is a good block length that has the least decoding and implementation complexity whereas achieves the desired BER. A single path Rayleigh fading channel is employed in this study.