Differential chaotic bit-interleaved coded modulation (DC-BICM) system can achieve coding gain from channel code without loss of bandwidth in the differential chaos shift keying (DCSK) system, but the current DC-BICM ...
详细信息
Differential chaotic bit-interleaved coded modulation (DC-BICM) system can achieve coding gain from channel code without loss of bandwidth in the differential chaos shift keying (DCSK) system, but the current DC-BICM system using the belief propagation decoding algorithm has high decoding complexity, which brings burdens to resource-limited applications. In this letter, a novel collaborative design framework based on joint coding and decoding optimization is proposed for the DC-BICM system over multipath Rayleigh channels. Firstly, the column-weight-based (CWB) shuffled scheduling decoding is introduced into the DC-BICM system to lower the decoding complexity, called shuffled-based DC-BICM system. Then, a CWB extrinsic information transfer (CWB-EXIT) algorithm is developed for the theoretical analysis of this system. With the CWB-EXIT algorithm, a low-storage protograph low-density parity-check (P-LDPC) code is designed for this system, and the column-weight distribution is taken as an important constraint in the collaborative design process. In this way, the storage space used for storing the scheduling order in the CWB shuffled scheduling can be saved, whose size is proportional to code length. Theoretical analysis and simulations show that the shuffled-based DC-BICM system with the low-storage P-LDPC code can achieve lower decoding complexity, less storage requirement and better performance than the existing systems.
Non binary low-density parity-check (NB-LDPC) codes tend to exhibit much better performance than their binary counterparts while suffering from very high computational complexity. As a type of hard-decision NB-LDPC de...
详细信息
ISBN:
(纸本)9781728107356
Non binary low-density parity-check (NB-LDPC) codes tend to exhibit much better performance than their binary counterparts while suffering from very high computational complexity. As a type of hard-decision NB-LDPC decoding algorithm, the iterative reliability-based majority-logic decoding (IRB-MLGD) algorithms are attractive for their low computation complexity, coming with obvious performance degradation. Aiming at improving the error-correction performance, in this paper, we introduce few redundant bits to the original NB-LDPC encoding and the corresponding checksum operations to the improved iterative soft reliability-based (IISRB)-MLGD. Based on the joint coding and decoding method, the obtained redundancy-aided (RA)-IISRB decoding algorithm shows significant performance improvement while maintaining the low-complexity property. Simulation results demonstrate that the proposed algorithm can achieve a more than 1.0dB extra coding gain over the original IISRB with a slight decrease of code rate.
暂无评论