军事卫星通信由于需满足信息实时性、传输速率高、通信容量大以及符合星间链路信道的时变特性等要求,通常采用高编码增益、高吞吐量的信道编码方案。低密度奇偶校验(Low-Density Parity-Check,LDPC)码由于具备接近Shannon极限的优异纠...军事卫星通信由于需满足信息实时性、传输速率高、通信容量大以及符合星间链路信道的时变特性等要求,通常采用高编码增益、高吞吐量的信道编码方案。低密度奇偶校验(Low-Density Parity-Check,LDPC)码由于具备接近Shannon极限的优异纠错性能和可并行计算的特性成为卫星通信主导信道编码标准之一。目前卫星通信接收机的译码器模块设计仍存在诸如无法实时在线判断迭代停止、系统吞吐量受限、大量判决电路影响核心译码电路的低功耗和实时性等问题。考虑上述问题,以因子图模型为基础,针对空间数据系统咨询委员会(Consultative Committee for Space Data Systems,CCSDS)标准深空通信码型,将校验节点归一化满足概率进化图案与LDPC译码器状态紧密耦合,给出可实时在线判断迭代停止的最优停止准则,实现高性能、低复杂度的停止准则译码算法设计。当优先考虑高吞吐量时,误码率(Bit Error Rate,BER)性能退化0.13 dB,中低信噪比平均迭代次数(Average Number of Iteration,ANI)降低50%以上;当优先考虑纠错性能时,BER性能仅退化0.02 dB,同时大幅降低ANI。该译码算法为高效低复杂度LDPC译码器设计提供有效解决方案。展开更多
The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder nee...The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder needs to store every ＂1＂ of the generator matrices by using huge chip area. In order to solve this problem, we need to design the protograph LDPC codes with circular generator matrices. A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed. The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix. This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices, and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem. Simulation results in ad- ditive white Gaussian noise （AWGN） channels show that the bit error rate （BER） performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.展开更多
The 16-ary quadrature amplitude modulation （16QAM） is a high spectral efficient scheme for high-speed transmission systems. To remove the phase ambiguity in the coherent detection system, differential-encoded 16QAM ...The 16-ary quadrature amplitude modulation （16QAM） is a high spectral efficient scheme for high-speed transmission systems. To remove the phase ambiguity in the coherent detection system, differential-encoded 16QAM （DE-16QAM） is usually used, however, it will cause performance degradation about 3 dB as compared to the conventional 16QAM. To overcome the performance loss, a serial concatenated system with outer low density parity check （LDPC） codes and inner DE-16QAM is proposed. At the receiver, joint iterative differential demodulation and decoding （ID） is carried out to approach the maximum likelihood performance. Moreover, a genetic evolution algorithm based on the extrinsic information transfer chart is proposed to optimize the degree distribution of the outer LDPC codes. Both theoretical analyses and simulation results indicate that this algorithm not only compensates the performance loss, but also obtains a significant performance gain, which is up to 1 dB as compared to the conventional non-DE-16QAM.展开更多
This letter gives a random construction for Low Density Parity Check (LDPC) codes, which uses an iterative algorithm to avoid short cycles in the Tanner graph. The construction method has great flexible choice in LDPC...This letter gives a random construction for Low Density Parity Check (LDPC) codes, which uses an iterative algorithm to avoid short cycles in the Tanner graph. The construction method has great flexible choice in LDPC code's parameters including codelength, code rate, the least girth of the graph, the weight of column and row in the parity check matrix. The method can be applied to the irregular LDPC codes and strict regular LDPC codes. Systemic codes have many applications in digital communication, so this letter proposes a construction of the generator matrix of systemic LDPC codes from the parity check matrix. Simulations show that the method performs well with iterative decoding.展开更多
This paper proposes a scheme to construct time- frequency codes based on protograph low density parity check （LDPC） codes in orthogonal frequency division multiplexing （OFDM） communication systems. This approach s...This paper proposes a scheme to construct time- frequency codes based on protograph low density parity check （LDPC） codes in orthogonal frequency division multiplexing （OFDM） communication systems. This approach synthesizes two techniques： protograph LDPC codes and OFDM. One symbol of encoded information by protograph LDPC codes corresponds to one sub-carrier, namely the length of encoded information equals to the number of sub-carriers. The design of good protograph LDPC codes with short lengths is given, and the proposed proto- graph LDPC codes can be of fast encoding, which can reduce the encoding complexity and simplify encoder hardware implementa- tion. The proposed approach provides a higher coding gain in the Rayleigh fading channel. The simulation results in the Rayleigh fading channel show that the bit error rate （BER） performance of the proposed time-frequency codes is as good as random LDPC- OFDM codes and is better than Tanner LDPC-OFDM codes under the condition of different fading coefficients.展开更多
针对极化码串行抵消列表比特翻转(Successive Cancellation List Bit-Flip, SCLF)译码算法复杂度较高的问题,提出一种基于分布式奇偶校验码的低复杂度极化码SCLF译码(SCLF Decoding Algorithm for Low-Complexity Polar Codes Based on ...针对极化码串行抵消列表比特翻转(Successive Cancellation List Bit-Flip, SCLF)译码算法复杂度较高的问题,提出一种基于分布式奇偶校验码的低复杂度极化码SCLF译码(SCLF Decoding Algorithm for Low-Complexity Polar Codes Based on Distributed Parity Check Codes, DPC-SCLF)算法。与仅采用循环冗余校验(Cyclic Redundancy Check, CRC)码校验的SCLF译码算法不同,该算法首先利用极化信道偏序关系构造关键集,然后采用分布式奇偶校验(Parity Check, PC)码与CRC码结合的方式对错误比特进行检验、识别和翻转,提高了翻转精度,减少了重译码次数。此外,在译码时利用路径剪枝操作,提高了正确路径的竞争力,改善了误码性能,且利用提前终止译码进程操作,减少了译码比特数。仿真结果表明,与D-Post-SCLF译码算法和RCS-SCLF译码算法相比,所提出算法具有更低的译码复杂度且在中高信噪比下具有更好的误码性能。展开更多
In this paper, we present a Joint Source-Channel Decoding algorithm (JSCD) for Low-Density Parity Check (LDPC) codes by modifying the Sum-Product Algorithm (SPA) to account for the source redun-dancy, which results fr...In this paper, we present a Joint Source-Channel Decoding algorithm (JSCD) for Low-Density Parity Check (LDPC) codes by modifying the Sum-Product Algorithm (SPA) to account for the source redun-dancy, which results from the neighbouring Huffman coded bits. Simulations demonstrate that in the presence of source redundancy, the proposed algorithm gives better performance than the Separate Source and Channel Decoding algorithm (SSCD).展开更多
目的:为减少校验节点过程总计算量,对低密度奇偶校验译码提出低复杂度的和积译码算法。创新点:降低和积译码计算复杂度的同时不损失译码性能。方法:在校验节点过程中使用时移快速傅里叶变换降低计算复杂度;在变量节点过程中使用优化后...目的:为减少校验节点过程总计算量,对低密度奇偶校验译码提出低复杂度的和积译码算法。创新点:降低和积译码计算复杂度的同时不损失译码性能。方法:在校验节点过程中使用时移快速傅里叶变换降低计算复杂度;在变量节点过程中使用优化后的常整数提升译码性能。所提算法性能在Wi-MAX和WLAN中的标准低密度奇偶校验码上测试并验证,且与SPA、SSPA和MSPA进行性能比较(图1-3)。结论:仿真结果表明,整体上所述算法对编码增益的提高值在0.04到0.46 d B之间;与和积算法(SPA)相比,所述算法可以降低译码过程所需42%-67%的全部代数运算操作。展开更多
文摘军事卫星通信由于需满足信息实时性、传输速率高、通信容量大以及符合星间链路信道的时变特性等要求,通常采用高编码增益、高吞吐量的信道编码方案。低密度奇偶校验(Low-Density Parity-Check,LDPC)码由于具备接近Shannon极限的优异纠错性能和可并行计算的特性成为卫星通信主导信道编码标准之一。目前卫星通信接收机的译码器模块设计仍存在诸如无法实时在线判断迭代停止、系统吞吐量受限、大量判决电路影响核心译码电路的低功耗和实时性等问题。考虑上述问题,以因子图模型为基础,针对空间数据系统咨询委员会(Consultative Committee for Space Data Systems,CCSDS)标准深空通信码型,将校验节点归一化满足概率进化图案与LDPC译码器状态紧密耦合,给出可实时在线判断迭代停止的最优停止准则,实现高性能、低复杂度的停止准则译码算法设计。当优先考虑高吞吐量时,误码率(Bit Error Rate,BER)性能退化0.13 dB,中低信噪比平均迭代次数(Average Number of Iteration,ANI)降低50%以上;当优先考虑纠错性能时,BER性能仅退化0.02 dB,同时大幅降低ANI。该译码算法为高效低复杂度LDPC译码器设计提供有效解决方案。
基金supported by Beijing Natural Science Foundation(4102050)the National Natural Science of Foundation of China(NSFC)-Korea Science and Engineering Foundation (KOSF) Joint Research Project of China and Korea (60811140343)
文摘The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder needs to store every ＂1＂ of the generator matrices by using huge chip area. In order to solve this problem, we need to design the protograph LDPC codes with circular generator matrices. A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed. The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix. This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices, and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem. Simulation results in ad- ditive white Gaussian noise （AWGN） channels show that the bit error rate （BER） performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.
基金supported by the National Natural Science Foundation of China(61171101)the State Major Science and Technology Special Projects(2009ZX03003-011-03)
文摘The 16-ary quadrature amplitude modulation （16QAM） is a high spectral efficient scheme for high-speed transmission systems. To remove the phase ambiguity in the coherent detection system, differential-encoded 16QAM （DE-16QAM） is usually used, however, it will cause performance degradation about 3 dB as compared to the conventional 16QAM. To overcome the performance loss, a serial concatenated system with outer low density parity check （LDPC） codes and inner DE-16QAM is proposed. At the receiver, joint iterative differential demodulation and decoding （ID） is carried out to approach the maximum likelihood performance. Moreover, a genetic evolution algorithm based on the extrinsic information transfer chart is proposed to optimize the degree distribution of the outer LDPC codes. Both theoretical analyses and simulation results indicate that this algorithm not only compensates the performance loss, but also obtains a significant performance gain, which is up to 1 dB as compared to the conventional non-DE-16QAM.
基金Supported by the National Natural Science Foundation of China(No.60472053)
文摘This letter gives a random construction for Low Density Parity Check (LDPC) codes, which uses an iterative algorithm to avoid short cycles in the Tanner graph. The construction method has great flexible choice in LDPC code's parameters including codelength, code rate, the least girth of the graph, the weight of column and row in the parity check matrix. The method can be applied to the irregular LDPC codes and strict regular LDPC codes. Systemic codes have many applications in digital communication, so this letter proposes a construction of the generator matrix of systemic LDPC codes from the parity check matrix. Simulations show that the method performs well with iterative decoding.
基金supported by the Beijing Natural Science Foundation of China (4102050)the National Natural Science of Foundation of China (NSFC)-Korea Science and Engineering Foundation (KOSF) Joint Research Project of China and Korea (60811140343)
文摘This paper proposes a scheme to construct time- frequency codes based on protograph low density parity check （LDPC） codes in orthogonal frequency division multiplexing （OFDM） communication systems. This approach synthesizes two techniques： protograph LDPC codes and OFDM. One symbol of encoded information by protograph LDPC codes corresponds to one sub-carrier, namely the length of encoded information equals to the number of sub-carriers. The design of good protograph LDPC codes with short lengths is given, and the proposed proto- graph LDPC codes can be of fast encoding, which can reduce the encoding complexity and simplify encoder hardware implementa- tion. The proposed approach provides a higher coding gain in the Rayleigh fading channel. The simulation results in the Rayleigh fading channel show that the bit error rate （BER） performance of the proposed time-frequency codes is as good as random LDPC- OFDM codes and is better than Tanner LDPC-OFDM codes under the condition of different fading coefficients.
文摘In this paper, we present a Joint Source-Channel Decoding algorithm (JSCD) for Low-Density Parity Check (LDPC) codes by modifying the Sum-Product Algorithm (SPA) to account for the source redun-dancy, which results from the neighbouring Huffman coded bits. Simulations demonstrate that in the presence of source redundancy, the proposed algorithm gives better performance than the Separate Source and Channel Decoding algorithm (SSCD).
文摘目的:为减少校验节点过程总计算量,对低密度奇偶校验译码提出低复杂度的和积译码算法。创新点:降低和积译码计算复杂度的同时不损失译码性能。方法:在校验节点过程中使用时移快速傅里叶变换降低计算复杂度;在变量节点过程中使用优化后的常整数提升译码性能。所提算法性能在Wi-MAX和WLAN中的标准低密度奇偶校验码上测试并验证,且与SPA、SSPA和MSPA进行性能比较(图1-3)。结论:仿真结果表明,整体上所述算法对编码增益的提高值在0.04到0.46 d B之间;与和积算法(SPA)相比,所述算法可以降低译码过程所需42%-67%的全部代数运算操作。
