Low-density parity-check (LDPC) codes deliver very good performance when decoded with the bpalgorithm. Unfortunately, this algorithm has the disadvantage to be complex for implementation. In this paper, we investigat...
详细信息
ISBN:
(纸本)9781424416875
Low-density parity-check (LDPC) codes deliver very good performance when decoded with the bpalgorithm. Unfortunately, this algorithm has the disadvantage to be complex for implementation. In this paper, we investigate the bpalgorithm and its simplifications (bp-based, normalizedbp-based, offset bp-based). Previous works on normalized and offset bp-based proposed theoretical values for the offset and normalization factors, we perform simulations which allow to validate these theoretical results.
Low-density parity-check (LDPC) codes deliver very good performance when decoded with the bpalgorithm. Unfortunately, this algorithm has the disadvantage to be complex for implementation. In this paper, we investigat...
详细信息
Low-density parity-check (LDPC) codes deliver very good performance when decoded with the bpalgorithm. Unfortunately, this algorithm has the disadvantage to be complex for implementation. In this paper, we investigate the bpalgorithm and its simplifications (bp-based, normalizedbp-based, offset bp-based). Previous works on normalized and offset bp-based proposed theoretical values for the offset and normalization factors, we perform simulations which allow to validate these theoretical results.
Recently, low-density parity-check (LDPC) codes have attracted much attention. LDPC codes can achieve the near Shannon limit performance like turbo codes. For the LDPC codes, the reduced complexity decoding algorithms...
详细信息
Recently, low-density parity-check (LDPC) codes have attracted much attention. LDPC codes can achieve the near Shannon limit performance like turbo codes. For the LDPC codes, the reduced complexity decoding algorithms referred to as uniformly most powerful (UMP) bp-and normalized bp-based algorithms were proposed for bpSK on an additive white Gaussian noise (AWGN) channel. The conventional bp and bp-basedalgorithms can be applied to bpSK modulation. For high bit-rate transmission, multilevel modulation is preferred. Thus, the bpalgorithm for multilevel modulations is proposed in [I]. In this paper, we propose the bpalgorithm with reduced complexity for multilevel modulations, where the first likelihood of the proposed bpalgorithm is modified to adjust multilevel modulations. We compare the error rate performance of the proposed algorithm with that of the conventional algorithm [ 1] on AWGN and flat Rayleigh fading channels. We also propose the UMP bp- and normalized bp-based algorithms for multilevel modulations on AWGN and flat Rayleigh fading channels. We show that the error rate performance of the proposed bpalgorithm is almost identical to that of the algorithm in [1], where the decoding complexity of the proposed bpalgorithm is less than that of the algorithm in [1]. We also show that the proposed bp-basedalgorithms can achieve the good trade-off between the complexity and the error rate performance.
暂无评论